Sciweavers

5153 search results - page 101 / 1031
» Introduction to Randomized Algorithms
Sort
View
PODC
2010
ACM
15 years 6 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
SPAA
2010
ACM
15 years 2 months ago
On the bit communication complexity of randomized rumor spreading
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...
Pierre Fraigniaud, George Giakkoupis
WSC
2008
15 years 4 months ago
A plug-in-based architecture for random number generation in simulation systems
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...
Roland Ewald, Johannes Rossel, Jan Himmelspach, Ad...
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
15 years 2 months ago
Permutations Without Long Decreasing Subsequences and Random Matrices
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 ...
Piotr Sniady
123
Voted
EUROCRYPT
2004
Springer
15 years 7 months ago
Construction of Secure Random Curves of Genus 2 over Prime Fields
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...
Pierrick Gaudry, Éric Schost