József Beck Roth's estimate of the discrepancy of integer sequences is nearly sharp. [Citation Graph (0, 0)][DBLP] Combinatorica, 1981, v:1, n:4, pp:319-325 [Journal]
József Beck Balanced two-colorings of finite sets in the square I. [Citation Graph (0, 0)][DBLP] Combinatorica, 1981, v:1, n:4, pp:327-335 [Journal]
József Beck Irregularities of two-colourings of the NxN square lattice. [Citation Graph (0, 0)][DBLP] Combinatorica, 1982, v:2, n:2, pp:111-123 [Journal]
József Beck On the lattice property of the plane and some problems of Dirac, Motzkn and Erdös in combinatorial geometry. [Citation Graph (0, 0)][DBLP] Combinatorica, 1983, v:3, n:3, pp:281-297 [Journal]
József Beck Deterministic Graphs Games and a Probabilistic Intuition. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1994, v:3, n:, pp:13-26 [Journal]
József Beck There is no fast method for finding monochromatic complete subgraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1983, v:34, n:1, pp:58-64 [Journal]
József Beck Quasi-Random 2-Colorings of Point Sets. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1991, v:2, n:3, pp:289-302 [Journal]
József Beck An Algorithmic Approach to the Lovász Local Lemma. I. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1991, v:2, n:4, pp:343-366 [Journal]