Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, and F. Kenneth Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symp. on Disc. Alg., pages 32–42, January 1990.
2. Cecelia R. Aragon and Raimund G. Seidel. Randomized search trees. In Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pages 540–545, October 1989.
3. Paul F. Dietz. Maintaining order in a linked list. In Proc. 14th ACM STOC, pages 122–127, May 1982.
4. Paul F. Dietz. Fully persistent arrays. In Workshop on Algorithms and Data Structures, pages 67–74, August 1989.
5. Paul F. Dietz and Daniel D. Sleator. Two algorithms for maintaining order in a list. In Proc. 19th ACM STOC, pages 365–372, May 1987. A revised version of the paper is available that tightens up the analysis.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Layered List Labeling;Proceedings of the ACM on Management of Data;2024-05-10
2. Online List Labeling: Breaking the \({\log^2 n}\) Barrier;SIAM Journal on Computing;2024-04-11
3. Online List Labeling: Breaking the log2n Barrier;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Online Labeling: Algorithms, Lower Bounds and Open Questions;Computer Science – Theory and Applications;2018
5. On Randomized Online Labeling with Polynomially Many Labels;Automata, Languages, and Programming;2013