SCG '87 Proceedings of the third annual symposium on Computational geometry
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
Quasi-Valid range querying and its implications for nearest neighbor problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Optimal sample cost residues for differential database batch query problems
Journal of the ACM (JACM)
Intersection queries for curved objects (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Minimum Spanning Trees of Moving Points in the Plane
IEEE Transactions on Computers
Applications of the fusion tree method to computational geometry and searching
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
APT: a data structure for optimal control dependence computation
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
SorTables: a browser for a digital library
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Optimal control dependence computation and the Roman chariots problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Quasilinear algorithms for processing relational calculus expressions (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multi-method dispatching: a geometric approach with applications to string matching problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
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)
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Memory-Efficient Ray Classification for Visibility Operations
IEEE Transactions on Visualization and Computer Graphics
A Data Structure for Fast Region Searches
IEEE Design & Test
The new k-windows algorithm for improving the k-means clustering algorithm
Journal of Complexity
Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Orthogonal Range Queries in OLAP
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Optimal Facility Location under Various Distance Functions
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Online Data Structures in External Memory
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Online Data Structures in External Memory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Cache-oblivious data structures for orthogonal range searching
Proceedings of the nineteenth annual symposium on Computational geometry
External memory data structures
Handbook of massive data sets
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
Lower bounds for intersection searching and fractional cascading in higher dimension
Journal of Computer and System Sciences - STOC 2001
Rectangle enclosure reporting in linear space revisited
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Cache-oblivious planar orthogonal range searching and counting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Space efficient dynamic orthogonal range reporting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
An optimal dynamic interval stabbing-max data structure?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Information Processing Letters
Unsupervised clustering on dynamic databases
Pattern Recognition Letters
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science
Embedding advanced geometric techniques into SQL for efficient indexing of mobile objects
AIC'05 Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
A new approach on indexing mobile objects on the plane
Data & Knowledge Engineering
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Succinct Text Indexing with Wildcards
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Efficient method for maximizing bichromatic reverse nearest neighbor
Proceedings of the VLDB Endowment
Interval Stabbing Problems in Small Integer Ranges
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Information Processing Letters
Indexing mobile objects on the plane revisited
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Proceedings of the twenty-sixth annual symposium on Computational geometry
Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
External-memory algorithms and data structures
Algorithms and theory of computation handbook
Criteria for reducibility of moving objects closeness problem
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Worst case efficient single and multiple string matching in the RAM model
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional spaces
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient non-intersection queries on aggregated geometric data
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Indexability of 2D range search revisited: constant redundancy and weak indivisibility
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Journal of Discrete Algorithms
Generalizing the k-Windows clustering algorithm in metric spaces
Mathematical and Computer Modelling: An International Journal
Stabbing horizontal segments with vertical rays
Proceedings of the twenty-eighth annual symposium on Computational geometry
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
Proceedings of the twenty-eighth annual symposium on Computational geometry
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
Proceedings of the twenty-eighth annual symposium on Computational geometry
String indexing for patterns with wildcards
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Linear-Space data structures for range minority query in arrays
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Lower bounds for sorted geometric queries in the I/O model
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Algorithms for range-skyline queries
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
| Hi-index | 0.01 |