Author:
Dillabaugh Craig,He Meng,Maheshwari Anil,Zeh Norbert
Funder
National Sciences and Engineering Research Council of Canada
School of Computer Science, Carleton University
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference32 articles.
1. Agarwal, P.K., Arge, L., Murali, T.M., Varadarajan, K.R., Vitter, J.S.: I/O-efficient algorithms for contour-line extraction and planar graph blocking (extended abstract). In: SODA, pp. 117–126 (1998)
2. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
3. Lecture Notes in Computer Science;LC Aleardi,2005
4. Aleardi, L.C., Devillers, O., Schaeffer, G.: Succinct representations of planar maps. Theor. Comput. Sci. 408(2–3), 174–187 (2008)
5. Arge, L., Danner, A., Teh, S.M.: I/O-efficient point location using persistent b-trees. In: Ladner, R.E. (ed.) ALENEX, pp. 82–92, Baltimore, MD (2003)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献