2 papers
math.NT2007
Discrepancy of Sums of two Arithmetic Progressions
Nils Hebbinghaus
Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theor…
cs.DM2006
Improved Bounds and Schemes for the Declustering Problem
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Usi…