A. Aggarwal
G. Plaxton
Optimal Parallel Sorting in Multi-Level Storage
1994
Proc. ACM-SIAM Symp. on Discrete Algorithms
659-668
Arlington, VA
A. V. Aho
J. E. Hopcroft
J. D. Ullman
The Design and Analysis of Computer Algorithms
Addison-Wesley, Reading, MA
1974
A. Aggarwal
J. S. Vitter
The Input/Output Complexity of Sorting and Related Problems
1988
Communications of the ACM
31
9
1116--1127
cacm
D. S. Andrews
J. Snoeyink
J. Boritz
T. Chan
G. Denham
J. Harrison
C. Zhu
Further Comparisons of Algorithms for Geometric Intersection Problems
1994
Proc. 6th Int'l. Symp. on Spatial Data Handling
ARC/INFO
ARC/INFO
Understanding GIS---the ARC/INFO method
Rev. 6 for workstations
1993
R. Bayer
E. McCreight
Organization and Maintenance of Large Ordered Indexes
1972
Acta Informatica
1
173-189
J. L. Bentley
T. A. Ottmann
Algorithms for Reporting and Counting Geometric Intersections
1979
IEEE Transactions on Computers
C-28
9
643-647
J. L. Bentley
Multidimensional Divide and Conquer
1980
Communications of the ACM
23
6
214-229
J. L. Bentley
Algorithms for Klee's Rectangle Problems
Dept. of Computer Science, Carnegie Mellon Univ., unpublished notes
1977
G. Blankenagel
R. H. Güting
XP-Trees---External Priority Search Trees
FernUniversität Hagen, Informatik-Bericht Nr. 92
1990
G. Blankenagel
R.H. Güting
External Segment Trees
Algorithmica
12
1994
498-532
N. Blum
K. Mehlhorn
On the average number of rebalancing operations in weight-balanced trees
Theoretical Computer Science
11
1980
303-320
T. M. Chan
A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections
1994
Proc. of 6th Canadian Conference on Computational Geometry
Y.-J. Chiang
Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep
1995
Proc. Workshop on Algorithms and Data Structures , LNCS 955
346-357
Y.-J. Chiang
R. Tamassia
Dynamic Algorithms in Computational Geometry
Proceedings of IEEE, Special Issue on Computational Geometry
80
9
1992
362-381
Y.-J. Chiang
M. T. Goodrich
E. F. Grove
R. Tamassia
D. E. Vengroff
J. S. Vitter
External-Memory Graph Algorithms
1995
Proc. ACM-SIAM Symp. on Discrete Algorithms
139-149
B. Chazelle
Triangulating a Simple Polygon in Linear Time
1990
Proc. IEEE Symp. on Foundations of Comp. Sci.
B. Chazelle
H. Edelsbrunner
An Optimal Algorithm for Intersecting Line Segments in the Plane
1992
Journal of the ACM
39
1-54
B. Chazelle
H. Edelsbrunner
L. J. Guibas
M. Sharir
Algorithms for Bichromatic Line-Segment Problems and Polyhedral Terrains
1994
Algorithmica
11
116-132
B. Chazelle
L. J. Guibas
Fractional Cascading: I. A Data Structuring Technique
1986
Algorithmica
1
133-162
B. Chazelle
L. J. Guibas
Fractional Cascading: II.Applications
1986
Algorithmica
1
163-191
Thomas H. Cormen
Leonard F. Wisniewski
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
1993
Proc. ACM Symp. on Parallel Algorithms and Architectures
130--139
Thomas H. Cormen
Fast Permuting in Disk Arrays
Journal of Parallel and Distributed Computing
1993
17
1-2
41-57
Thomas H. Cormen
Virtual Memory for Data Parallel Computing
1992
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology
Thomas H. Cormen
Thomas Sundquist
Leonard F. Wisniewski
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
Proc. ACM Symp. on Parallel Algorithms and Architectures
1993
130-139
Expanded and improved version of cormen:asymptotically
D. Comer
The Ubiquitous B-tree
1979
ACM Computing Surveys
2
11
121-137
R. F. Cromp
An Intellegent Information Fusion System for Handling the Archiving and Querying of Terabyte-sized Spatial Databases
1993
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
75-84
H. Edelsbrunner
A New Approach to Rectangle Intersections, Part I & II
Int. J. Computer Mathematics
13
1983
209-229
H. Edelsbrunner
A New Approach to Rectangle Intersections, Part I
Int. J. Computer Mathematics
13
1983
209-219
H. Edelsbrunner
A New Approach to Rectangle Intersections, Part II
Int. J. Computer Mathematics
13
1983
221-229
H. Edelsbrunner
M. Overmars
Batched Dynamic Solutions to Decomposable Searching Problems
1985
Journal of Algorithms
6
515-542
R. Fleischer
A Simple Balanced Search Tree with $O$$(1)$ Worst-Case Update Time
Proc. Int. Symp. on Algorithms and Computation , LNCS 762
1993
J.D. Foley
A. van Dam
S.K. Feiner
J.F. Hughes
Computer Graphics: Principles and Practice
Addison-Wesley
1990
A. Fournier
D. Y. Montuno
Triangulating Simple Polygons and Equivalent Problems
1984
ACM Trans. on Graphics
3
2
153-174
M. H. Nodine
M. T. Goodrich
J. S. Vitter
Blocking for External Graph Searching
Algorithmica
1996
16
2
181-214
M. T. Goodrich
J.-J. Tsay
D. E. Vengroff
J. S. Vitter
External-Memory Computational Geometry
1993
Proc. IEEE Symp. on Foundations of Comp. Sci.
714-723
O. Günther
The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases
Proc. IEEE International Conference on Data Engineering
1989
598-605
Ch. Icking
R. Klein
Th. Ottmann
Priority Search Trees in Secondary Memory
Proc. Graph-Theoretic Concepts in Computer Science , LNCS 314
1987
84-93
P. C. Kanellakis
G.M. Kuper
P.Z. Revesz
Constraint Query Languages
Proc. ACM Symp. Principles of Database Systems
1990
299-313
P. C. Kanellakis
S. Ramaswamy
D. E. Vengroff
J. S. Vitter
Indexing for Data Models with Constraints and Classes
Journal of Computer and System Sciences
1996
52
3
589-612
D. E. Knuth
The Art of Computer Programming
Sorting and Searching
1998
3
second
Addison-Wesley, Reading MA
D.B. Lomet
B. Salzberg
The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance
ACM Transactions on Database Systems
15
4
625-658
1990
R. Laurini
A. D. Thompson
Fundamentals of Spatial Information Systems
1992
A.P.I.C. Series, Academic Press, New York, NY
H. G. Mairson
J. Stolfi
Reporting and Counting Intersections Between Two Sets of Line Segments
1988
R. Earnshaw (ed.), Theoretical Foundation of Computer Graphics and CAD, NATO ASI Series, Vol. F40
307-326
E.M. McCreight
Priority Search Trees
1985
SIAM Journal of Computing
14
2
257-276
K. Mehlhorn
Data Structures and Algorithms 1: Sorting and Searching
1984
Springer-Verlag, EATCS Monographs on Theoretical Computer Science
K. Mehlhorn
Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry
1984
Springer-Verlag, EATCS Monographs on Theoretical Computer Science
J. Nievergelt
H. Hinterberger
K.C. Sevcik
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems
9
1
1984
38-71
J. Nievergelt
E. M. Reingold
Binary search tree of bounded balance
SIAM Journal of Computing
2
1
33-43
1973
M. H. Nodine
J. S. Vitter
Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors
1993
Proc. ACM Symp. on Parallel Algorithms and Architectures
120-129
this is the balance sort paper - parallel distribution sort
M. H. Nodine
J. S. Vitter
Paradigms for Optimal Sorting with Multiple Disks
1993
Proc. of the 26th Hawaii Int. Conf. on Systems Sciences
J.A. Orenstein
Spatial Query Processing in an Object-Oriented Database System
Proc. ACM SIGMOD Conf. on Management of Data
1986
326-336
Mark H. Overmars
The Design of Dynamic Data Structures
Springer-Verlag, LNCS 156
1983
L. Palazzi
J. Snoeyink
Counting and Reporting Red/Blue Segment Intersections
1993
Proc. Workshop on Algorithms and Data Structures , LNCS 709
530-540
Yale N. Patt
The I/O Subsystem---A Candidate for Improvement
1994
Guest Editor's Introduction in IEEE Computer
27
3
15-16
F. P. Preparata
M. I. Shamos
Computational Geometry: An Introduction
Springer-Verlag
1985
S. Ramaswamy
P.C. Kanellakis
OODB indexing by class division
A.P.I.C. Series, Academic Press, New York
1995
S. Ramaswamy
S. Subramanian
Path Caching: A Technique for Optimal External Searching
Proc. ACM Symp. Principles of Database Systems
1994
25-35
Chris Ruemmler
John Wilkes
An Introduction to Disk Drive Modeling
IEEE Computer
1994
27
3
17--28
J.T. Robinson
The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes
Proc. SIGMOD Intl. Conf. on Management of Data
1981
10-18
H. Samet
Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS
Addison Wesley, MA
1990
H. Samet
The Design and Analyses of Spatial Data Structures
Addison Wesley, MA
1990
T. Sellis
N. Roussopoulos
C. Faloutsos
The R$^+$-tree: A Dynamic Index for Multi-Dimensional Objects
Proc. International Conf. on Very Large Databases
1987
507-518
S. Subramanian
S. Ramaswamy
The P-range Tree: A New Data Structure for Range Searching in Secondary Memory
Proc. ACM-SIAM Symp. on Discrete Algorithms
378-387
1995
D. E. Vengroff
A Transparent Parallel I/O Environment
1994
Proc. DAGS Symposium on Parallel Computation
tpie
D. E. Vengroff
J. S. Vitter
Efficient 3-D Range Searching in External Memory
Proc. ACM Symp. on Theory of Computation
1996
192-201
D. E. Vengroff
J. S. Vitter
Supporting I/O-efficient Scientific Computation in TPIE
Proc. IEEE Symp. on Parallel and Distributed Computing
1995
74-77
Appears also as Duke University Dept. of Computer Science technical report CS-1995-18
J. S. Vitter
E. A. M. Shriver
Algorithms for Parallel Memory, I: Two-level Memories
1994
Algorithmica
12
2--3
parallel I/O algorithms, parallel memory, pario bib
110-147
Summarized in vitter:optimal.
J. S. Vitter
E. A. M. Shriver
Algorithms for Parallel Memory, II: Hierarchical Multilevel Memories
1994
Algorithmica
12
2--3
148-169
B. Zhu
Further Computational Geometry in Secondary Memory
1994
514-522
Proc. Int. Symp. on Algorithms and Computation
M. van Kreveld
Geographic Information Systems
Utrecht University, INF/DOC--95--01
1995
Laura M. Haas
William F. Cody
Exploiting Extensible DBMS in Integrated Geographic Information Systems
Proc. of Advances in Spatial Databases, LNCS 525
1991
L. Hellerstein
G. Gibson
R. M. Karp
R. H. Katz
D. A. Patterson
Coding Techniques for Handling Failures in Large Disk Arrays
1994
Algorithmica
12
2--3
D. A. Patterson
G. Gibson
R. H. Katz
A Case for Redundant Arrays of Inexpensive Disks (RAID)
1988
Proc. ACM SIGMOD Conf. on Management of Data
109-116
Chicago, IL
RAID
M. H. Nodine
J. S. Vitter
Greed Sort: An Optimal Sorting Algorithm for Multiple Disks
1995
Journal of the ACM
42
919-933
it used to be called nodine:large - SPAA 1991
V. K. Vaishnavi
D. Wood
Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization
1982
Journal of Algorithms
3
160-176
D.E. Willard
G.S. Lueker
Adding Range Restriction Capability to Dynamic Data Structures
1985
Journal of the ACM
32
3
597-617
P. Ashar
M. Cheong
Efficient Breadth-First Manipulation of Binary Decision Diagrams.
Proc. IEEE International Conference on CAD
1994
S. K. Brace
R. L. Rudell
R. E. Bryant
Efficient Implementation of a BDD Package
Proc. ACM/IEEE Design Automation Conference
1990
D. Gifford
A. Spector
The TWA Reservation System
Communications of the ACM
27
1984
650-665
N. Klarlund
T. Rauhe
BDD algorithms and cache misses
BRICS, University of Aarhus
1996
RS-96-26
J. S. Vitter
Efficient Memory Access in Large-Scale Computation (invited paper)
Symposium on Theoretical Aspects of Computer Science , LNCS 480
1991
26-41
R. W. Floyd
Permuting information in idealized two-level storage
Complexity of Computer Calculations
R. Miller and J. Thatcher, Eds. Plenum, New York
1972
105-109
J. W. Hong
H. T. Kung
I/O complexity: The red-blue pebble game
Proc. ACM Symp. on Theory of Computation
1981
326-333
L. Arge
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
Proc. Int. Symp. on Algorithms and Computation , LNCS 1004
1995
82-91
A complete version appear as BRICS technical report RS-96-29, University of Aarhus
S. Huddleston
K. Mehlhorn
A New Data Structure for Representing Sorted Lists
Acta Informatica
17
1982
157-184
M. Blum
R. W. Floyd
V. Pratt
R. L. Rievest
R. E. Tarjan
Time bounds for selection
Journal of Computer and System Sciences
7
1973
448-461
J. L. Bentley
D. Wood
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
29
1980
571-577
J. D. Ullman
M. Yannakakis
The input/output complexity of transitive closure
Annals of Mathematics and Artificial Intellegence
1991
3
331-360
E. Feuerstein
A. Marchetti-Spaccamela
Memory paging for connectivity and path problems in graphs
Proc. Int. Symp. on Algorithms and Computation , LNCS 762
416-425
1993
R. Bryant
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
1986
C-35
8
R. Bryant
Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams
ACM Computing Surveys
1992
24
3
R. J. Anderson
G. L. Miller
A simple randomized parallel algorithm for list-ranking
Information Processing Letters
1990
33
269-273
D. E. Vengroff
Private communication
1996
D. E. Vengroff
Private communication
1995
R. Cole
U. Vishkin
Deterministic coin tossing with applications to optimal list-ranking
Information and Control
1986
70
1
32-53
Yi-Jen Chiang
Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results
Brown University
1995
August
V. Kumar
Private Communication
1995
J. Gergov
C. Meinel
Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs
Symposium on Theoretical Aspects of Computer Science , LNCS 665
1993
H. Ochi
N. Ishiura
S. Yajima
Breadth-First Manipulation of SBDD of Boolean Functions for Vector Processing
Proc. ACM/IEEE Design Automation Conference
1991
H. Ochi
K. Yasuoka
S. Yajima
Breadth-First manipulation of Very Large Binary-Decision Diagrams
Proc. IEEE International Conference on CAD
1993
R. Rudell
Dynamic Variable Ordering for Ordered Binary Decision Diagrams
Proc. IEEE International Conference on CAD
1993
D. Sieling
I. Wegener
Reduction of OBDDs in linear time
Information Processing Letters
1993
48
S. Malik
A. R. Wang
R. K. Brayton
A. Sangiovanni-Vincentelli
Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment
Proc. IEEE International Conference on CAD
1988
J. van Leeuwen
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
Elsevier
1990
G. R. Ganger
B. L. Worthington
R. Y. Hou
Y. N. Patt
Disk Arrays. High-Performance, High-Reliability Storage Subsystems
IEEE Computer
1994
27
3
30-46
A. Aggarwal
A. K. Chandra
Virtual Memory Algorithms
Proc. ACM Symp. on Theory of Computation
1988
173-185
B. Alpern
L. Carter
E. Feig
Uniform Memory Hierarchies
Proc. IEEE Symp. on Foundations of Comp. Sci.
1990
600-608
B. Alpern
L. Carter
E. Feig
T. Selker
The Uniform Memory Hierarchy Model of Computation
1994
Algorithmica
12
2-3
A. Aggarwal
B. Alpern
A. K. Chandra
M. Snir
A Model for Hierarchical Memory
Proc. ACM Symp. on Theory of Computation
1987
305-314
A. Aggarwal
A. K. Chandra
M. Snir
Hierarchical Memory with Block Transfer
Proc. IEEE Symp. on Foundations of Comp. Sci.
1987
204-216
A. Cockcroft
Sun Performance and Tuning. SPARC & Solaris
Sun Microsystems Inc.
1995
P. Callahan
M. T. Goodrich
K. Ramaiyer
Topology B-trees and Their Applications
Proc. Workshop on Algorithms and Data Structures , LNCS 955
1995
381-392
M. Smid
Dynamic Data Structures on Multiple Storage Media
University of Amsterdam
1989
M. Knudsen
K. Larsen
Simulating I/O-algorithms
Master student project, University of Aarhus
1993
August
M. Ben-Or
Lower bounds for algebraic computation trees
Proc. ACM Symp. on Theory of Computation
1983
80-86
M. Knudsen
K. Larsen
I/O-complexity of comparison and permutation problems
University of Aarhus
1992
November
J. Misra
D. Gries
Finding Repeated Elements
Science of Computer Programming
1982
2
143-152
J. I. Munro
V. Raman
Sorting Multisets and Vectors In-Place
Proc. Workshop on Algorithms and Data Structures , LNCS 519
1991
473-479
J. I. Munro
P. M. Spira
Sorting and Searching in Multisets
SIAM Journal of Computing
1976
5
1
1-8
J. D. Watson
The human genome projekt: Past, present, and future
Science
1990
248
44-49
K. Mulmuley
Computational Geometry. An introduction through randomized algorithms
Prentice-Hall
1994
J. S. Vitter
M. H. Nodine
Large-Scale Sorting in Uniform Memory Hierarchies
Journal of Parallel and Distributed Computing
1993
17
107-114
B. H. H. Juurlink
H. A. G. Wijshoff
The Parallel Hierarchical Memory Model
Proc. Scandinavian Workshop on Algorithms Theory , LNCS 824
240-251
1993
J. E. Savage
Space-Time Tradeoffs in Memory Hierarchies
Brown University
1993
CS-93-08
J. E. Savage
Extending the Hong-Kung model to memory hierachies
Proceedings of the 1st Annual International Conference on Computing and Combinatorics
270--281
1995
959
LNCS
P. G. Franciosa
M. Talamo
Orders, $k$-sets and fast halfplane search on paged memory
Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), LNCS 831
1994
117-127
M. Overmars
M. Smid
M. de Berg
M. van Kreveld
Maintaining Range Trees in Secundary Memory. Part I: Partitions
Acta Informatica
1990
27
423-452
M. Smid
M. Overmars
Maintaining Range Trees in Secundary Memory. Part II: Lower Bounds
Acta Informatica
1990
27
453-480
L. Arge
P. B. Miltersen
On showing lower bounds for external-memory computational geometry
External memory algorithms and visualization
American Mathematical Society, DIMACS series
1999
J. Abello and J. S. Vitter
A. Henrich
H-W. Six
P. Widmayer
Paging binary trees with external balancing
Proc. Graph-Theoretic Concepts in Computer Science , LNCS 411
1989
260-276
C. E. Leiserson
S. Rao
S. Toledo
Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers
Proc. IEEE Symp. on Foundations of Comp. Sci.
1993
704-713
B. Jiang
Traversing graphs in a paging environment BFS or DFS?
Information Processing Letters
1991
37
143-147
B. Jiang
I/O and CPU-optimal recorgnition of strongly connected components
Information Processing Letters
1993
45
111-115
J. Gil
A. Itai
Packing Trees
Proc. Annual European Symposium on Algorithms , LNCS 979
1995
113-127
R. Barve
E. F. Grove
J. S. Vitter
A Competitive Application-Controlled Paging Algorithm for a Shared Cache
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science
October
1995
204--213
Y. Matias
J. S. Vitter
W.-C. Ni
Dynamic Generation of Discrete Random Variates
1993
Proc. Fourth Annual ACM-SIAM Symp. on Discrete Algorithms
Austin, TX
D. T. Hoang
P. M. Long
J. S. Vitter
Multiple-dictionary Compression Using Partial Matching
March
1995
Proceedings of the 1995 IEEE Data Compression Conference
272--281
P. M. Long
A. I. Natsev
J. S. Vitter
Proceedings of the 1996 IEEE Data Compression Conference
Text Compression via Alphabet Re-Representation
1996
March
161--170
J.-H. Lin
J. S. Vitter
$\Epsilon$-Approximations with Minimum Packing Constraint Violation
1992
May
Proceedings of the 24th Annual ACM Symposium on Theory of Computation
stoc
J.-H. Lin
J. S. Vitter
A Theory for Memory-Based Learning
1994
Machine Learning
COLT
J.-H. Lin
J. S. Vitter
Nearly Optimal Vector Quantization Via Linear Programming
1992
March
Proceedings of the IEEE Data Compression Conference
Snowbird, Utah
DCC
D. T. Hoang
P. M. Long
J. S. Vitter
Explicit Bit Minimization for Motion-Compensated Video Coding
Proceedings of the 1994 IEEE Data Compression Conference
IEEE Computer Society Press
Snowbird, UT
March
1994
175--184
R. D. Barve
E. F. Grove
J. S. Vitter
Simple Randomized Mergesort on Parallel Disks
Parallel Computing
1997
23
4
Special issue on parallel I/O. An earlier version appears in Proc. of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '96), Padua, Italy, June 1996, 109--118
D. R. Clark
J. I. Munro
Efficient Suffix Trees on Secondary Storage
Proc. ACM-SIAM Symp. on Discrete Algorithms
1996
383-391
P. Ferragina
R. Grossi
A fully-Dynamic Data Structure for External Substring Search
Proc. ACM Symp. on Theory of Computation
1995
693-702
P. Ferragina
R. Grossi
Fast String Searching in Secondary Storage: Theoretical Developments and Experimental Results
Proc. ACM-SIAM Symp. on Discrete Algorithms
1996
373-382
R. E. Tarjan
Amortized Computational Complexity
SIAM J. Alg. Disc. Meth.
1985
6
2
306-318
L. Arge
Efficient External-Memory Data Structures and Applications
University of Aarhus
1996
February/August
R. L. Graham
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set
Information Processing Letters
1972
1
132-133
D. G. Kirkpatrick
R. Seidel
The Ultimate Planar Convex Hull Algorithm?
SIAM Journal of Computing
1986
15
287-299
L. J. Guibas
J. Stolfi
Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams
ACM Trans. on Graphics
1985
4
74-123
T. H. Cormen
C. E. Leiserson
R. L. Rivest
Introduction to Algorithms
The MIT Press, Cambridge, Mass.
1990
Computational Geometry -- Algorithms and Applications
M. de Berg
M. van Kreveld
M. Overmars
O. Schwarzkopf
Springer Verlag, Berlin
1997
TPIE User Manual and Reference (edition 0.9.01a)
L. Arge
R. Barve
O. Procopiuc
L. Toma
D. E. Vengroff
R. Wickremesinghe
Duke University
1999
The manual and software distribution are available on the web at \texttthttp://www.cs.duke.edu/TPIE/
V. Kumar
E. Schwabe
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory
Proc. IEEE Symp. on Parallel and Distributed Processing
1996
169-177
L. Arge
J. S. Vitter
Optimal Dynamic Interval Management in External Memory
Proc. IEEE Symp. on Foundations of Comp. Sci.
1996
560-569
H. Baumgarten
H. Jung
K. Mehlhorn
Dynamic Point Location in General Subdivisions
Journal of Algorithms
1994
17
342-380
M. J. Atallah
R. Cole
M. T. Goodrich
Cascading divide-and-conquer: A technique for designing parallel algorithms
SIAM Journal of Computing
1989
18
3
499-532
J. L. Bentley
R. Sedgewick
Fast Algorithms for Sorting and Searching Strings
Proc. ACM-SIAM Symp. on Discrete Algorithms
360-369
1996
T. Hagerup
Optimal Parallel String Algorithms: Merging, Sorting and Computing the Minimum
Proc. ACM Symp. on Theory of Computation
1994
382-391
J. F. JáJá
K. W. Ryu
U. Vishkin
Sorting strings and constructing digital search trees in parallel
Theoretical Computer Science
154
2
225-245
1996
K. A. Frenkel
The human genome project and informatics
Communications of the ACM
34
1991
41-51
N. S. Prywes
H. J. Gray
The organization of a Multilist-type associative memory
IEEE Trans. on Communication and Electronics
68
1963
488-492
R. Bayer
K. Unterauer
Prefix B-trees
ACM Trans. Database Syst.
2
1
1977
11-26
D. R. Morrison
PATRICIA: Practical algorithm to retrieve information coded in alphanumeric
Journal of the ACM
15
1968
514-534
U. Manber
G. Myers
Suffix arrays: A new method for on-line string searches
SIAM Journal of Computing
25
5
1993
935-948
P. Ferragina
R. Grossi
An external-memory indexing data structure with applications
1996
Full version of STOC'95 paper ``A fully-Dynamic data structure for external substring search''
R. Karp
R. Miller
A. Rosenberg
Rapid identification of repeated patterns in strings, arrays and trees
Proc. ACM Symp. on Theory of Computation
1972
125-136
M. Adler
New coding techniques for improved bandwidth utilization
Proc. IEEE Symp. on Foundations of Comp. Sci.
1996
173-182
R. A. Baeza-Yates
G. H. Gonnet
Handbook of Algorithms and Data Structures
Addison-Wesley
1991
P. Van Emde Boas
Preserving order in a forest in less than logarithmic time and linear space
Information Processing Letters
1977
6
80--82
M.L. Fredman
D.E. Willard
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences
47
424--436
1993
A. Andersson
T. Hagerup
S. Nilsson
R. Raman
Sorting in linear time?
Proc. ACM Symp. on Theory of Computation
427--436
1995
A. Andersson
S. Nilsson
A new efficient radix sort
Proc. IEEE Symp. on Foundations of Comp. Sci.
714--721
1994
M. Thorup
Randomized sorting in $O(n \log \log n)$ time and linear space using addition, shift, and bit-wise boolean operations
Proc. ACM-SIAM Symp. on Discrete Algorithms
1997
352-359
T. Hagerup
O. Petersson
Merging and sorting strings in parallel
Proc. International Symp. on Mathematical Foundations of Computer Science
298--306
1992
E. A. Fox
R. M. Akscyn
R. K. Furuta
J. J. Leggett
Special issue: Digital Libraries: Introduction
Communications of the ACM
38
4
April
1995
T. H. Merrett
Why Sort-Merge Gives the Best Implementation of the Natural Join
ACM SIGMOD Record
13
2
1983
E. M. McCreight
A space-economical suffix tree construction algorithm
Journal of the ACM
1976
23
2
262--272
D. E. Vengroff
J. S. Vitter
I/O-Efficient Scientific Computation using TPIE
1996
Proceedings of the Goddard Conference on Mass Storage Systems and Technologies
NASA Conference Publication 3340, Volume II
553--570
Peter M. Chen
Edward K. Lee
Garth A. Gibson
Randy H. Katz
David A. Patterson
RAID: High-performance, Reliable Secondary Storage
ACM Computing Surveys
1994
June
26
2
145--185
RAID, disk array, parallel I/O, survey, pario bib
An excellent overview of RAID concepts and technology. It starts from the beginning with a discussion of disk hardware, RAID basics, etc, and then goes on to discuss some of the more advanced features. They also describe a few RAID implementations. Basically, it is a perfect paper to read for folks new to RAID.
M. Thorup
On RAM priority queues
Proc. ACM-SIAM Symp. on Discrete Algorithms
1996
59-67
Strategic Directions in Storage I/O for Large-Scale Computing
G. A. Gibson
J. S. Vitter
J. Wilkes, Eds.
ACM Computing Surveys
28
4
1996
I/O-Efficient Algorithms and Environments for Large-Scale Computing
D. E. Vengroff
J. S. Vitter
ACM Computing Surveys
28
4es
December
1996
article 212
Communication Issues in Large-Scale Geometric Computation
J. S. Vitter
ACM Computing Surveys
28
4es
December
1996
article 20
L. Arge
P. Ferragina
R. Grossi
J. Vitter
On Sorting Strings in External Memory
Proc. ACM Symp. on Theory of Computation
540-548
1997
J. Nievergelt
P. Widmayer
Spatial data structures: Concepts and design choices
Algorithmic Foundations of GIS
M. van Kreveld and J. Nievergelt and T. Roos and P. Widmayer
Springer-Verlag, LNCS 1340
1997
153-197
P. Ferragina
F. Luccio
On the parallel dictionary matching problem: New results with applications
Proc. Annual European Symposium on Algorithms , LNCS 1136
261-275
1996
B. Kobler
J. Berbert
NASA Earth Observing Systems Data Information System (EOSDIS)
Digest of Papers: 11'th IEEE Symp. on Mass Storage Systems
1991
R. J. Lipton
R. E. Tarjan
A separator theorem for planar graphs
SIAM Journal of Applied Math.
1979
36
177-189
M. Van Kreveld
Digital Elevation Models: overview and selected TIN algorithms
Algorithmic Foundations of GIS
M. van Kreveld and J. Nievergelt and T. Roos and P. Widmayer
Springer-Verlag, LNCS 1340
1997
N. Sarnak
R. E. Tarjan
Planar point location using persistent search trees
Communications of the ACM
1986
29
669-679
G. N. Frederickson
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal of Computing
1987
16
1004-1022
T.K. Peucker
R.J. Fowler
J.J. Little
D.M. Mark
The Triangulated Irregular Network
Proc. DTM Symp.\ Am.\ Soc. of Photogrammetry---Am. Congress on Survey and Mapping
1978
24--31
96.07 kreveld
Y.-J. Chiang
C. T. Silva
I/O Optimal Isosurface Extraction
Proc. IEEE Visualization
293-300
1997
Y.-J. Chiang
C. T. Silva
W. J. Schroeder
Interactive Out-Of-Core Isosurface Extraction
Proc. IEEE Visualization
167--174
1998
Y.-J. Chiang
C. T. Silva
External memory techniques for isosurface extraction in scientific visualization
External memory algorithms and visualization
American Mathematical Society, DIMACS series in Discrete Mathematics and Theoretical Computer Science
1999
247-277
J. Abello and J. S. Vitter
A. Borodin
S. Irani
P. Raghaven
B. Schieber
Competitive Paging with Locality of Reference
Proc. ACM Symp. on Theory of Computation
1991
249-259
K. Romanik
J. S. Vitter
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments
Information and Computation
128
2
August 1
1996
87--108
M. van Kreveld
Variations on sweep algorithms: Efficient computation of extended viewsheds and classifications
Proc. 7th Int.\ Symp.\ on Spatial Data Handling
1996
13A.15--13A.27
96.08 kreveld
M. de Berg
M. van Kreveld
R. van Oostrum
M. Overmars
Simple traversal of a subdivision without extra storage
Proc. 3rd ACM Workshop on Advances in GIS
1995
77--84
96.08 kreveld
M. van Kreveld
J. Nievergelt
T. Roos
P. Widmayer (Eds.)
Algorithmic Foundations of GIS
Springer-Verlag
1997
LNCS 1340
I. S. Evans
The Selection of Class Intervals
Trans. Inst. Br. Geogrs.
2
1977
98--124
95.12 kreveld
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
J. Naughton
Building a Scalable Geo-Spatial DBMS: Technology, Implementation, and Evaluation
Proc. SIGMOD Intl. Conf. on Management of Data
1997
P. K. Agarwal
L. Arge
T. M. Murali
K. Varadarajan
J. S. Vitter
I/O-Efficient Algorithms for Contour Line Extraction and Planar Graph Blocking
Proc. ACM-SIAM Symp. on Discrete Algorithms
117-126
1998
E. McCreight
$<$problem 81-8$>$
Journal of Algorithms
1981
2
314
J. M. Patel
D. J. DeWitt
Partition Based Spatial-Merge Join
Proc. SIGMOD Intl. Conf. on Management of Data
259-270
1996
T. Brinkhoff
H.-P. Kriegel
B. Seeger
Efficient Processing of Spatial Joins Using R-trees
Proc. SIGMOD Intl. Conf. on Management of Data
1993
J. L. Bentley
Decomposable searching problems
Information Processing Letters
1979
8
5
244-251
M. H. Overmars
J. Van Leeuwen
Worst-case optimal insertion and deletion methods for decomposable searching problems
Information Processing Letters
1981
12
168-173
H. Edelsbrunner
H. A. Maurer
On the intersection of orthogonal objects
Information Processing Letters
1981
13
177-181
H. W. Six
D. Wood
Counting and reporting intersections of $d$-ranges
IEEE Transactions on Computers
1982
31
181-187
G. Graefe
Query evaluation techniques for large databases
ACM Computing Surveys
1993
25
2
73-170
A. U. Tanzel
J. Clifford
S. Gadia
S. Jajodia
A. Segev
R. Snodgrass
Temporal Databases: Theory, Design and Implementation
The Benjamin/Cummings Publishing Company Inc.
1993
J. R. Driscoll
N. Sarnak
D. D. Sleator
R. Tarjan
Making Data Structures Persistent
Journal of Computer and System Sciences
1989
38
86-124
Spatial Joins Using Seeded Trees
M.-L. Lo
C. V. Ravishankar
Proc. SIGMOD Intl. Conf. on Management of Data
1994
209--220
Spatial Hash-Joins
M.-L. Lo
C. V. Ravishankar
Proc. SIGMOD Intl. Conf. on Management of Data
1996
247--258
O. Günther
Efficient Computation of Spatial Joins
50--60
Proc. IEEE International Conference on Data Engineering
1993
N. Koudas
K. C. Sevcik
Size Separation Spatial Join
Proc. SIGMOD Intl. Conf. on Management of Data
1997
324-335
M. van Kreveld
R. van Oostrum
C. Bajaj
V. Pascucci
D. Schikore
Contour Trees and Small Seed Sets for Isosurface Traversal
Proc. ACM Annual Symposium on Computational Geometry
1997
212-219
L. Arge
O. Procopiuc
S. Ramaswamy
T. Suel
J. S. Vitter
Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems
Proc. ACM-SIAM Symp. on Discrete Algorithms
685-694
1998
P. K. Agarwal
J. Erickson
Geometric range searching and its relatives
Discrete and Computational Geometry: Ten Years Later
1997
B. Chazelle and E. Goodman and R. Pollack
Mathematical Society Press
R. Tamassia, editor
Strategic directions in computational geometry
ACM Computing Surveys
1996
28
4