Closest pair and the post office problem for stochastic points

An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Sunil Arya, David M. Mount, Nathan S. Netanyahu et al. · Journal of the ACM · 1998 · 2.3K citations · Full text

Computational Complexity Theory, Engineering, Computational Complexity +19

The Complexity of Enumeration and Reliability Problems

Leslie G. Valiant · SIAM Journal on Computing · 1979 · 2.1K citations

Reliability Engineering, Engineering, Abstract Complexity +15

Computational geometry: Algorithms and applications

Computers & Mathematics with Applications · 1998 · 1.5K citations

Geometric Modeling, Geometric Algorithm, Geometry +4

The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

J. Scott Provan, Michael O. Ball · SIAM Journal on Computing · 1983 · 749 citations

Engineering, Several Enumeration, Network Analysis +17

Introduction to geometric probability

Choice Reviews Online · 1998 · 471 citations

Integral Geometry, Geometry Of Number, Discrete Geometry +12