Sorting in Linear Time? (1995)

Cached

Download Links

by Arne Andersson , Torben Hagerup , Stefan Nilsson
Citations:85 - 14 self

Documents Related by Co-Citation

149 Surpassing the information theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
70 On RAM priority queues – Mikkel Thorup - 1996
35 Sublogarithmic Searching Without Multiplications – Arne Andersson - 1995
669 Universal classes of hash functions – L Carter, M Wegman - 1979
41 Improved Parallel Integer Sorting without Concurrent Writing – Susanne Albers, Torben Hagerup - 1992
203 Design and implementation of an efficient priority queue – P van Emde Boas, R Kaas, E Zijlstra - 1977
222 Storing a sparse table with O(1) worst case access time – M L Fredman, J Komlós, E Szemerédi - 1984
138 Should tables be sorted – Andrew Chi-chih Yao - 1981
87 Log-logarithmic worst-case range queries are possible in space Theta(N – D E Willard - 1983
255 Efficiency of a good but not linear set-union algorithm – R E Tarjan - 1975
162 Trans-dichotomous algorithms for minimum spanning trees and shortest paths – M Fredman, D E Willard - 1990
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
16 Static dictionaries on AC RAMs: Query time \Theta( p ( log n= log log n)) is necessary and sufficient – Arne Andersson, Peter Bro Miltersen, Sren Riis, Mikkel Thorup - 1996
128 The cell probe complexity of dynamic data structures – M L Fredman, M E Saks - 1989
49 Lower bounds for Union-Split-Find related problems on random access machines – Peter Bro Miltersen - 1994
63 Optimal Bounds for the Predecessor Problem – Paul Beame, Faith E. Fich
546 The input/output complexity of sorting and related problems – A Aggarwal, J S Vitter - 1988
115 Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters – P van - 1977
46 Priority queues: Small, monotone and trans-dichotomous – R Raman - 1996