Bounds and constructions for the star-discrepancy via δ-covers

We give an explicit construction of low-discrepancy points with a derandomized algorithm. The running time of the algorithm, which is exponentially in d, is discussed in detail and comparisons with other methods are given.