Sciweavers

5580 search results - page 96 / 1116
» Randomized priority algorithms
Sort
View
76
Voted
RSA
2002
161views more  RSA 2002»
14 years 9 months ago
Asymptotic analysis of (3, 2, 1)-shell sort
: We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.
Robert T. Smythe, J. A. Wellner
CISS
2008
IEEE
15 years 4 months ago
Throughput of random access without message passing
— We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are sh...
Alexandre Proutiere, Yung Yi, Mung Chiang
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
14 years 11 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
STOC
2007
ACM
110views Algorithms» more  STOC 2007»
15 years 10 months ago
Randomly coloring planar graphs with fewer colors than the maximum degree
Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
15 years 10 months ago
Oblivious routing in directed graphs with random demands
Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leig...