Planar point location using persistent search trees
Communications of the ACM
Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Visibility problems for polyhedral terrains
Journal of Symbolic Computation
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An algorithm for generalized point location and its applications
Journal of Symbolic Computation
On the two-dimensional davenport-schinzel problem
Journal of Symbolic Computation
Fully persistent lists with catenation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Persistent structures to store moving images
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Fully persistent lists with catenation
Journal of the ACM (JACM)
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Parallel algorithms for evaluating sequences of set-manipulation operations
Journal of the ACM (JACM)
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the exact worst case query complexity of planar point location
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
Entropy-preserving cuttings and space-efficient planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A simple entropy-based algorithm for planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Making data structures confluently persistent
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Supporting Temporal Views in a ManagementInformation Base
Journal of Network and Systems Management
Historical queries along multiple lines of time evolution
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient Management of Time-Evolving Databases
IEEE Transactions on Knowledge and Data Engineering
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Making data structures confluently persistent
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Computational Geometry: Theory and Applications
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
A simple entropy-based algorithm for planar point location
ACM Transactions on Algorithms (TALG)
The complexity of the outer face in arrangements of random segments
Proceedings of the twenty-fourth annual symposium on Computational geometry
Versioning Tree Structures by Path-Merging
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Succinct geometric indexes supporting point location queries
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms and theory of computation handbook
Developments in data structure research during the first 25 years of FSTTCS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.02 |