Sciweavers

1101 search results - page 210 / 221
» Forcing in proof theory
Sort
View
SPAA
2005
ACM
14 years 1 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
14 years 1 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
EUROPAR
2005
Springer
14 years 1 months ago
Batch-Scheduling Dags for Internet-Based Computing
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...
Grzegorz Malewicz, Arnold L. Rosenberg
ACMICEC
2004
ACM
148views ECommerce» more  ACMICEC 2004»
14 years 28 days ago
A secure and private clarke tax voting protocol without trusted authorities
Electronic voting has become one of the most popular activities over the Internet. Security and privacy are always regarded as crucial factors in electronic voting system design. ...
Changjie Wang, Ho-fung Leung
SPAA
2004
ACM
14 years 28 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter