Fetching the paper…
Reading the bibliography…
The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems.
Bedingt konvergente reihen und konvexe systeme.(schluß.)
Ernst Steinitz · 1916
Earlier work this paper cites.
On tail probabilities for martingales
David A. Freedman · 1975
Earlier work this paper cites.
Value of the steinitz constant
V. S. Grinberg and S. V. Sevastjanov · 1980
Earlier work this paper cites.
Balanced two-colorings of finite sets in the square
József Beck · 1981
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.
Six standard deviations suffice
Joel Spencer · 1985
Earlier work this paper cites.
Regular hypergraphs, gordon’s lemma, steinitz’ lemma and invariant theory
N. Alon and K.A. Berman · 1986
Earlier work this paper cites.
Balanced two-colorings of finite sets in the cube
József Beck · 1989
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.
Bibliography Series of Vectors and Riemann Sums
I. Halperin and Tsuyoshi Ando · 1989
Earlier work this paper cites.
On the discrepancy of 3 permutations
Géza Bohus · 1990
Earlier work this paper cites.
Convergence as of rearranged random series in Banach space and associated inequalities
Sergej Chobanyan · 1994
Earlier work this paper cites.
On some geometric methods in scheduling theory: a survey
S.V. Sevast’janov · 1994
Earlier work this paper cites.
Improving the discrepancy bound for sparse matrices: Better approximations for sparse lattice approximation problems
Aravind Srinivasan · 1997
Earlier work this paper cites.
Balancing vectors and gaussian measures of n-dimensional convex bodies
Wojciech Banaszczyk · 1998
Cited alongside, same era.
On the discrepancy for boxes and polytopes, 1999
Jirí Matousek · 1999
Cited alongside, same era.
The discrepancy method: randomness and complexity
Bernard Chazelle · 2000
Cited alongside, same era.
On the power of linear dependencies
Imre Bárány · 2008
Cited alongside, same era.
Geometric discrepancy: An illustrated guide
Jiri Matousek · 2009
Cited alongside, same era.
Constructive algorithms for discrepancy minimization
Nikhil Bansal · 2010
Cited alongside, same era.
Iterative Methods in Combinatorial Optimization
Better algorithms and hardness for broadcast scheduling via a discrepancy approach
Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, and Shi Li · 2014
Later among the works it cites.
A Panorama of Discrepancy Theory
William Chen, Anand Srivastav, Giancarlo Travaglini, et al · 2014
Later among the works it cites.
Efficient algorithms for discrepancy minimization in convex sets
Ronen Eldan and Mohit Singh · 2014
Later among the works it cites.
Near-optimal herding
Nick Harvey and Samira Samadi · 2014
Later among the works it cites.
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
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
Vectors in a box
Kevin Buchin, Jiří Matoušek, Robin A Moser, and Dömötör Pálvölgyi · 2012
Cited alongside, same era.
The master equality polyhedron with multiple rows
Sanjeeb Dash, Ricardo Fukasawa, and Oktay Günlük · 2012
Cited alongside, same era.
Approximation algorithms and semidefinite programming
Bernd Gärtner and Jiri Matousek · 2012
Cited alongside, same era.
Constructive discrepancy minimization by walking on the edges
Shachar Lovett and Raghu Meka · 2012
Cited alongside, same era.
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.
An algorithm for komlös conjecture matching Banaszczyk’s bound
Nikhil Bansal, Daniel Dadush, and Shashwat Garg · 2016
Closest in time.
Approximation-friendly discrepancy rounding
Nikhil Bansal and Viswanath Nagarajan · 2016
Closest in time.
Towards a constructive version of banaszczyk’s vector balancing theorem
Daniel Dadush, Shashwat Garg, Shachar Lovett, and Aleksandar Nikolov · 2016
Closest in time.
Personal communication, 2016
Aleksandar Nikolov · 2016
Closest in time.