3228 search results - page 341 / 646 » Computationally Sound Proofs |
118
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
147
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
131
click to vote
TLCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
121
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
146
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...