Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and network algorithms
Data structures and network algorithms
Computational geometry: an introduction
Computational geometry: an introduction
Calculating approximate curve arrangements using rounded arithmetic
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Epsilon geometry: building robust algorithms from imprecise computations
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
BLASTING through the information theoretic barrier with FUSION TREES
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Numerical stability of algorithms for line arrangements
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Applications of the fusion tree method to computational geometry and searching
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fast geometric approximation techniques and geometric embedding problems
Theoretical Computer Science
Dynamic generation of discrete random variates
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximation algorithms for convex hulls
Communications of the ACM
An optimal real-time algorithm for planar convex hulls
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On Maintaining the Width and Diameter of a Planar Point-Set Online
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Verifiable implementations of geometric algorithms using finite precision arithmetic
Verifiable implementations of geometric algorithms using finite precision arithmetic
New sampling-based summary statistics for improving approximate query answers
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Optimal parallel approximation for prefix sums and integer sorting
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Time-Interval Sampling for Improved Estimations in Data Warehouses
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Car-Pooling as a Data Structuring Device: The Soft Heap
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Adaptive sampling for geometric problems over data streams
Computational Geometry: Theory and Applications
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Determining the visibility of a planar set of line segments in O(n log log n) time
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Computing discriminating and generic words
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |