The Greedy and Delaunay triangulations are not bad in the average case
Information Processing Letters
A guided tour of Chernoff bounds
Information Processing Letters
Mathematics of Operations Research
Probabilistic recurrence relations
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Use of the TRIPOD overlay network for resource discovery
Future Generation Computer Systems
Smoothed analysis of partitioning algorithms for Euclidean functionals
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On a linear program for minimum-weight triangulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |