Computational geometry: an introduction
Computational geometry: an introduction
A practical divide-and-conquer algorithm for the rectangle intersection problem
Information Sciences: an International Journal
The input/output complexity of sorting and related problems
Communications of the ACM
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Introduction to algorithms
Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Spatial joins using seeded trees
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Efficient Computation of Spatial Joins
Proceedings of the Ninth International Conference on Data Engineering
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
A Unified Approach for Indexed and Non-Indexed Spatial Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficient Bulk Operations on Dynamic R-trees
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
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
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
External memory data structures
Handbook of massive data sets
Handbook of massive data sets
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
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
External-memory algorithms and data structures
Algorithms and theory of computation handbook
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
On (dynamic) range minimum queries in external memory
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |