Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Further applications of random sampling to computational geometry
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Computing Euclidean maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An acyclicity theorem for cell complexes in d dimensions
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Optimal cooperative search in fractional cascaded data structures
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Maintenance of geometric extrema ∈
Journal of the ACM (JACM)
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Fully persistent lists with catenation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximate submatrix matching problems
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Fully persistent lists with catenation
Journal of the ACM (JACM)
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
Robust proximity queries: an illustration of degree-driven algorithm design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A Learning-Based Prediction-and-Verification Segmentation Scheme for Hand Sign Image Sequence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
Making data structures confluently persistent
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient Management of Time-Evolving Databases
IEEE Transactions on Knowledge and Data Engineering
Making data structures confluently persistent
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Algorithms and theory of computation handbook
| Hi-index | 0.00 |