Optimal Algorithms for List Indexing and Subset Rank

  title={Optimal Algorithms for List Indexing and Subset Rank},
  author={Paul F. Dietz},
Fredman and Saks [1] have proved a n(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. 
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-7 of 7 references

On the complexity of maintaining partial sums

  • Andrew C. Yao
  • SIAM J. On Computing,
  • 1985
3 Excerpts

Tarjan . Amortized computational complexity

  • E Robert
  • Sorting and Searching , volume 1 of Data…
  • 1984

Similar Papers

Loading similar papers…