Cache oblivious distribution sweeping

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 426-438

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL GEOMETRY; NEAREST NEIGHBOR SEARCH;

ALL NEAREST NEIGHBORS; AXIS PARALLEL RECTANGLES; CACHE-OBLIVIOUS; CACHE-OBLIVIOUS MODEL; DIVIDE-AND-CONQUER ALGORITHM; LINE SEGMENT INTERSECTION; MERGING PROCESS; SPECIFIC PROBLEMS;

CACHE MEMORY;

EID: 84869191441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_37     Document Type: Conference Paper

References (19)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, Sept. 1988.
2. L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. Cache-oblivious priority queue and graph algorithm applications. In Proc. 34th Ann. ACM Symp. on Theory of Computing. ACM Press, 2002. To appear.
3. M. J. Atallah and J.-J. Tsay. On the parallel-decomposability of geometric problems. Algorithmica, 8:209-231, 1992.
4. R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173-189, 1972.
5. M. A. Bender, R. Cole, and R. Raman. Exponential structures for efficient cacheoblivious algorithms. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), 2002. These proceedings.
6. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Ann. Symp. on Foundations of Computer Science, pages 399-409, 2000.
7. M. A. Bender, Z. Duan, J. Iacono, and J.Wu. A locality-preservingcac he-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 29-39, 2002.
8. J. L. Bentley. Algorithms for Klee's rectangle problems. Carnegie-Mellon University, Pittsburgh, Penn., Department of Computer Science, unpublished notes, 1977.
9. G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. Technical Report RS-02-18, BRICS, Dept. of Computer Science, University of Aarhus, 2002.
10. G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 39-48, 2002.
11. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer Verlag, Berlin, 1997.
12. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In 40th Annual Symposium on Foundations of Computer Science, pages 285-297, 1999.
13. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. 34th Ann. Symp. on Foundations of Computer Science, pages 714-723, 1993.
14. R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Inf. Process. Lett., 1:132-133, 1972.
15. J. L. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, second edition, 1996.
16. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectores. Journal of the ACM, 22(4):469-476, Oct. 1975.
17. H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, June 1999.
18. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, June 2001.
19. D. E. Willard and Y. C. Wee. Quasi-valid range querying and its implications for nearest neighbor problems. In Proceedings of the Fourth Annual Symposium on Computational Geometry, pages 34-43. ACM Press, 1988.