József Beck

According to our database1, József Beck authored at least 38 papers between 1980 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
On two theorems of positional games.
Period. Math. Hung., 2019

2017
Recurrence of inhomogeneous random walks.
Period. Math. Hung., 2017

2014
Strong uniformity.
Proceedings of the Uniform Distribution and Quasi-Monte Carlo Methods, 2014

2013
Games, Randomness and Algorithms.
Proceedings of the Mathematics of Paul Erdős I, 2013

2011
Randomness of the square root of 2 and the giant leap, part 2.
Period. Math. Hung., 2011

2010
Randomness of the square root of 2 and the Giant Leap, Part 1.
Period. Math. Hung., 2010

2004
Geometric Discrepancy Theory Anduniform Distribution.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2002
On the Uniform Distribution of Inverses modulo n.
Period. Math. Hung., 2002

Ramsey games.
Discret. Math., 2002

Positional Games and the Second Moment Method.
Comb., 2002

Efficient proper 2-coloring of almost disjoint hypergraphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Randomness in lattice point problems.
Discret. Math., 2001

1996
Foundations of positional games.
Random Struct. Algorithms, 1996

1994
Deterministic Graphs Games and a Probabilistic Intuition.
Comb. Probab. Comput., 1994

1991
An Algorithmic Approach to the Lovász Local Lemma. I.
Random Struct. Algorithms, 1991

Quasi-Random 2-Colorings of Point Sets.
Random Struct. Algorithms, 1991

1990
Parallel Matching Complexity of Ramsey's Theorem.
Proceedings of the Advances In Computational Complexity Theory, 1990

1989
Balanced two-colorings of finite sets in the cube.
Discret. Math., 1989

1988
On a lattice point problem of L. Moser II.
Comb., 1988

On a lattice point problem of L. Moser I.
Comb., 1988

1986
A 'large deviation' phenomenon in discrete geometry, I.
Discret. Math., 1986

1984
Integral approximation sequences.
Math. Program., 1984

Unit Distances.
J. Comb. Theory, Ser. A, 1984

1983
On size Ramsey number of paths, trees, and circuits. I.
Journal of Graph Theory, 1983

There is no fast method for finding monochromatic complete subgraphs.
J. Comb. Theory, Ser. B, 1983

On a Geometric Problem of Erdös, Sárkozy, and Szermerédi Concerning Vector Sums.
Eur. J. Comb., 1983

Balancing matrices with line shifts.
Comb., 1983

On the lattice property of the plane and some problems of Dirac, Motzkn and Erdös in combinatorial geometry.
Comb., 1983

1982
Variations on a Game.
J. Comb. Theory, Ser. A, 1982

On a generalization of Kaplansky's game.
Discret. Math., 1982

Irregularities of two-colourings of the NxN square lattice.
Comb., 1982

1981
On Positional Games.
J. Comb. Theory, Ser. A, 1981

"Integer-making" theorems.
Discret. Appl. Math., 1981

Balanced two-colorings of finite sets in the square I.
Comb., 1981

Roth's estimate of the discrepancy of integer sequences is nearly sharp.
Comb., 1981

Balancing families of integer sequences.
Comb., 1981

Van der Waerden and Ramsey type games.
Comb., 1981

1980
A Remark Concerning Arithmetic Progressions.
J. Comb. Theory, Ser. A, 1980


  Loading...