J. [. Alon and . Spencer, The Probabilistic Method, 2008.

B. [. Auger and . Doerr, Theory of Randomized Search Heuristics:Foundations and Recent Developments, 2011.

Y. [. Bshouty, P. M. Li, and . Long, Using the doubling dimension to analyze the generalization of learning algorithms, Journal of Computer and System Sciences, vol.75, issue.6, pp.323-335, 2009.
DOI : 10.1016/j.jcss.2009.01.003

B. Chazelle, A note on Haussler's packing lemma. 1992. Unpublished manuscript

P. [. Clarkson and . Shor, Applications of random sampling in computational geometry, II, Discrete & Computational Geometry, vol.1, issue.5, pp.387-421, 1989.
DOI : 10.1007/BF02187740

B. Chazelle and E. Welzl, Quasi-optimal range searching in spaces of finite VC-dimension, Discrete & Computational Geometry, vol.14, issue.5, pp.467-489, 1989.
DOI : 10.1007/BF02187743

]. R. Dud78 and . Dudley, Central limit theorems for empirical measures, Ann. Probab, vol.6, issue.6, pp.899-1049, 1978.

E. [. Dutta, A. Ezra, and . Ghosh, Two Proofs for Shallow Packings, Proc. 31st Int. Sympos. Comput. Geom, pp.96-110, 2015.
DOI : 10.1007/s00454-016-9824-0
URL : https://hal.archives-ouvertes.fr/hal-01360460

E. Ezra, A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension, Proc. 25th Ann. ACM-SIAM Symposium on Discrete Algorithms, pp.84-101, 2014.
DOI : 10.1137/140977746

L. Gottlieb, A. Kontorovich, and E. Mossel, VC bounds on the cardinality of nearly orthogonal function classes, Discrete Mathematics, vol.312, issue.10, pp.3121766-1775, 2012.
DOI : 10.1016/j.disc.2012.01.030

]. D. Hau92 and . Haussler, Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications, Inf. Comput, vol.100, issue.1, pp.78-150, 1992.

]. D. Hau95 and . Haussler, Sphere Packing Numbers for Subsets of the Boolean N-cube with Bounded Vapnik-Chervonenkis Dimension, J. Comb. Theory Ser. A, vol.69, issue.2, pp.217-232, 1995.

D. Haussler, N. Littlestone, and M. K. Warmuth, Predicting {0, 1}-Functions on Randomly Drawn Points, Information and Computation, vol.115, issue.2, pp.248-292, 1994.
DOI : 10.1006/inco.1994.1097

. [. Har-peled, Geometric Approximation Algorithms, 2011.
DOI : 10.1090/surv/173

M. [. Har-peled and . Sharir, Relative (p,??)-Approximations in Geometry, Discrete & Computational Geometry, vol.1, issue.2, pp.462-496, 2011.
DOI : 10.1007/s00454-010-9248-1

D. Haussler and E. Welzl, Epsilon-nets and simplex range queries, Proceedings of the second annual symposium on Computational geometry , SCG '86, pp.127-151, 1987.
DOI : 10.1145/10515.10522

Y. Li, P. M. Long, and A. Srinivasan, Improved Bounds on the Sample Complexity of Learning, Journal of Computer and System Sciences, vol.62, issue.3, pp.516-527, 2001.
DOI : 10.1006/jcss.2000.1741

R. [. Lovett and . Meka, Constructive Discrepancy Minimization by Walking on the Edges, Proc. IEEE 53rd Ann. Symposium on Foundations of Computer Science, FOCS '12, pp.61-67

J. Matou?ek, Reporting points in halfspaces, Computational Geometry, vol.2, issue.3, pp.169-186, 1992.
DOI : 10.1016/0925-7721(92)90006-E

J. Matousek, Tight upper bounds for the discrepancy of half-spaces, Discrete & Computational Geometry, vol.16, issue.4, pp.593-601, 1995.
DOI : 10.1007/BF02574066

J. Matousek, Geometric Discrepancy: An Ilustrated Guide (Algorithms and Combinatorics ), 1999.
DOI : 10.1007/978-3-642-03942-3

J. Matousek, Lectures on Discrete Geometry, 2002.
DOI : 10.1007/978-1-4613-0039-7

]. W. Mulz and . Mulzer, Chernoff Bounds, Personal note

]. N. Mus16 and . Mustafa, A simple proof of the shallow packing lemma, Discrete & Computational Geometry, vol.55, issue.3, pp.739-743, 2016.

S. [. Mustafa and . Ray, Near-Optimal Generalisations of a Theorem of Macbeath, Proc. 31st International Symposium on Theoretical Aspects of Computer Science, STACS '14, pp.578-589, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01026333

A. [. Panconesi and . Srinivasan, Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds, SIAM Journal on Computing, vol.26, issue.2, pp.350-368, 1997.
DOI : 10.1137/S0097539793250767

]. D. Pol84 and . Pollard, Convergence of Stochastic Processes, 1984.

M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, 1995.

N. Sauer, On the density of families of sets, Journal of Combinatorial Theory, Series A, vol.13, issue.1, pp.145-147, 1972.
DOI : 10.1016/0097-3165(72)90019-2

S. Shelah, A combinatorial problem; stability and order for models and theories in infinitary languages, Pacific Journal of Mathematics, vol.41, issue.1, pp.247-261, 1972.
DOI : 10.2140/pjm.1972.41.247

A. [. Vapnik and . Chervonenkis, On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities, Theory of Probability & Its Applications, vol.16, issue.2, pp.264-280, 1971.
DOI : 10.1137/1116025

]. E. Wel92 and . Welzl, On Spanning Trees with Low Crossing Numbers In Data Structures and Efficient Algorithms, pp.233-249, 1992.