Author:
Bădoiu Mihai,Cole Richard,Demaine Erik D.,Iacono John
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Mihai Bădoiu, Erik D. Demaine, A simplified and dynamic unified structure, in: Proceedings of the 6th Latin American Symposium on Theoretical Informatics, in: Lecture Notes in Computer Science, vol. 2976, Buenos Aires, Argentina, April 2004, pp. 466–473
2. Organization and maintenance of large ordered indexes;Bayer;Acta Informatica,1972
3. Design and analysis of a data structure for representing sorted lists;Brown;SIAM Journal on Computing,1980
4. On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences;Cole;SIAM Journal on Computing,2000
5. On the dynamic finger conjecture for splay trees. Part II: The proof;Cole;SIAM Journal on Computing,2000
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lazy Search Trees;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
2. Belga B-Trees;Theory of Computing Systems;2020-06-27
3. A study on splay trees;Theoretical Computer Science;2019-07
4. Belga B-Trees;Computer Science – Theory and Applications;2019
5. Biased Predecessor Search;Algorithmica;2016-03-28