Sciweavers

530 search results - page 5 / 106
» Universal randomized switching
Sort
View
189
Voted
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 6 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
CCA
2005
Springer
16 years 11 days ago
Randomness and Universal Machines
Santiago Figueira, Frank Stephan, Guohua Wu
SODA
2008
ACM
59views Algorithms» more  SODA 2008»
15 years 8 months ago
Universality of random graphs
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vo...
202
Voted
SPAA
2005
ACM
16 years 12 days 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