External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract)

Communication issues in large-scale geometric computation

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research

I/O-efficient algorithms and environments

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research

Efficient external memory algorithms by simulating coarse-grained parallel algorithms

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures

On sorting strings in external memory (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

External memory algorithms

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Randomized external-memory algorithms for some geometric problems

Proceedings of the fourteenth annual symposium on Computational geometry

Blocking in parallel multisearch problems (extended abstract)

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

I/O-efficient dynamic planar point location (extended abstract)

Proceedings of the sixteenth annual symposium on Computational geometry

Distribution sort with randomized cycle

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Lower bounds for intersection searching and fractional cascading in higher dimension

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)

Scalable Sweeping-Based Spatial Join

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases

I/O-Efficient Shortest Path Queries in Geometric Spanners

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures

Exponential Structures for Efficient Cache-Oblivious Algorithms

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

Approximation Techniques for Indexing Two-Dimensional Constraint Databases

DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications

I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science

Planar Point Location for Large Data Sets: To Seek or Not to Seek

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering

External Memory Data Structures

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms

External memory data structures

Handbook of massive data sets

External memory algorithms

Handbook of massive data sets

Toward Spatial Joins for Polygons

SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management

Planar point location for large data sets: to seek or not to seek

Journal of Experimental Algorithmics (JEA)

Lower bounds for intersection searching and fractional cascading in higher dimension

Journal of Computer and System Sciences - STOC 2001

I/O-efficient point location using persistent B-trees

Journal of Experimental Algorithmics (JEA)

I/O-efficient dynamic planar point location

Computational Geometry: Theory and Applications

Lower bounds for external algebraic decision trees

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

I/O-efficient batched union-find and its applications to terrain analysis

Proceedings of the twenty-second annual symposium on Computational geometry

I/O-efficient algorithms for computing planar geometric spanners

Computational Geometry: Theory and Applications

Computing visibility on terrains in external memory

Journal of Experimental Algorithmics (JEA)

Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures

I/O-efficient map overlay and point location in low-density subdivisions

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

I/O-Efficient algorithms on near-planar graphs

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics