Cache-Aware and Cache-Oblivious Adaptive Sorting-Reference-Cited by-同舟云学术

Cache-Aware and Cache-Oblivious Adaptive Sorting

Published:2005 Issue: Volume: Page:576-588
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Brodal Gerth Stølting,Fagerberg Rolf,Moruz Gabriel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11523468_47.pdf

Reference21 articles.

1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)

2. Arge, L.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets

3. Arge, L., Brodal, G.S., Fagerberg, R.: Cache-oblivious data structures. In: Mehta, D., Sahni, S. (eds.) Handbook of Data Structures and Applications, p. 27. CRC Press, Boca Raton (2004)

4. Arge, L., Knudsen, M., Larsen, K.: A general lower bound on the I/O-complexity of comparison-based algorithms. In: Proc. of Workshop on Algorithms and Data Structures (1993)

5. Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7, 448–461 (1973)

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

1. Competitive Data-Structure Dynamization;ACM Transactions on Algorithms;2024-06-28

2. Cache-Oblivious Model;Encyclopedia of Algorithms;2016

3. Cache-Oblivious Model;Encyclopedia of Algorithms;2015

4. Adaptive Algorithms for Planar Convex Hull Problems;IEICE Transactions on Information and Systems;2011

5. Two Constant-Factor-Optimal Realizations of Adaptive Heapsort;Lecture Notes in Computer Science;2011