A deterministic view of random sampling and its use in geometry

A deterministic view of random sampling and its use in geometry (1990)

Cached

Download Links

[www.math.ubc.ca]
[www.math.ubc.ca]

Other Repositories/Bibliography

DBLP

by Bernard Chazelle , Joel Friedman

Venue:	Combinatorica
Citations:	96 - 7 self

BibTeX

@ARTICLE{Chazelle90adeterministic,
    author = {Bernard Chazelle and Joel Friedman},
    title = {A deterministic view of random sampling and its use in geometry},
    journal = {Combinatorica},
    year = {1990},
    volume = {10},
    pages = {229--249}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

816	On the uniform convergence of relative frequencies of events to their probabilities. Theory of Prob. and its - Vapnik, Chervonenkis - 1971
643	Algorithms in combinatorial geometry - Edelsbrunner - 1987
357	Applications of random sampling in computational geometry - Shor - 1989
259	Probabilistic construction of deterministic algorithms: approximating packing integer programs - RAGHAVAN - 1988
240	Epsilon-nets and simplex range queries - Haussler, Welzl - 1987
231	Combinatorial Problems and Exercises - Lovász - 1993
217	On the ratio of optimal integral and fractional covers - Lovasz - 1975
205	On the density of families of sets - Sauer - 1972
193	A fast and simple randomized parallel algorithm for the maximal independent set problem - Alon, Babai, et al.
104	A randomized algorithm for closest-point queries - Clarkson - 1988
101	Constructing arrangements of lines and hyperplanes with applications - Edelsbrunner, O’Rourke, et al. - 1986
69	Probabilistic methods in combinatorics - Erdos, Spencer - 1974
53	Ten lectures on the probabilistic method - Spencer - 1987
43	On a set of almost deterministic k-independent random variables - Joffe - 1974
38	Partition trees for triangle counting and other range searching problems - Welzl - 1988
32	An O(n log log n)-time algorithm for triangulating a simple polygon - Tarjan, Wyk - 1988
29	Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental - Clarkson, Shor - 1988
24	Red-blue intersection detection algorithms, with applications to motion planning and collision detection - Agarwal, Sharir - 1990
23	A fast Las Vegas algorithm for triangulating a simple polygon, Discrete and Computational Geometry 4 - Clarkson, Tarjan, et al. - 1989
21	Optimal randomized parallel algorithms for computational geometry, Algorithmica 7 - Reif, Sen - 1992
17	Implicitly representing arrangements of lines or segments - Edelsbrunner, Guibas, et al. - 1989
9	The complexity of many faces in arrangements of lines and of segments - Edelsbrunner, Guibas, et al. - 1988
3	Explicit codes with low covering radius - Pach, Spencer - 1988
2	Puncture sets - Spencer - 1974
1	5. Clarkson, K.L. Applications of random sampling - Geom - 1987
1	Algorithms for diametral pairs and convex hulls that are optimal - Geom - 1988