Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Comm. ACM, 1116–1127 (1988)
2. Arge, L., Bender, M.A., Demaine, E., Holland-Minkley, B., Munro, J.I.: Cache-oblivious priority queue and graph algorithm applications. In: Proc. 34th STOC, pp. 268–276 (2002)
3. Arge, L., Brodal, G.S., Toma, L.: On external-memory MST, SSSP and multi-way planar graph separation. J. Alg. 53, 186–206 (2004)
4. Lecture Notes in Computer Science;L. Arge,2004
5. Arge, L., Meyer, U., Toma, L., Zeh, N.: On external-memory planar depth first search. J. Graph Alg. and Appl. 7(2), 105–129 (2003)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts;Lecture Notes in Computer Science;2019
2. Cache-Oblivious Model;Encyclopedia of Algorithms;2016
3. Cache-Oblivious Model;Encyclopedia of Algorithms;2015
4. Terracost;ACM Journal of Experimental Algorithmics;2008-06
5. Engineering a cache-oblivious sorting algorithm;ACM Journal of Experimental Algorithmics;2008-06