Optimal algorithms for List Indexing and Subset Rank
Fredman and Saks  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.
- 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
- Kurt Mehlhorn. Sorting and Searching, volume 1 of Data Structures and Algorithms, Springer-Verlag, New York, 1984.Google Scholar
- Robert E. Tarjan. Amortized computational complexity. SIAM J. on Alg. and Disc. Meth., 6(2):306–318, 1985.Google Scholar
- Andrew C. Yao. On the complexity of maintaining partial sums. SIAM J. On Computing, 14(2):277–288, May 1985.Google Scholar