5580 search results - page 139 / 1116 » Randomized priority algorithms |
SPAA
2010
ACM
14 years 10 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
WSC
2008
15 years 9 days ago
2008
Simulations often depend heavily on random numbers, yet the impact of random number generators is recognized seldom. The generation of random numbers for simulations is not trivia...
COMBINATORICS
2007
14 years 10 months ago
2007
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
CSR
2006
Springer
15 years 1 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...