%-----------------------------------------------------
%random sampling and randomized-incremental algorithms
%-----------------------------------------------------
@article
 {cla1,
  author="L. Clarkson",
  title="Applications of Random sampling in Computational geometry",
  journal="Discrete and Computational Geometry",
  year="1987",
  volume="2",
  number="",  
  pages="195-222"
 }



@article
 {cla2,
  author="L. Clarkson and P. Shor",
  title="Applications of Random sampling in Computational geometry, II",
  journal="Discrete and Computational Geometry",
  year="1989",
  volume="4",
  number="",  
  pages="387-421"
 }


@article
 {cla3,
  author="K. Clarkson",
  title="A randomized algorithm for closest-point queries",
  journal="SIAM Journal of Computing",
  year="1988",
  volume="17",
  number="4",  
  pages="830-847"
 }


@inproceedings
 {cla4,
  author="K. Clarkson",
  title="Algorithms for polytope covering and approximation",
  booktitle="$3^{rd} WADS - LNCS 709$",
  address="Montreal",
  year="1993",
  pages=""
}

@article
 {boi1,
  author="JD. Boissonat and O. Devillers and others",
  title="Applications of random sampling to On-Line algorithms in 
         Computational Geometry",
  journal="Discrete and Computational Geometry",
  year="1992",
  volume="8",
  number="",  
  pages="51-71"
 }

@article
 {cha1,
  author="B. Chazelle and J. Friedman",
  title="A Deterministic view of random sampling and its use in geometry",
  journal="Combinatorica",
  year="1990",
  volume="3",
  number="",  
  pages="229-249"
 }


@inproceedings
 {cha2,
  author="B. Chazelle and J. Friedman",
  title="A Deterministic View of Random Sampling and its use in Geometry",
  booktitle="IEE Foundations of Computer Science",
  year="1988",
  pages="539-549"
 }



@article
 {cla5,
  author="K. Clarkson and others",
  title="Four results on Randomized Incremental Constructions",
  journal="Lectures Notes in Computer Science",
  year="1991",
  volume="557",
  number="",  
  pages=""
 }




@inproceedings
 {cla6,
  author="K. Clarkson and P. Shor",
  title="Algorithms for Diametral Pairs and Convex Hulls that are
         Optimal, Randomized and Incremental",
  booktitle="4 th Symposium in Compatational Geometry",
  year="1988",
  pages="12-17"
 }

@article
 {ode1,
  author="O. Devillers",
  title="Randomization yields simple $O(n*log^{*}(n)$ algorithms for difficult
         $\Omega (n)$ problems",
  journal="International Journal of Computational Geometry and Applications",
  year="1992",
  volume="2",
  number="1",  
  pages="97-111"
 }

@inproceedings
 {cla7,
  author="K. Clarkson",
  title="A probabilistic algorithm for the post office problem",
  booktitle="17 th Symp. on the Theory of Computing",
  year="1985",
  pages="175-184"
 }


@article
 {meh1,
  author="K. Mehlhorn and M. Sharir and E. Welzl",
  title="Tail estimates for the efficiency of randomized incremental 
         algorithms for line segment intersection",
  journal="Computational Geometry : Theory and Applications",
  year="1993",
  volume="3",
  number="",  
  pages="325-246"
 }

%----------------------------------------------------------
%convergence of empirical measures and random sample size
%----------------------------------------------------------
@article
 {sau,
  author="N. Sauer",
  title="On the density of families of sets",
  journal="Journal of Combinatorial theory (A)",
  year="1972",
  volume="13",
  number="",  
  pages="145-147"
 }

@article
 {hau,
  author="D. Haussler and E. Welzl",
  title="$\epsilon -nets$ and Simplex Range Queries",
  journal="Discrete and Computational Geometry",
  year="1987",
  volume="2",
  number="",  
  pages="127-151"
 }

@article
 {vap1,
  author="N. Vapnik and A. Chervonenkis",
  title="On the uniform convergence of relative frequencies of events to
         their probabilities",
  journal="Theory of probability and its Applications (SIAM)",
  year="1971",
  volume="16",
  number="2",  
  pages="264-280"
 }


@inproceedings
 {mat1,
  author="J. Matousek",
  title="Construction of $\epsilon -nets$",
  booktitle="5 th ACM Symposium in Computational Geometry",
  year="1989",
  pages="1-10"
 }

@article
 {lov,
  author="L. Lovasz",
  title="On the ratio of optimal and fractional covers",
  journal="Discrete Mathematics",
  year="1975",
  volume="13",
  number="",  
  pages="383-390"
 }


@inproceedings
 {mat3,
  author="J. Matousek and R. Seidel and E. Welzl",
  title="How to net a lot with Little :
         Small $\epsilon -nets for disks and halfspaces$",
  booktitle="6 th ACM Symposium in Computational Geometry",
  pages="16-22"
 }

@inproceedings
 {pac,
  author="J. Pach and G. Woeginger",
  title="Some new bounds for $\epsilon -nets$",
  booktitle="6 th ACM Symposium in Computational Geometry",
  pages="10-15"
 }


@inproceedings
 {cha3,
  author="B. Chazelle and M. Sharir and E. Welzl",
  title="Quasi-optimal upper bounds for simplex range-searching
         and new zone theorems",
  booktitle="6 th ACM Symposium in Computational Geometry",
  pages="23-33"
 }

@inproceedings
 {mat4,
  author="J. Matousek",
  title="Approximations and optimal geometric divide-and-conquer",
  booktitle="23 th ACM Symp. Theory Computing",
  pages="505-511"
 }

@inproceedings
 {cha4,
  author="B. Chazelle and others",
  title="Improved bounds on weak $\epsilon -nets$ for convex sets",
  booktitle="25 th ACM Symp. Theory Computing",
  pages="495-504"
 }

@article
 {kom,
  author="J. Komlos and others",
  title="Almost tight bounds for $\epsilon -nets$",
  journal="Discrete and Computational Geometry",
  year="1992",
  volume="7",
  number="",  
  pages="163-173"
 }

@article
 {blu,
  author="A. Blumer and others",
  title="Learnability and the Vapnik-Chervonenkis dimension",
  journal="Journal of the ACM",
  year="1989",
  volume="36",
  number="4",  
  pages="929-965"
 }

@article
 {wen,
  author="R. Wenocur and RM. Dudley",
  title="Some special Vapnik-Chervonenkis classes",
  journal="Discrete Mathematics",
  year="1981",
  volume="33",
  number="",  
  pages="313-318"
 }

@article
 {ass,
  author="P. Assouad",
  title="Densite et dimension",
  journal="Ann. Institut Fourier, Grenoble",
  year="1983",
  volume="33",
  number="3",  
  pages="233-282"
 }


@article
 {dud,
  author="RM. Dudley",
  title="Balls in $R^{k}$ cut all subsets of k+2 points",
  journal="Advances in Mathematics",
  year="1979",
  volume="31",
  number="",  
  pages="306-308"
 }


%----------------------------------------------------------
% Random sampling and derandomisation
%----------------------------------------------------------
@article
 {matW,
  author="J. Matousek and E. Welzl and L. Wernisch",
  title="Discrepancy and approximations for bounded VC-dimension",
  journal="Combinatorica",
  year="1993",
  volume="4",
  number="",  
  pages="455-466"
 }

@inproceedings
 {bronn,
  author="H. Bronnimann and B. Chazelle and J. Matousek",
  title="Product Range Spaces, Sensitive Sampling, and
		  Derandomization",
  
  booktitle="34th IEEE FOCS",
  year="1993",
  pages="400-409"
 }

@inproceedings
 {cha,
  author="B. Chazelle",
  title="Geometric Discrepancy Revisited",
  booktitle="34th IEEE FOCS",
  year="1993",
  pages="392-399"
 }


%----------------------------------------------------------
% Partitions / Cuttings
%----------------------------------------------------------
@inproceedings
 {aga,
  author="P. Agarval",
  title="A Deterministic algorithm for partitionning arrangements of lines
         and its applications",
  booktitle="ACM 5 th Symposium on Computational Geometry",
  year="1989",
  pages="11-22"
 }


@inproceedings
 {mat2,
  author="J. Matousek",
  title="Cutting hyperplane arrangements",
  booktitle="6 th ACM Symposium in Computational Geometry",
  pages="1-9"
 }


@inproceedings
 {jm,
  author="J. Matousek",
  title="Range searching with efficient hierarchical cuttings",
  booktitle="$8^{th} ACM Symposium in Computational Geometry$",
  address="Berlin",
  year="1992",
  pages=""
}


@article
 {,
  author="J. Matousek",
  title="Geometric range searching",
  journal="ACM Computing surveys",
  year="1994",
  volume="26",
  number="4",
  pages=""
}