Concepedia
Information Processing Letters · 1990 · 60 citations · 7 references
ComputingComputer ScienceMathematicsAlgorithmsData StructuresDatabasesAlgorithmic ComplexityDictionary CompilationMemory HierarchySpace ComplexityTime ComplexityWord OrderLogarithmic Space ComplexityWord Order Complexity
7
Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time
Michael L. Fredman, János Komlós, Endre Szemerédi · Journal of the ACM · 1984 · 758 citations · Full text
Computing, Computer Science, Data Management +4
Design and implementation of an efficient priority queue
Peter Emde Boas, R. Kaas, E.E. Zijlstra · Theory of Computing Systems · 1976 · 511 citations
Business, Computer Engineering, Computer Science +11
Preserving order in a forest in less than logarithmic time and linear space
P. van Emde Boas · Information Processing Letters · 1977 · 424 citations
Natural Resources, Forestry, Forest Ecology +1
Log-logarithmic worst-case range queries are possible in space Θ(N)
Dan E. Willard · Information Processing Letters · 1983 · 321 citations
Computing, Computer Science, Mathematics +11
A priority queue in which initialization and queue operations takeO(loglogD) time
D. Barton Johnson · Theory of Computing Systems · 1981 · 122 citations
Business, Computer Science, Computer Systems +14