|
2
|
Geometric Set Systems
– Jirí Matousek
- 1998
|
|
2
|
The discrepancy method in computational geometry
– B. Chazelle
- 2004
|
|
133
|
Almost optimal set covers in finite VC-dimension
– Herve Brönnimann, Michael T. Goodrich
|
|
8
|
How to Net a Lot with Little: Small ε-Nets for Disks and Halfspaces
– Jiri Matousek, Raimund Seidel, Emo Welzl
- 2000
|
|
17
|
Derandomization in Computational Geometry
– Jirí Matousek
- 1996
|
|
2
|
Defect Sauer Results
– Béla Bollobás, A. J. Radcliffe
|
|
72
|
Arrangements and Their Applications
– Pankaj K. Agarwal, Micha Sharir
- 1998
|
|
3
|
A constrained version of Sauer's Lemma
– Joel Ratsaby
- 2004
|
|
|
Complexity of VC-classes of sequences with long repetitive runs
– Joel Ratsaby
- 2006
|
|
16
|
Quantifying the Amount of Verboseness
– Richard Beigel, Martin Kummer, Frank Stephan
- 1995
|
|
84
|
Sphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension
– David Haussler
- 1992
|
|
46
|
Geometric Range Searching
– Jiri Matousek
- 1994
|
|
4
|
Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
– Bernd Gärtner, Emo Welzl
- 1997
|
|
1
|
Forbidding complete hypergraphs as traces
– Dhruv Mubayi, Yi Zhao
- 2006
|
|
1
|
Non-orthogonal Range Searching
– Yurai Núñez
- 2007
|
|
|
Non-orthogonal Range Searching: A Review
– Yurai Núñez-rodríguez
- 2008
|
|
|
VC-dimensions of random function classes
– Bernard Ycart, Joel Ratsaby
- 2007
|
|
4
|
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming
– Michael T. Goodrich , Edgar A. Ramos
|
|
96
|
A deterministic view of random sampling and its use in geometry
– Bernard Chazelle, Joel Friedman
- 1990
|
