Fetching the paper…
Reading the bibliography…
We study a unified approach and algorithm for constructive discrepancy minimization based on a stochastic process.
Roth’s 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.
Extremal properties of orthogonal parallelepipeds and their applications to the geometry of banach spaces
Efim Davydovich Gluskin · 1989
Earlier work this paper cites.
Discrepancy theory
József Beck · 1995
Earlier work this paper cites.
Balancing vectors and gaussian measures of n n -dimensional convex bodies
Wojciech Banaszczyk · 1998
Earlier work this paper cites.
Geometric discrepancy: An illustrated guide
Jiri Matousek · 1999
Earlier work this paper cites.
The discrepancy method: randomness and complexity
Bernard Chazelle · 2001
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.
The determinant bound for discrepancy is almost tight
Jiri Matousek · 2013
Cited alongside, same era.
Integer feasibility of random polytopes: random integer programs
Karthekeyan Chandrasekaran and Santosh S Vempala · 2014
Cited alongside, same era.
Discrepancy without partial colorings
Nicholas Harvey, Roy Schwartz, and Mohit Singh · 2014
Cited alongside, same era.
Constructive discrepancy minimization by walking on the edges
Shachar Lovett and Raghu Meka · 2015
Cited alongside, same era.
Combinatorial discrepancy for boxes via the γ 2 \gamma_{2} norm
Jiri Matousek and Aleksandar Nikolov · 2015
Cited alongside, same era.
Efficient algorithms for discrepancy minimization in convex sets
Ronen Eldan and Mohit Singh · 2018
Later among the works it cites.
High-dimensional probability: An introduction with applications in data science
Roman Vershynin · 2018
Later among the works it cites.
An algorithm for Komlós conjecture matching Banaszczyk’s bound
Nikhil Bansal, Daniel Dadush, and Shashwat Garg · 2019
Later among the works it cites.
The Gram-Schmidt walk: A cure for the Banaszczyk blues
Nikhil Bansal, Daniel Dadush, Shashwat Garg, and Shachar Lovett · 2019
Later among the works it cites.
On the beck-fiala conjecture for random set systems
Esther Ezra and Shachar Lovett · 2019
Later among the works it cites.
A fourier-analytic approach for the discrepancy of random set systems
Rebecca Hoberg and Thomas Rothvoss · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Algorithmic discrepancy beyond partial coloring
Nikhil Bansal and Shashwat Garg · 2017
Cited alongside, same era.
Deterministic discrepancy minimization via the multiplicative weight update method
Avi Levy, Harishchandra Ramadas, and Thomas Rothvoss · 2017
Cited alongside, same era.
Constructive discrepancy minimization for convex sets
Thomas Rothvoss · 2017
Cited alongside, same era.
On the discrepancy of random low degree set systems
Nikhil Bansal and Raghu Meka · 2020
Later among the works it cites.
A spectral bound on hypergraph discrepancy
Aditya Potukuchi · 2020
Later among the works it cites.
The discrepancy of random rectangular matrices
Dylan J Altschuler and Jonathan Niles-Weed · 2021
Later among the works it cites.