Fetching the paper…
Reading the bibliography…
Consider a unit interval $[0,1]$ in which $n$ points arrive one-by-one independently and uniformly at random.
Resource allocation and the public sector
Duncan K Foley · 1967
Earlier work this paper cites.
Balancing games
Joel Spencer · 1977
Earlier work this paper cites.
Balanced two-colorings of finite sets in the square I
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.
Theories of justice based on symmetry
William Thomson and Hal Varian · 1985
Earlier work this paper cites.
Ten lectures on the probabilistic method
Joel H. Spencer · 1987
Earlier work this paper cites.
The discrepancy of permutation families
Joel H. Spencer, Aravind Srinivasan, and Prasad Tetali · 1997
Earlier work this paper cites.
Balancing vectors and Gaussian measures of n-dimensional convex bodies
Wojciech Banaszczyk · 1998
Earlier work this paper cites.
The discrepancy method: randomness and complexity
Bernard Chazelle · 2001
Earlier work this paper cites.
On approximately fair allocations of indivisible goods
Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi · 2004
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 combinatorial assignment problem: Approximate competitive equilibrium from equal incomes
Eric Budish · 2011
Cited alongside, same era.
Beck’s three permutations conjecture: A counterexample and some consequences
Alantha Newman, Ofer Neiman, and Aleksandar Nikolov · 2012
Cited alongside, same era.
Deterministic discrepancy minimization
Nikhil Bansal and Joel Spencer · 2013
Cited alongside, same era.
New computational aspects of discrepancy theory
Aleksandar Nikolov · 2014
Cited alongside, same era.
Constructive discrepancy minimization for convex sets
Thomas Rothvoß · 2014
Cited alongside, same era.
Deterministic discrepancy minimization via the multiplicative weight update method
Avi Levy, Harishchandra Ramadas, and Thomas Rothvoss · 2017
Later among the works it cites.
Tighter bounds for the discrepancy of boxes and polytopes
Aleksandar Nikolov · 2017
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 · 2018
Later among the works it cites.
How to Make Envy Vanish Over Time
Gerdus Benade, Aleksandr M. Kazachkov, Ariel D. Procaccia, and Christos-Alexandros Psomas · 2018
Later among the works it cites.
Efficient algorithms for discrepancy minimization in convex sets
Ronen Eldan and Mohit Singh · 2018
Later among the works it cites.
On the discrepancy of random matrices with many columns
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fair assignment of indivisible objects under ordinal preferences
Haris Aziz, Serge Gaspers, Simon Mackenzie, and Toby Walsh · 2015
Cited alongside, same era.
Constructive Discrepancy Minimization by Walking on the Edges
Shachar Lovett and Raghu Meka · 2015
Cited alongside, same era.
The probabilistic method
Noga Alon and Joel H Spencer · 2016
Cited alongside, same era.
An algorithm for komlós conjecture matching banaszczyk’s bound
Nikhil Bansal, Daniel Dadush, and Shashwat Garg · 2016
Cited alongside, same era.
Algorithmic discrepancy beyond partial coloring
Nikhil Bansal and Shashwat Garg · 2017
Cited alongside, same era.
A logarithmic additive integrality gap for bin packing
Rebecca Hoberg and Thomas Rothvoss · 2017
Cited alongside, same era.
Cole Franks and Michael Saks · 2018
Later among the works it cites.
Discrepancy and Combinatorial Optimization Lecture 1-IPCO summer school
Nikhil Bansal · 2019
Closest in time.
On the discrepancy of random low degree set systems
Nikhil Bansal and Raghu Meka · 2019
Closest in time.
On-line balancing of random inputs
Nikhil Bansal and Joel H. Spencer · 2019
Closest in time.
On the beck-fiala conjecture for random set systems
Esther Ezra and Shachar Lovett · 2019
Closest in time.
A Fourier-Analytic Approach for the Discrepancy of Random Set Systems
Rebecca Hoberg and Thomas Rothvoss · 2019
Closest in time.