Sciweavers

658 search results - page 1 / 132
» Lower bounds for sorting networks
Sort
View
122
Voted
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
15 years 7 months ago
Lower Bounds on Correction Networks
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such netw...
Grzegorz Stachowiak
123
Voted
SIAMCOMP
1998
162views more  SIAMCOMP 1998»
15 years 2 months ago
Hypercubic Sorting Networks
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...
Frank Thomson Leighton, C. Greg Plaxton
STOC
1995
ACM
117views Algorithms» more  STOC 1995»
15 years 6 months ago
Lower bounds for sorting networks
Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. ...
114
Voted
SODA
1992
ACM
106views Algorithms» more  SODA 1992»
15 years 3 months ago
Comparison-Sorting and Selecting in Totally Monotone Matrices
An m
Noga Alon, Yossi Azar
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 2 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt