Optimal algorithms for List Indexing and Subset Rank

  • Paul F. Dietz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)


Fredman and Saks [1] have proved a Ω(log n/log log n) amortized time lower bound for two problems, List Indexing and Subset Rank, in the cell probe model with logarithmic word size. This paper gives algorithms for both problems that achieve the lower bound on a RAM with logarithmic word size.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Michael Fredman and Michael Saks. The cell probe complexity of dynamic data structures. In Proc. 21st ACM STOC, pages 345–354, May 1989.Google Scholar
  2. [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.CrossRefGoogle Scholar
  3. [3]
    Kurt Mehlhorn. Sorting and Searching, volume 1 of Data Structures and Algorithms, Springer-Verlag, New York, 1984.Google Scholar
  4. [4]
    Robert E. Tarjan. Amortized computational complexity. SIAM J. on Alg. and Disc. Meth., 6(2):306–318, 1985.Google Scholar
  5. [5]
    Andrew C. Yao. Should tables be sorted? Journal of the ACM, 28(3):615–628, July 1981.CrossRefGoogle Scholar
  6. [6]
    Andrew C. Yao. On the complexity of maintaining partial sums. SIAM J. On Computing, 14(2):277–288, May 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Paul F. Dietz
    • 1
  1. 1.Department of Computer ScienceUniversity of RochesterRochester

Personalised recommendations