3208 search results - page 342 / 642 » A Lower Bound for Primality |
172
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
182
click to vote
PODC
1999
ACM
15 years 11 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
190
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
218
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
191
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...