Fetching the paper…
Reading the bibliography…
A $k$-permutation family on $n$ vertices is a set system consisting of the intervals of $k$ permutations of the integers $1$ through $n$.
On sets of consistent arcs in a tournament
P Erdős and JW Moon · 1965
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.
Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph
Venkatesan Guruswami, Rajsekar Manokaran, and Prasad Raghavendra · 2008
Cited alongside, same era.
A counterexample to Beck’s conjecture on the discrepancy of three permutations
Alantha Newman and Aleksandar Nikolov · 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.
The discrepancy of permutation families
P. Tetali J.H. Spencer, A. Srinivasan
Cited in the paper.
The determinant bound for discrepancy is almost tight
Jiří Matoušek · 2013
Later among the works it cites.
The geometry of differential privacy: the sparse and approximate cases
Aleksandar Nikolov, Kunal Talwar, and Li Zhang · 2013
Later among the works it cites.
Constructive discrepancy minimization with hereditary l2 guarantees
Kasper Green Larsen · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…