Sciweavers

530 search results - page 5 / 106
» Universal randomized switching
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
14 years 9 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
57
Voted
CCA
2005
Springer
15 years 3 months ago
Randomness and Universal Machines
Santiago Figueira, Frank Stephan, Guohua Wu
SODA
2008
ACM
59views Algorithms» more  SODA 2008»
14 years 11 months ago
Universality of random graphs
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vo...
88
Voted
SPAA
2005
ACM
15 years 3 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay