Fetching the paper…
Reading the bibliography…
An important result in discrepancy due to Banaszczyk states that for any set of $n$ vectors in $\mathbb{R}^m$ of $\ell_2$ norm at most $1$ and any convex body $K$ in $\mathbb{R}^m$ of Gaussian measure at least half, there exists a $\pm 1$ combination of these vectors which lies in $5K$.
On tail probabilities for martingales
David A. Freedman · 1975
Earlier work this paper cites.
Roths estimate of the discrepancy of integer sequences is nearly sharp
József Beck · 1981
Earlier work this paper cites.
Integer-making theorems
József Beck and Tibor Fiala · 1981
Earlier work this paper cites.
Six standard deviations suffice
Joel Spencer · 1985
Earlier work this paper cites.
Discrepancy of set-systems and matrices
László Lovász, Joel Spencer, and Katalin Vesztergombi · 1986
Earlier work this paper cites.
Ten lectures on the probabilistic method
Joel H Spencer · 1987
Earlier work this paper cites.
Extremal properties of orthogonal parallelepipeds and their applications to the geometry of banach spaces
Efim Davydovich Gluskin · 1989
Earlier work this paper cites.
Balancing vectors and gaussian measures of n-dimensional convex bodies
Wojciech Banaszczyk · 1998
Earlier work this paper cites.
An Lp version of the beck–fiala conjecture
Jirı Matoušek · 1998
Earlier work this paper cites.
The discrepancy method: randomness and complexity
Bernard Chazelle · 2000
Earlier work this paper cites.
On the power of linear dependencies
Imre Bárány · 2008
Earlier work this paper cites.
Geometric discrepancy: An illustrated guide
Jiri Matousek · 2009
Earlier work this paper cites.
Constructive algorithms for discrepancy minimization
Nikhil Bansal · 2010
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2010
Cited alongside, same era.
Tight hardness results for minimizing discrepancy
Moses Charikar, Alantha Newman, and Aleksandar Nikolov · 2011
Cited alongside, same era.
Iterative Methods in Combinatorial Optimization
Lap-Chi Lau, R. Ravi, and Mohit Singh · 2011
Cited alongside, same era.
On series of signed vectors and their rearrangements
Wojciech Banaszczyk · 2012
Cited alongside, same era.
Constructive discrepancy minimization by walking on the edges
Shachar Lovett and Raghu Meka · 2012
Cited alongside, same era.
Discrepancy without partial colorings
Nicholas J. A. Harvey, Roy Schwartz, and Mohit Singh · 2014
Later among the works it cites.
On range searching in the group model and combinatorial discrepancy
Kasper Green Larsen · 2014
Later among the works it cites.
Factorization norms and hereditary discrepancy
Jiri Matousek, Aleksandar Nikolov, and Kunal Talwar · 2014
Later among the works it cites.
New computational aspects of discrepancy theory
Aleksandar Nikolov · 2014
Later among the works it cites.
Constructive discrepancy minimization for convex sets
Thomas Rothvoss · 2014
Later among the works it cites.
Constructive discrepancy minimization for convex sets
Thomas Rothvoss · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The komlós conjecture holds for vector colorings
Aleksandar Nikolov · 2013
Cited alongside, same era.
The geometry of differential privacy: the sparse and approximate cases
Aleksandar Nikolov, Kunal Talwar, and Li Zhang · 2013
Cited alongside, same era.
Approximating bin packing within o(log OPT * log log OPT) bins
Thomas Rothvoss · 2013
Cited alongside, same era.
Better algorithms and hardness for broadcast scheduling via a discrepancy approach
Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, and Shi Li · 2014
Cited alongside, same era.
A Panorama of Discrepancy Theory
William Chen, Anand Srivastav, Giancarlo Travaglini, et al · 2014
Cited alongside, same era.
Efficient algorithms for discrepancy minimization in convex sets
Ronen Eldan and Mohit Singh · 2014
Cited alongside, same era.
An algorithm for komlös conjecture matching Banaszczyk’s bound
Nikhil Bansal, Daniel Dadush, and Shashwat Garg · 2016
Later among the works it cites.
Approximation-friendly discrepancy rounding
Nikhil Bansal and Viswanath Nagarajan · 2016
Later among the works it cites.
Towards a constructive version of banaszczyk’s vector balancing theorem
Daniel Dadush, Shashwat Garg, Shachar Lovett, and Aleksandar Nikolov · 2016
Later among the works it cites.
Algorithmic discrepancy beyond partial coloring
Nikhil Bansal and Shashwat Garg · 2017
Closest in time.
Deterministic discrepancy minimization via the multiplicative weight update method
Avi Levy, Harishchandra Ramadas, and Thomas Rothvoss · 2017
Closest in time.
Tighter bounds for the discrepancy of boxes and polytopes
Aleksandar Nikolov · 2017
Closest in time.