A deterministic view of random sampling and its use in geometry
- 1 September 1990
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 10 (3) , 229-249
- https://doi.org/10.1007/bf02122778
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Puncture setsJournal of Combinatorial Theory, Series A, 1974
- On a Set of Almost Deterministic $k$-Independent Random VariablesThe Annals of Probability, 1974
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972