A general lower bound on the I/O-complexity of comparison-based algorithms-Reference-Cited by-同舟云学术

A general lower bound on the I/O-complexity of comparison-based algorithms

Published:1993 Issue: Volume: Page:83-94
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Arge Lars,Knudsen Mikael,Larsen Kirsten

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57155-8_238.pdf

Reference11 articles.

1. Aggarwal, A., Vitter, J.S.: The I/O Complexity of Sorting and Related Problems. Proceedings of 14th ICALP (1987), Lecture Notes in Computer Science 267, Springer Verlag, 467–478, and: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM, Vol 31 (9) (1988) 1116–1127.

2. Ben-Or, M.: Lower bounds for algebraic computation trees. Proceedings of 15th STOC (1983), 80–86.

3. Blum, M., Floyd, R.W, Pratt, V.R, Rivest, R.L, Tarjan, R.E.: Time bounds for selection. Journal of Computer and System Sciences, 7(4) (1972), 448–461.

4. Knudsen, M., Larsen, K.,: I/O-complexity of comparison and permutation problems. M.Sc. Thesis, Aarhus University, November 1992.

5. Knuth, D.E.: The Art of Computer Programming, Vol 3: Sorting and Searching, Addison-Wesley (1973) (p. 205–206).

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Batched Predecessor and Sorting with Size-Priced Information in External Memory;LATIN 2020: Theoretical Informatics;2020

2. External Sorting and Permuting;Encyclopedia of Algorithms;2016

3. External Sorting and Permuting;Encyclopedia of Algorithms;2015

4. Maximizing Range Sum in Spatial Databases;Encyclopedia of GIS;2015

5. Cache-Aware and Cache-Oblivious Adaptive Sorting;Automata, Languages and Programming;2005