{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:13Z","timestamp":1775282293192,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540664277","type":"print"},{"value":"9783540483182","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48318-7_19","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T20:20:56Z","timestamp":1193343656000},"page":"228-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["LEDA-SM: Extending LEDA to Secondary Memory"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Crauser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"R. Ahuja","year":"1990","unstructured":"R. Ahuja, K. Mehlhorn, J. Orlin, and R. Tarjan. Faster algorithms for the shortest path problem. Journal of the ACM, 37(2):213\u2013223, 1990.","journal-title":"Journal of the ACM"},{"key":"19_CR2","unstructured":"L. Arge. Efficient external-memory data structures and applications. PhD thesis, University of Aarhus, 1996."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"L. Arge. External-memory algorithms with applications in geographic information systems. CS Department, Duke Univeristy, technical report, 1996.","DOI":"10.7146\/brics.v3i12.19975"},{"key":"19_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 1st Workshop on Algorithm Engineering and Experimentation (ALENEX\u2019 99)","author":"L. Arge","year":"1999","unstructured":"L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter. Efficient bulk operations on dynamic R-trees. In C. C. McGeoch and M. T. Goodrich, editors, Proceedings of the 1st Workshop on Algorithm Engineering and Experimentation (ALENEX\u2019 99), volume (to appear) of Lecture Notes in Computer Science. Springer, 1999."},{"issue":"6","key":"19_CR5","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/0306-4379(96)00025-7","volume":"21","author":"R. Baeza-Yates","year":"1996","unstructured":"R. Baeza-Yates, E. Barbosa, and N. Ziviani. Hierarchies of indices for text searching. Information Systems, 21(6):497\u2013514, 1996.","journal-title":"Information Systems"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"R. D. Barve, E. F. Grove, and J. S. Vitter. Simple randomized mergesort on parallel disks. In 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA\u2019 96), pages 109\u2013118. ACM, June 1996.","DOI":"10.1145\/237502.237513"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer and E. McCreight. Organization and maintenance of large ordered indizes. Acta Informatica, 1:173\u2013189, 1972.","journal-title":"Acta Informatica"},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BFb0054359","volume-title":"Proceedings 6th Scandinavian Workshop on Algorithm Theory","author":"G. S. Brodal","year":"1998","unstructured":"G. S. Brodal and J. Katajainen. Worst-case efficient external-memory priority queues. In S. Arnborg and L. Ivansson, editors, Proceedings 6th Scandinavian Workshop on Algorithm Theory, volume 1432 of Lecture Notes in Computer Science, pages 107\u2013118, Stockholm, Sweden, July 1998. Springer."},{"key":"19_CR9","unstructured":"Y.-F. Chian, M. T. Goodrich, E. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), pages 139\u2013149, New York, 1995. acm-Press."},{"key":"19_CR10","unstructured":"Y.-J. Chiang. Dynamic and I\/O-Efficient Algorithms for Computational Geometry and Graph Algorithms. PhD thesis, Brown University, 1995."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"A. Colvin and T. Cormen. Vic*: A compiler for virtual-memory c*. 3rd International Workshop on High-Level Parallel Programming Models and Supportive Environments, pages 23\u201333, 1998.","DOI":"10.1109\/HIPS.1998.665140"},{"key":"19_CR12","unstructured":"Crauser, Mehlhorn, Althaus, Brengel, Buchheit, Keller, Krone, Lambert, Schulte, Thiel, Westphal, and Wirth. On the performance of LEDA-SM. Technical Report MPI-I-98-1-028, Max-Planck Institut f\u00fcr Informatik, 1998."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"A. Crauser and P. Ferragina. On constructing suffix arrays in external memory. European Symposium on Algorithms (ESA\u201999), 1999.","DOI":"10.1007\/3-540-48481-7_20"},{"key":"19_CR14","unstructured":"A. Crauser, P. Ferragina, and U. Meyer. Efficient priority queues for external memory. Working Paper, Oktober 1997."},{"key":"19_CR15","first-page":"113","volume-title":"Promotion tut not: Innovationsmotor \u201cGraduiertenkolleg\u201d (Aachener Beitr\u00e4ge zur Informatik; Band 21)","author":"A. Crauser","year":"1997","unstructured":"A. Crauser, K. Mehlhorn, and U. Meyer. K\u00fcrzeste-Wege-Berechnung bei sehr gro\u00dfen Datenmengen. In O. Spaniol, editor, Promotion tut not: Innovationsmotor \u201cGraduiertenkolleg\u201d (Aachener Beitr\u00e4ge zur Informatik; Band 21), pages 113\u2013132S., Aachen, 1997. Verlag der Augustinus Buchhandlung."},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong. Extendible hashing \u2014 A fast access method for dynamic files. ACM Transactions on Database Systems, 4(3):315\u2013344, Sept. 1979. Also published in\/as: IBM, Research Report RJ2305, Jul. 1978.","journal-title":"ACM Transactions on Database Systems"},{"key":"19_CR17","unstructured":"M. Farach, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottleneck in suffix tree construction. IEEE Symposium on Foundations of Computer Science, 1998."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"P. Ferragina and R. Grossi. A fully-dynamic data structure for external substring search. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC\u2019 95), pages 693\u2013702. ACM, May 1995.","DOI":"10.1145\/225058.225287"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In IEEE, editor, Proceedings of the 34th Annual Symposium on Foundations of Comptuer Science, pages 714\u2013723, Palo Alto, CA, November 1993. IEEE Computer Society Press.","DOI":"10.1109\/SFCS.1993.366816"},{"key":"19_CR20","unstructured":"D. Hutchinson, A. Makeshwari, J.-R. Sack, and R. Velicescu. Early experiences in implementing the buffer tree. Workshop on Algorithmic Engineering, 1997."},{"issue":"5","key":"19_CR21","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal of Computing, 22(5):935\u2013948, 1993.","journal-title":"SIAM Journal of Computing"},{"key":"19_CR22","unstructured":"K. Mehlhorn and S. N\u00e4her. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. Draft versions of some chapters are available at http:\/\/www.mpi-sb.mpg.de\/~;mehlhorn ."},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA, a platform for combinatorial and geometric computing. Communications of the ACM, 38:96\u2013102, 1995.","journal-title":"Communications of the ACM"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, pages 17\u201328, 1994.","DOI":"10.1109\/2.268881"},{"key":"19_CR25","series-title":"Lect Notes Comput Sci","volume-title":"Workshop in Algorithmic Engineering and Experimentation (ALENEX)","author":"P. Sanders","year":"1999","unstructured":"P. Sanders. Fast priority queues for cached memory. In Workshop in Algorithmic Engineering and Experimentation (ALENEX), Lecture Notes in Computer Science. Springer, 1999."},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01530929","volume":"3","author":"Ullman","year":"1991","unstructured":"Ullman and Yannakakis. The Input\/Output Complexity of Transitive Closure. Annals of Mathematics and Artificial Intelligence, 3:331\u2013360, 1991.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"D. E. Vengroff and J. S. Vitter. Supporting I\/O-efficient scientific computation in TPIE. In Symposium on Parallel and Distributed Processing (SPDP\u2019 95), pages 74\u201377. IEEE Computer Society Press, October 1995.","DOI":"10.1109\/SPDP.1995.530667"},{"issue":"2-3","key":"19_CR28","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J. Vitter","year":"1994","unstructured":"J. Vitter and E. Shriver. Optimal algorithms for parallel memory I:two-level memories. Algorithmica, 12(2-3):110\u2013147, 1994.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48318-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:28:59Z","timestamp":1737498539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48318-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664277","9783540483182"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-48318-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}