Bibliography

  1. "$\Epsilon$-Approximations with Minimum Packing Constraint Violation." J.-H. Lin and J. S. Vitter. Proceedings of the 24th Annual ACM Symposium on Theory of Computation. May 1992.

  2. "$<$problem 81-8$>$." E. McCreight. Journal of Algorithms. vol. 2. 1981. pp. 314.

  3. "A Case for Redundant Arrays of Inexpensive Disks (RAID)." D. A. Patterson, G. Gibson, and R. H. Katz. Proc. ACM SIGMOD Conf. on Management of Data. 1988. pp. 109-116.

  4. "A Competitive Application-Controlled Paging Algorithm for a Shared Cache." R. Barve, E. F. Grove, and J. S. Vitter. Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science. October 1995. pp. 204--213.

  5. "Adding Range Restriction Capability to Dynamic Data Structures." D.E. Willard and G.S. Lueker. Journal of the ACM. 32 (3). 1985. pp. 597-617.

  6. "A fully-Dynamic Data Structure for External Substring Search." P. Ferragina and R. Grossi. Proc. ACM Symp. on Theory of Computation. 1995. pp. 693-702.

  7. "Algorithmic Foundations of GIS." M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer (Eds.). Springer-Verlag. LNCS 1340. 1997.

  8. "Algorithms for Bichromatic Line-Segment Problems and Polyhedral Terrains." B. Chazelle, H. Edelsbrunner, L. J. Guibas, and M. Sharir. Algorithmica. vol. 11. 1994. pp. 116-132.

  9. "Algorithms for Klee's Rectangle Problems." J. L. Bentley. Note: Dept. of Computer Science, Carnegie Mellon Univ., unpublished notes.

  10. "Algorithms for Parallel Memory, I: Two-level Memories." J. S. Vitter and E. A. M. Shriver. Algorithmica. 12 (2--3). 1994. pp. 110-147.

  11. "Algorithms for Parallel Memory, II: Hierarchical Multilevel Memories." J. S. Vitter and E. A. M. Shriver. Algorithmica. 12 (2--3). 1994. pp. 148-169.

  12. "Algorithms for Reporting and Counting Geometric Intersections." J. L. Bentley and T. A. Ottmann. IEEE Transactions on Computers. C-28 (9). 1979. pp. 643-647.

  13. "A Model for Hierarchical Memory." A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir. Proc. ACM Symp. on Theory of Computation. 1987. pp. 305-314.

  14. "Amortized Computational Complexity." R. E. Tarjan. SIAM J. Alg. Disc. Meth.. 6 (2). 1985. pp. 306-318.

  15. "An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set." R. L. Graham. Information Processing Letters. vol. 1. 1972. pp. 132-133.

  16. "A New Approach to Rectangle Intersections, Part I." H. Edelsbrunner. Int. J. Computer Mathematics. vol. 13. 1983. pp. 209-219.

  17. "A New Approach to Rectangle Intersections, Part I & II." H. Edelsbrunner. Int. J. Computer Mathematics. vol. 13. 1983. pp. 209-229.

  18. "A New Approach to Rectangle Intersections, Part II." H. Edelsbrunner. Int. J. Computer Mathematics. vol. 13. 1983. pp. 221-229.

  19. "A New Data Structure for Representing Sorted Lists." S. Huddleston and K. Mehlhorn. Acta Informatica. vol. 17. 1982. pp. 157-184.

  20. "A new efficient radix sort." A. Andersson and S. Nilsson. Proc. IEEE Symp. on Foundations of Comp. Sci.. 1994. pp. 714--721.

  21. "An external-memory indexing data structure with applications." P. Ferragina and R. Grossi. Note: Full version of STOC'95 paper ``A fully-Dynamic data structure for external substring search''.

  22. "An Intellegent Information Fusion System for Handling the Archiving and Querying of Terabyte-sized Spatial Databases." R. F. Cromp. S. R. Tate ed., Report on the Workshop on Data and Image Compression Needs and Uses in the Scientific Community, CESDIS Technical Report Series, TR--93--99. 1993. pp. 75-84.

  23. "An Introduction to Disk Drive Modeling." Chris Ruemmler and John Wilkes. IEEE Computer. 27 (3). 1994. pp. 17--28.

  24. "An Optimal Algorithm for Intersecting Line Segments in the Plane." B. Chazelle and H. Edelsbrunner. Journal of the ACM. vol. 39. 1992. pp. 1-54.

  25. "An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles." J. L. Bentley and D. Wood. IEEE Transactions on Computers. vol. 29. 1980. pp. 571-577.

  26. "Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS." H. Samet. Addison Wesley, MA. 1990.

  27. "A separator theorem for planar graphs." R. J. Lipton and R. E. Tarjan. SIAM Journal of Applied Math.. vol. 36. 1979. pp. 177-189.

  28. "A Simple Balanced Search Tree with $O$$(1)$ Worst-Case Update Time." R. Fleischer. Proc. Int. Symp. on Algorithms and Computation , LNCS 762. 1993.

  29. "A simple randomized parallel algorithm for list-ranking." R. J. Anderson and G. L. Miller. Information Processing Letters. vol. 33. 1990. pp. 269-273.

  30. "A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections." T. M. Chan. Proc. of 6th Canadian Conference on Computational Geometry. 1994.

  31. "A space-economical suffix tree construction algorithm." E. M. McCreight. Journal of the ACM. 23 (2). 1976. pp. 262--272.

  32. "Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems." Thomas H. Cormen and Leonard F. Wisniewski. Proc. ACM Symp. on Parallel Algorithms and Architectures. 1993. pp. 130--139.

  33. "Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems." Thomas H. Cormen, Thomas Sundquist, and Leonard F. Wisniewski. Proc. ACM Symp. on Parallel Algorithms and Architectures. 1993. pp. 130-139.

  34. "A Theory for Memory-Based Learning." J.-H. Lin and J. S. Vitter. Machine Learning. 1994.

  35. "A Transparent Parallel I/O Environment." D. E. Vengroff. Proc. DAGS Symposium on Parallel Computation. 1994.

  36. "Batched Dynamic Solutions to Decomposable Searching Problems." H. Edelsbrunner and M. Overmars. Journal of Algorithms. vol. 6. 1985. pp. 515-542.

  37. "BDD algorithms and cache misses." N. Klarlund and T. Rauhe. BRICS, University of Aarhus. RS-96-26. 1996.

  38. "Binary search tree of bounded balance." J. Nievergelt and E. M. Reingold. SIAM Journal of Computing. 2 (1). 1973. pp. 33-43.

  39. "Blocking for External Graph Searching." M. H. Nodine, M. T. Goodrich, and J. S. Vitter. Algorithmica. 16 (2). 1996. pp. 181-214.

  40. "Breadth-First Manipulation of SBDD of Boolean Functions for Vector Processing." H. Ochi, N. Ishiura, and S. Yajima. Proc. ACM/IEEE Design Automation Conference. 1991.

  41. "Breadth-First manipulation of Very Large Binary-Decision Diagrams." H. Ochi, K. Yasuoka, and S. Yajima. Proc. IEEE International Conference on CAD. 1993.

  42. "Building a Scalable Geo-Spatial DBMS: Technology, Implementation, and Evaluation." J. Patel, J. Yu, N. Kabra, K. Tufte, J. Burger, N. Hall, K. Ramasamy, R. Lueder, C. Ellmann, J. Kupsch, S. Guo, J. Larson, D. DeWitt, and J. Naughton. Proc. SIGMOD Intl. Conf. on Management of Data. 1997.

  43. "Cascading divide-and-conquer: A technique for designing parallel algorithms." M. J. Atallah, R. Cole, and M. T. Goodrich. SIAM Journal of Computing. 18 (3). 1989. pp. 499-532.

  44. "Coding Techniques for Handling Failures in Large Disk Arrays." L. Hellerstein, G. Gibson, R. M. Karp, R. H. Katz, and D. A. Patterson. Algorithmica. 12 (2--3). 1994.

  45. "Communication Issues in Large-Scale Geometric Computation." J. S. Vitter. ACM Computing Surveys. 28 (4es). December 1996.

  46. "Competitive Paging with Locality of Reference." A. Borodin, S. Irani, P. Raghaven, and B. Schieber. Proc. ACM Symp. on Theory of Computation. 1991. pp. 249-259.

  47. "Computational Geometry: An Introduction." F. P. Preparata and M. I. Shamos. Springer-Verlag. 1985.

  48. "Computational Geometry. An introduction through randomized algorithms." K. Mulmuley. Prentice-Hall. 1994.

  49. "Computational Geometry -- Algorithms and Applications." M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Springer Verlag, Berlin. 1997.

  50. "Computer Graphics: Principles and Practice." J.D. Foley, A. van Dam, S.K. Feiner, and J.F. Hughes. Addison-Wesley. 1990.

  51. "Constraint Query Languages." P. C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Proc. ACM Symp. Principles of Database Systems. 1990. pp. 299-313.

  52. "Contour Trees and Small Seed Sets for Isosurface Traversal." M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D. Schikore. Proc. ACM Annual Symposium on Computational Geometry. 1997. pp. 212-219.

  53. "Counting and reporting intersections of $d$-ranges." H. W. Six and D. Wood. IEEE Transactions on Computers. vol. 31. 1982. pp. 181-187.

  54. "Counting and Reporting Red/Blue Segment Intersections." L. Palazzi and J. Snoeyink. Proc. Workshop on Algorithms and Data Structures , LNCS 709. 1993. pp. 530-540.

  55. "Data Structures and Algorithms 1: Sorting and Searching." K. Mehlhorn. Springer-Verlag, EATCS Monographs on Theoretical Computer Science. 1984.

  56. "Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry." K. Mehlhorn. Springer-Verlag, EATCS Monographs on Theoretical Computer Science. 1984.

  57. "Decomposable searching problems." J. L. Bentley. Information Processing Letters. 8 (5). 1979. pp. 244-251.

  58. "Deterministic coin tossing with applications to optimal list-ranking." R. Cole and U. Vishkin. Information and Control. 70 (1). 1986. pp. 32-53.

  59. "Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors." M. H. Nodine and J. S. Vitter. Proc. ACM Symp. on Parallel Algorithms and Architectures. 1993. pp. 120-129.

  60. "Digital Elevation Models: overview and selected TIN algorithms." Algorithmic Foundations of GIS. M. Van Kreveld. Editted by M. van Kreveld and J. Nievergelt and T. Roos and P. Widmayer. Springer-Verlag, LNCS 1340. 1997.

  61. "Disk Arrays. High-Performance, High-Reliability Storage Subsystems." G. R. Ganger, B. L. Worthington, R. Y. Hou, and Y. N. Patt. IEEE Computer. 27 (3). 1994. pp. 30-46.

  62. "Dynamic Algorithms in Computational Geometry." Y.-J. Chiang and R. Tamassia. Proceedings of IEEE, Special Issue on Computational Geometry. 80 (9). 1992. pp. 362-381.

  63. "Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results." Yi-Jen Chiang. Brown University. 1995.

  64. "Dynamic Data Structures on Multiple Storage Media." M. Smid. University of Amsterdam. 1989.

  65. "Dynamic Generation of Discrete Random Variates." Y. Matias, J. S. Vitter, and W.-C. Ni. Proc. Fourth Annual ACM-SIAM Symp. on Discrete Algorithms. Austin, TX. 1993.

  66. "Dynamic Point Location in General Subdivisions." H. Baumgarten, H. Jung, and K. Mehlhorn. Journal of Algorithms. vol. 17. 1994. pp. 342-380.

  67. "Dynamic Variable Ordering for Ordered Binary Decision Diagrams." R. Rudell. Proc. IEEE International Conference on CAD. 1993.

  68. "Efficient 3-D Range Searching in External Memory." D. E. Vengroff and J. S. Vitter. Proc. ACM Symp. on Theory of Computation. 1996. pp. 192-201.

  69. "Efficient Breadth-First Manipulation of Binary Decision Diagrams.." P. Ashar and M. Cheong. Proc. IEEE International Conference on CAD. 1994.

  70. "Efficient Computation of Spatial Joins." O. Günther. Proc. IEEE International Conference on Data Engineering. 1993. pp. 50--60.

  71. "Efficient External-Memory Data Structures and Applications." L. Arge. University of Aarhus. 1996.

  72. "Efficient Implementation of a BDD Package." S. K. Brace, R. L. Rudell, and R. E. Bryant. Proc. ACM/IEEE Design Automation Conference. 1990.

  73. "Efficient Memory Access in Large-Scale Computation (invited paper)." J. S. Vitter. Symposium on Theoretical Aspects of Computer Science , LNCS 480. 1991. pp. 26-41.

  74. "Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers." C. E. Leiserson, S. Rao, and S. Toledo. Proc. IEEE Symp. on Foundations of Comp. Sci.. 1993. pp. 704-713.

  75. "Efficient Processing of Spatial Joins Using R-trees." T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Proc. SIGMOD Intl. Conf. on Management of Data. 1993.

  76. "Efficient Suffix Trees on Secondary Storage." D. R. Clark and J. I. Munro. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1996. pp. 383-391.

  77. "Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep." Y.-J. Chiang. Proc. Workshop on Algorithms and Data Structures , LNCS 955. 1995. pp. 346-357.

  78. "Explicit Bit Minimization for Motion-Compensated Video Coding." D. T. Hoang, P. M. Long, and J. S. Vitter. Proceedings of the 1994 IEEE Data Compression Conference. Snowbird, UT. March 1994. pp. 175--184.

  79. "Exploiting Extensible DBMS in Integrated Geographic Information Systems." Laura M. Haas and William F. Cody. Proc. of Advances in Spatial Databases, LNCS 525. 1991.

  80. "Extending the Hong-Kung model to memory hierachies." J. E. Savage. Proceedings of the 1st Annual International Conference on Computing and Combinatorics. 1995. pp. 270--281.

  81. "External-Memory Computational Geometry." M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. Proc. IEEE Symp. on Foundations of Comp. Sci.. 1993. pp. 714-723.

  82. "External-Memory Graph Algorithms." Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1995. pp. 139-149.

  83. "External memory techniques for isosurface extraction in scientific visualization." External memory algorithms and visualization. Y.-J. Chiang and C. T. Silva. Editted by J. Abello and J. S. Vitter. American Mathematical Society, DIMACS series in Discrete Mathematics and Theoretical Computer Science. 1999. pp. 247-277.

  84. "External Segment Trees." G. Blankenagel and R.H. Güting. Algorithmica. vol. 12. 1994. pp. 498-532.

  85. "Fast algorithms for shortest paths in planar graphs, with applications." G. N. Frederickson. SIAM Journal of Computing. vol. 16. 1987. pp. 1004-1022.

  86. "Fast Algorithms for Sorting and Searching Strings." J. L. Bentley and R. Sedgewick. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1996. pp. 360-369.

  87. "Fast Permuting in Disk Arrays." Thomas H. Cormen. Journal of Parallel and Distributed Computing. 17 (1-2). 1993. pp. 41-57.

  88. "Fast String Searching in Secondary Storage: Theoretical Developments and Experimental Results." P. Ferragina and R. Grossi. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1996. pp. 373-382.

  89. "Finding Repeated Elements." J. Misra and D. Gries. Science of Computer Programming. vol. 2. 1982. pp. 143-152.

  90. "Fractional Cascading: I. A Data Structuring Technique." B. Chazelle and L. J. Guibas. Algorithmica. vol. 1. 1986. pp. 133-162.

  91. "Fractional Cascading: II.Applications." B. Chazelle and L. J. Guibas. Algorithmica. vol. 1. 1986. pp. 163-191.

  92. "Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs." J. Gergov and C. Meinel. Symposium on Theoretical Aspects of Computer Science , LNCS 665. 1993.

  93. "Fundamentals of Spatial Information Systems." R. Laurini and A. D. Thompson. A.P.I.C. Series, Academic Press, New York, NY. 1992.

  94. "Further Comparisons of Algorithms for Geometric Intersection Problems." D. S. Andrews, J. Snoeyink, J. Boritz, T. Chan, G. Denham, J. Harrison, and C. Zhu. Proc. 6th Int'l. Symp. on Spatial Data Handling. 1994.

  95. "Further Computational Geometry in Secondary Memory." B. Zhu. Proc. Int. Symp. on Algorithms and Computation. 1994. pp. 514-522.

  96. "Geographic Information Systems." M. van Kreveld. Note: Utrecht University, INF/DOC--95--01.

  97. "Geometric range searching and its relatives." Discrete and Computational Geometry: Ten Years Later. P. K. Agarwal and J. Erickson. Editted by B. Chazelle and E. Goodman and R. Pollack. Mathematical Society Press. 1997.

  98. "Graph-Based Algorithms for Boolean Function Manipulation." R. Bryant. IEEE Transactions on Computers. C-35 (8). 1986.

  99. "Greed Sort: An Optimal Sorting Algorithm for Multiple Disks." M. H. Nodine and J. S. Vitter. Journal of the ACM. 1995. pp. 919-933.

  100. "Handbook of Algorithms and Data Structures." R. A. Baeza-Yates and G. H. Gonnet. Addison-Wesley. 1991.

  101. "Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity." J. van Leeuwen. Elsevier. 1990.

  102. "Hierarchical Memory with Block Transfer." A. Aggarwal, A. K. Chandra, and M. Snir. Proc. IEEE Symp. on Foundations of Comp. Sci.. 1987. pp. 204-216.

  103. "I/O and CPU-optimal recorgnition of strongly connected components." B. Jiang. Information Processing Letters. vol. 45. 1993. pp. 111-115.

  104. "I/O complexity: The red-blue pebble game." J. W. Hong and H. T. Kung. Proc. ACM Symp. on Theory of Computation. 1981. pp. 326-333.

  105. M. Knudsen. K. Larsen, "I/O-complexity of comparison and permutation problems." University of Aarhus, 1992. November 

  106. "I/O-Efficient Algorithms and Environments for Large-Scale Computing." D. E. Vengroff and J. S. Vitter. ACM Computing Surveys. 28 (4es). December 1996.

  107. "I/O-Efficient Algorithms for Contour Line Extraction and Planar Graph Blocking." P. K. Agarwal, L. Arge, T. M. Murali, K. Varadarajan, and J. S. Vitter. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1998. pp. 117-126.

  108. "I/O-Efficient Scientific Computation using TPIE." D. E. Vengroff and J. S. Vitter. Proceedings of the Goddard Conference on Mass Storage Systems and Technologies. 1996. pp. 553--570.

  109. "I/O Optimal Isosurface Extraction." Y.-J. Chiang and C. T. Silva. Proc. IEEE Visualization. 1997. pp. 293-300.

  110. "Improved Algorithms and Data Structures for Solving Graph Problems in External Memory." V. Kumar and E. Schwabe. Proc. IEEE Symp. on Parallel and Distributed Processing. 1996. pp. 169-177.

  111. "Indexing for Data Models with Constraints and Classes." P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, and J. S. Vitter. Journal of Computer and System Sciences. 52 (3). 1996. pp. 589-612.

  112. "Interactive Out-Of-Core Isosurface Extraction." Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Proc. IEEE Visualization. 1998. pp. 167--174.

  113. "Introduction to Algorithms." T. H. Cormen, C. E. Leiserson, and R. L. Rivest. The MIT Press, Cambridge, Mass.. 1990.

  114. "Large-Scale Sorting in Uniform Memory Hierarchies." J. S. Vitter and M. H. Nodine. Journal of Parallel and Distributed Computing. vol. 17. 1993. pp. 107-114.

  115. "Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment." S. Malik, A. R. Wang, R. K. Brayton, and A. Sangiovanni-Vincentelli. Proc. IEEE International Conference on CAD. 1988.

  116. "Lower bounds for algebraic computation trees." M. Ben-Or. Proc. ACM Symp. on Theory of Computation. 1983. pp. 80-86.

  117. "Maintaining Range Trees in Secundary Memory. Part I: Partitions." M. Overmars, M. Smid, M. de Berg, and M. van Kreveld. Acta Informatica. vol. 27. 1990. pp. 423-452.

  118. "Maintaining Range Trees in Secundary Memory. Part II: Lower Bounds." M. Smid and M. Overmars. Acta Informatica. vol. 27. 1990. pp. 453-480.

  119. "Making Data Structures Persistent." J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. Tarjan. Journal of Computer and System Sciences. vol. 38. 1989. pp. 86-124.

  120. "Memory paging for connectivity and path problems in graphs." E. Feuerstein and A. Marchetti-Spaccamela. Proc. Int. Symp. on Algorithms and Computation , LNCS 762. 1993. pp. 416-425.

  121. "Merging and sorting strings in parallel." T. Hagerup and O. Petersson. Proc. International Symp. on Mathematical Foundations of Computer Science. 1992. pp. 298--306.

  122. "Multidimensional Divide and Conquer." J. L. Bentley. Communications of the ACM. 23 (6). 1980. pp. 214-229.

  123. "Multiple-dictionary Compression Using Partial Matching." D. T. Hoang, P. M. Long, and J. S. Vitter. Proceedings of the 1995 IEEE Data Compression Conference. March 1995. pp. 272--281.

  124. "NASA Earth Observing Systems Data Information System (EOSDIS)." B. Kobler and J. Berbert. Digest of Papers: 11'th IEEE Symp. on Mass Storage Systems. 1991.

  125. "Nearly Optimal Vector Quantization Via Linear Programming." J.-H. Lin and J. S. Vitter. Proceedings of the IEEE Data Compression Conference. Snowbird, Utah. March 1992.

  126. "New coding techniques for improved bandwidth utilization." M. Adler. Proc. IEEE Symp. on Foundations of Comp. Sci.. 1996. pp. 173-182.

  127. "On RAM priority queues." M. Thorup. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1996. pp. 59-67.

  128. "On showing lower bounds for external-memory computational geometry." External memory algorithms and visualization. L. Arge and P. B. Miltersen. Editted by J. Abello and J. S. Vitter. American Mathematical Society, DIMACS series. 1999.

  129. "On Sorting Strings in External Memory." L. Arge, P. Ferragina, R. Grossi, and J. Vitter. Proc. ACM Symp. on Theory of Computation. 1997. pp. 540-548.

  130. "On the average number of rebalancing operations in weight-balanced trees." N. Blum and K. Mehlhorn. Theoretical Computer Science. vol. 11. 1980. pp. 303-320.

  131. "On the intersection of orthogonal objects." H. Edelsbrunner and H. A. Maurer. Information Processing Letters. vol. 13. 1981. pp. 177-181.

  132. "On the parallel dictionary matching problem: New results with applications." P. Ferragina and F. Luccio. Proc. Annual European Symposium on Algorithms , LNCS 1136. 1996. pp. 261-275.

  133. "OODB indexing by class division." S. Ramaswamy and P.C. Kanellakis. A.P.I.C. Series, Academic Press, New York. 1995.

  134. "Optimal Dynamic Interval Management in External Memory." L. Arge and J. S. Vitter. Proc. IEEE Symp. on Foundations of Comp. Sci.. 1996. pp. 560-569.

  135. "Optimal Parallel Sorting in Multi-Level Storage." A. Aggarwal and G. Plaxton. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1994. pp. 659-668.

  136. "Optimal Parallel String Algorithms: Merging, Sorting and Computing the Minimum." T. Hagerup. Proc. ACM Symp. on Theory of Computation. 1994. pp. 382-391.

  137. "Orders, $k$-sets and fast halfplane search on paged memory." P. G. Franciosa and M. Talamo. Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), LNCS 831. 1994. pp. 117-127.

  138. "Organization and Maintenance of Large Ordered Indexes." R. Bayer and E. McCreight. Acta Informatica. vol. 1. 1972. pp. 173-189.

  139. "Packing Trees." J. Gil and A. Itai. Proc. Annual European Symposium on Algorithms , LNCS 979. 1995. pp. 113-127.

  140. "Paging binary trees with external balancing." A. Henrich, H-W. Six, and P. Widmayer. Proc. Graph-Theoretic Concepts in Computer Science , LNCS 411. 1989. pp. 260-276.

  141. "Paradigms for Optimal Sorting with Multiple Disks." M. H. Nodine and J. S. Vitter. Proc. of the 26th Hawaii Int. Conf. on Systems Sciences. 1993.

  142. "Partition Based Spatial-Merge Join." J. M. Patel and D. J. DeWitt. Proc. SIGMOD Intl. Conf. on Management of Data. 1996. pp. 259-270.

  143. "Path Caching: A Technique for Optimal External Searching." S. Ramaswamy and S. Subramanian. Proc. ACM Symp. Principles of Database Systems. 1994. pp. 25-35.

  144. "PATRICIA: Practical algorithm to retrieve information coded in alphanumeric." D. R. Morrison. Journal of the ACM. vol. 15. 1968. pp. 514-534.

  145. "Permuting information in idealized two-level storage." R. W. Floyd. Complexity of Computer Calculations. 1972. pp. 105-109.

  146. "Planar point location using persistent search trees." N. Sarnak and R. E. Tarjan. Communications of the ACM. vol. 29. 1986. pp. 669-679.

  147. "Prefix B-trees." R. Bayer and K. Unterauer. ACM Trans. Database Syst.. 2 (1). 1977. pp. 11-26.

  148. "Preserving order in a forest in less than logarithmic time and linear space." P. Van Emde Boas. Information Processing Letters. vol. 6. 1977. pp. 80--82.

  149. "Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams." L. J. Guibas and J. Stolfi. ACM Trans. on Graphics. vol. 4. 1985. pp. 74-123.

  150. "Priority Search Trees." E.M. McCreight. SIAM Journal of Computing. 14 (2). 1985. pp. 257-276.

  151. "Priority Search Trees in Secondary Memory." Ch. Icking, R. Klein, and Th. Ottmann. Proc. Graph-Theoretic Concepts in Computer Science , LNCS 314. 1987. pp. 84-93.

  152. "Private communication." D. E. Vengroff. 1996.

  153. "Private communication." D. E. Vengroff. 1995.

  154. "Private Communication." V. Kumar. 1995.

  155. "Query evaluation techniques for large databases." G. Graefe. ACM Computing Surveys. 25 (2). 1993. pp. 73-170.

  156. "RAID: High-performance, Reliable Secondary Storage." Peter M. Chen, Edward K. Lee, Garth A. Gibson, Randy H. Katz, and David A. Patterson. ACM Computing Surveys. 26 (2). June 1994. pp. 145--185.

  157. "Randomized sorting in $O(n \log \log n)$ time and linear space using addition, shift, and bit-wise boolean operations." M. Thorup. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1997. pp. 352-359.

  158. "Rapid identification of repeated patterns in strings, arrays and trees." R. Karp, R. Miller, and A. Rosenberg. Proc. ACM Symp. on Theory of Computation. 1972. pp. 125-136.

  159. "Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization." V. K. Vaishnavi and D. Wood. Journal of Algorithms. vol. 3. 1982. pp. 160-176.

  160. "Reduction of OBDDs in linear time." D. Sieling and I. Wegener. Information Processing Letters. vol. 48. 1993.

  161. "Reporting and Counting Intersections Between Two Sets of Line Segments." H. G. Mairson and J. Stolfi. R. Earnshaw (ed.), Theoretical Foundation of Computer Graphics and CAD, NATO ASI Series, Vol. F40. 1988. pp. 307-326.

  162. "Simple Randomized Mergesort on Parallel Disks." R. D. Barve, E. F. Grove, and J. S. Vitter. Parallel Computing. 23 (4). 1997.

  163. "Simple traversal of a subdivision without extra storage." M. de Berg, M. van Kreveld, R. van Oostrum, and M. Overmars. Proc. 3rd ACM Workshop on Advances in GIS. 1995. pp. 77--84.

  164. "Simulating I/O-algorithms." M. Knudsen and K. Larsen. Master student project, University of Aarhus. August 1993.

  165. "Size Separation Spatial Join." N. Koudas and K. C. Sevcik. Proc. SIGMOD Intl. Conf. on Management of Data. 1997. pp. 324-335.

  166. "Sorting and Searching." D. E. Knuth. Addison-Wesley, Reading MA. The Art of Computer Programming. vol. 3. ed. second. 1998.

  167. "Sorting and Searching in Multisets." J. I. Munro and P. M. Spira. SIAM Journal of Computing. 5 (1). 1976. pp. 1-8.

  168. "Sorting in linear time?." A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Proc. ACM Symp. on Theory of Computation. 1995. pp. 427--436.

  169. "Sorting Multisets and Vectors In-Place." J. I. Munro and V. Raman. Proc. Workshop on Algorithms and Data Structures , LNCS 519. 1991. pp. 473-479.

  170. "Sorting strings and constructing digital search trees in parallel." J. F. JáJá, K. W. Ryu, and U. Vishkin. Theoretical Computer Science. 154 (2). 1996. pp. 225-245.

  171. "Space-Time Tradeoffs in Memory Hierarchies." J. E. Savage. Brown University. CS-93-08. 1993.

  172. "Spatial data structures: Concepts and design choices." Algorithmic Foundations of GIS. J. Nievergelt and P. Widmayer. Editted by M. van Kreveld and J. Nievergelt and T. Roos and P. Widmayer. Springer-Verlag, LNCS 1340. 1997. pp. 153-197.

  173. "Spatial Hash-Joins." M.-L. Lo and C. V. Ravishankar. Proc. SIGMOD Intl. Conf. on Management of Data. 1996. pp. 247--258.

  174. "Spatial Joins Using Seeded Trees." M.-L. Lo and C. V. Ravishankar. Proc. SIGMOD Intl. Conf. on Management of Data. 1994. pp. 209--220.

  175. "Spatial Query Processing in an Object-Oriented Database System." J.A. Orenstein. Proc. ACM SIGMOD Conf. on Management of Data. 1986. pp. 326-336.

  176. "Special issue: Digital Libraries: Introduction." E. A. Fox, R. M. Akscyn, R. K. Furuta, and J. J. Leggett. Communications of the ACM. 38 (4). April 1995.

  177. "Strategic directions in computational geometry." R. Tamassia, editor. ACM Computing Surveys. 28 (4). 1996.

  178. "Strategic Directions in Storage I/O for Large-Scale Computing." G. A. Gibson, J. S. Vitter, and J. Wilkes, Eds.. ACM Computing Surveys. 28 (4). 1996.

  179. "Suffix arrays: A new method for on-line string searches." U. Manber and G. Myers. SIAM Journal of Computing. 25 (5). 1993. pp. 935-948.

  180. "Sun Performance and Tuning. SPARC & Solaris." A. Cockcroft. Sun Microsystems Inc.. 1995.

  181. "Supporting I/O-efficient Scientific Computation in TPIE." D. E. Vengroff and J. S. Vitter. Proc. IEEE Symp. on Parallel and Distributed Computing. 1995. pp. 74-77.

  182. "Surpassing the information theoretic bound with fusion trees." M.L. Fredman and D.E. Willard. Journal of Computer and System Sciences. vol. 47. 1993. pp. 424--436.

  183. "Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams." R. Bryant. ACM Computing Surveys. 24 (3). 1992.

  184. "Temporal Databases: Theory, Design and Implementation." A. U. Tanzel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass. The Benjamin/Cummings Publishing Company Inc.. 1993.

  185. "Text Compression via Alphabet Re-Representation." P. M. Long, A. I. Natsev, and J. S. Vitter. Proceedings of the 1996 IEEE Data Compression Conference. March 1996. pp. 161--170.

  186. "The Design and Analyses of Spatial Data Structures." H. Samet. Addison Wesley, MA. 1990.

  187. "The Design and Analysis of Computer Algorithms." A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Addison-Wesley, Reading, MA. 1974.

  188. "The Design of Dynamic Data Structures." Mark H. Overmars. Springer-Verlag, LNCS 156. 1983.

  189. "The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases." O. Günther. Proc. IEEE International Conference on Data Engineering. 1989. pp. 598-605.

  190. "The Grid File: An Adaptable, Symmetric Multikey File Structure." J. Nievergelt, H. Hinterberger, and K.C. Sevcik. ACM Transactions on Database Systems. 9 (1). 1984. pp. 38-71.

  191. "The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance." D.B. Lomet and B. Salzberg. ACM Transactions on Database Systems. 15 (4). 1990. pp. 625-658.

  192. "The human genome project and informatics." K. A. Frenkel. Communications of the ACM. vol. 34. 1991. pp. 41-51.

  193. "The human genome projekt: Past, present, and future." J. D. Watson. Science. vol. 248. 1990. pp. 44-49.

  194. "The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation." L. Arge. Proc. Int. Symp. on Algorithms and Computation , LNCS 1004. 1995. pp. 82-91.

  195. "The I/O Subsystem---A Candidate for Improvement." Yale N. Patt. Guest Editor's Introduction in IEEE Computer. 27 (3). 1994. pp. 15-16.

  196. "The Input/Output Complexity of Sorting and Related Problems." A. Aggarwal and J. S. Vitter. Communications of the ACM. 31 (9). 1988. pp. 1116--1127.

  197. "The input/output complexity of transitive closure." J. D. Ullman and M. Yannakakis. Annals of Mathematics and Artificial Intellegence. vol. 3. 1991. pp. 331-360.

  198. "The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes." J.T. Robinson. Proc. SIGMOD Intl. Conf. on Management of Data. 1981. pp. 10-18.

  199. "The organization of a Multilist-type associative memory." N. S. Prywes and H. J. Gray. IEEE Trans. on Communication and Electronics. vol. 68. 1963. pp. 488-492.

  200. "Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems." L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1998. pp. 685-694.

  201. "The Parallel Hierarchical Memory Model." B. H. H. Juurlink and H. A. G. Wijshoff. Proc. Scandinavian Workshop on Algorithms Theory , LNCS 824. 1993. pp. 240-251.

  202. "The P-range Tree: A New Data Structure for Range Searching in Secondary Memory." S. Subramanian and S. Ramaswamy. Proc. ACM-SIAM Symp. on Discrete Algorithms. 1995. pp. 378-387.

  203. "The R$^+$-tree: A Dynamic Index for Multi-Dimensional Objects." T. Sellis, N. Roussopoulos, and C. Faloutsos. Proc. International Conf. on Very Large Databases. 1987. pp. 507-518.

  204. "The Selection of Class Intervals." I. S. Evans. Trans. Inst. Br. Geogrs.. vol. 2. 1977. pp. 98--124.

  205. "The Triangulated Irregular Network." T.K. Peucker, R.J. Fowler, J.J. Little, and D.M. Mark. Proc. DTM Symp.\ Am.\ Soc. of Photogrammetry---Am. Congress on Survey and Mapping. 1978. pp. 24--31.

  206. "The TWA Reservation System." D. Gifford and A. Spector. Communications of the ACM. vol. 27. 1984. pp. 650-665.

  207. "The Ubiquitous B-tree." D. Comer. ACM Computing Surveys. 11 (2). 1979. pp. 121-137.

  208. "The Ultimate Planar Convex Hull Algorithm?." D. G. Kirkpatrick and R. Seidel. SIAM Journal of Computing. vol. 15. 1986. pp. 287-299.

  209. "The Uniform Memory Hierarchy Model of Computation." B. Alpern, L. Carter, E. Feig, and T. Selker. Algorithmica. 12 (2-3). 1994.

  210. "Time bounds for selection." M. Blum, R. W. Floyd, V. Pratt, R. L. Rievest, and R. E. Tarjan. Journal of Computer and System Sciences. vol. 7. 1973. pp. 448-461.

  211. "Topology B-trees and Their Applications." P. Callahan, M. T. Goodrich, and K. Ramaiyer. Proc. Workshop on Algorithms and Data Structures , LNCS 955. 1995. pp. 381-392.

  212. "TPIE User Manual and Reference (edition 0.9.01a)." L. Arge, R. Barve, O. Procopiuc, L. Toma, D. E. Vengroff, and R. Wickremesinghe. Duke University. 1999. Note: The manual and software distribution are available on the web at \texttthttp://www.cs.duke.edu/TPIE/.

  213. "Traversing graphs in a paging environment BFS or DFS?." B. Jiang. Information Processing Letters. vol. 37. 1991. pp. 143-147.

  214. "Triangulating a Simple Polygon in Linear Time." B. Chazelle. Proc. IEEE Symp. on Foundations of Comp. Sci.. 1990.

  215. "Triangulating Simple Polygons and Equivalent Problems." A. Fournier and D. Y. Montuno. ACM Trans. on Graphics. 3 (2). 1984. pp. 153-174.

  216. "Understanding GIS---the ARC/INFO method." ARC/INFO. ARC/INFO. 1993.

  217. "Uniform Memory Hierarchies." B. Alpern, L. Carter, and E. Feig. Proc. IEEE Symp. on Foundations of Comp. Sci.. 1990. pp. 600-608.

  218. "Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments." K. Romanik and J. S. Vitter. Information and Computation. 128 (2). August 1 1996. pp. 87--108.

  219. "Variations on sweep algorithms: Efficient computation of extended viewsheds and classifications." M. van Kreveld. Proc. 7th Int.\ Symp.\ on Spatial Data Handling. 1996. pp. 13A.15--13A.27.

  220. "Virtual Memory Algorithms." A. Aggarwal and A. K. Chandra. Proc. ACM Symp. on Theory of Computation. 1988. pp. 173-185.

  221. "Virtual Memory for Data Parallel Computing." Thomas H. Cormen. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology. 1992.

  222. "Why Sort-Merge Gives the Best Implementation of the Natural Join." T. H. Merrett. ACM SIGMOD Record. 13 (2). 1983.

  223. "Worst-case optimal insertion and deletion methods for decomposable searching problems." M. H. Overmars and J. Van Leeuwen. Information Processing Letters. vol. 12. 1981. pp. 168-173.

  224. "XP-Trees---External Priority Search Trees." G. Blankenagel and R. H. Güting. FernUniversität Hagen, Informatik-Bericht Nr. 92. 1990.

Generated using modified bibtex2xml.py and bibList.xsl.