Optimal algorithms for list indexing and subset rank

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 382 LNCS, Issue , 1989, Pages 39-46

  Dietz, Paul F ^a  

^a UNIVERSITY OF ROCHESTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

AMORTIZED TIME; CELL PROBES; LOWER BOUNDS; OPTIMAL ALGORITHM;

INDEXING (OF INFORMATION);

EID: 85031913950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51542-9_5     Document Type: Conference Paper

References (6)

1. Michael Fredman and Michael Saks. The cell probe complexity of dynamic data structures. In Proc. 21st ACM STOC, pages 345–354, May 1989.
2. Michael L. Fredman. The complexity of maintaining an array and computing its partial sums. Journal of the ACM, 29(1):250–260, January 1982.
3. Kurt Mehlhorn. Sorting and Searching, volume 1 of Data Structures and Algorithms, Springer-Verlag, New York, 1984.
4. Robert E. Tarjan. Amortized computational complexity. SIAM J. on Alg. and Disc. Meth., 6(2):306–318, 1985.
5. Andrew C. Yao. Should tables be sorted? Journal of the ACM, 28(3):615–628, July 1981.
6. Andrew C. Yao. On the complexity of maintaining partial sums. SIAM J. On Computing, 14(2):277–288, May 1985.