Author:
Demaine Erik D.,Iacono John,Koumoutsos Grigorios,Langerman Stefan
Funder
Fonds De La Recherche Scientifique - FNRS
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference31 articles.
1. Adelson-Velskiı̆, G.M., Landis, E.M.: An algorithm for organization of information. Dokl. Akad. Nauk SSSR 146, 263–266 (1962)
2. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988). https://doi.org/10.1145/48529.48535
3. Badoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2), 86–96 (2007). https://doi.org/10.1016/j.tcs.2007.03.002
4. Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indices. Acta Inf. 1, 173–189 (1972). https://doi.org/10.1016/j.tcs.2007.03.002
5. Bose, P., Douïeb, K., Langerman, S.: Dynamic optimality for skip lists and b-trees. In: Symposium on Discrete Algorithms, SODA. http://dl.acm.org/citation.cfm?id=1347082.1347203, pp 1106–1114 (2008)