Author:
Bhushan Alka,Gopalan Sajith
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1998)
2. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms, Massachusetts, Addison-Wesley (1974)
3. Arge, L.: The buffer tree: A technique for designing batched external data structures. Algorithmica 37(1), 1–24 (2003)
4. Arge, L., Revsbaek, M., Zeh, N.: I/O-efficient computation of water flow across a terrain. In: Proc. 26th ACM Symposium on Computational Geometry, pp. 403–412 (2010)
5. Chazelle, B.: The soft heap: an approximate priority queue with optimal error rate. Journal of the ACM 47(6), 1012–1027 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献