default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJózsef Beck
Person information
- affiliation: Rutgers University, Department of Mathematics, USA
- award (1985): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j33]József Beck
:
On two theorems of positional games. Period. Math. Hung. 78(1): 1-30 (2019)- 2017
- [j32]József Beck:
Recurrence of inhomogeneous random walks. Period. Math. Hung. 74(2): 137-196 (2017) - 2011
- [j31]József Beck:
Randomness of the square root of 2 and the giant leap, part 2. Period. Math. Hung. 62(2): 127-246 (2011) - 2010
- [j30]József Beck:
Randomness of the square root of 2 and the Giant Leap, Part 1. Period. Math. Hung. 60(2): 137-242 (2010) - 2002
- [j29]József Beck:
Positional Games and the Second Moment Method. Comb. 22(2): 169-216 (2002) - [j28]József Beck:
Ramsey games. Discret. Math. 249(1-3): 3-30 (2002) - [j27]József Beck, Mizan R. Khan:
On the Uniform Distribution of Inverses modulo n. Period. Math. Hung. 44(2): 147-155 (2002) - 2001
- [j26]József Beck:
Randomness in lattice point problems. Discret. Math. 229(1-3): 29-55 (2001) - 1996
- [j25]József Beck:
Foundations of positional games. Random Struct. Algorithms 9(1-2): 15-47 (1996) - 1994
- [j24]József Beck:
Deterministic Graphs Games and a Probabilistic Intuition. Comb. Probab. Comput. 3: 13-26 (1994) - 1991
- [j23]József Beck:
Quasi-Random 2-Colorings of Point Sets. Random Struct. Algorithms 2(3): 289-302 (1991) - [j22]József Beck:
An Algorithmic Approach to the Lovász Local Lemma. I. Random Struct. Algorithms 2(4): 343-366 (1991) - 1989
- [j21]József Beck:
Balanced two-colorings of finite sets in the cube. Discret. Math. 73(1-2): 13-25 (1989) - 1988
- [j20]József Beck:
On a lattice point problem of L. Moser I. Comb. 8(1): 21-47 (1988) - [j19]József Beck:
On a lattice point problem of L. Moser II. Comb. 8(2): 159-176 (1988) - 1986
- [j18]József Beck:
A 'large deviation' phenomenon in discrete geometry, I. Discret. Math. 60: 91-99 (1986) - 1984
- [j17]József Beck, Joel Spencer:
Unit Distances. J. Comb. Theory A 37(3): 231-238 (1984) - [j16]József Beck, Joel Spencer:
Integral approximation sequences. Math. Program. 30(1): 88-98 (1984) - 1983
- [j15]József Beck:
On the lattice property of the plane and some problems of Dirac, Motzkn and Erdös in combinatorial geometry. Comb. 3(3): 281-297 (1983) - [j14]József Beck, Joel Spencer:
Balancing matrices with line shifts. Comb. 3(3): 299-304 (1983) - [j13]József Beck:
On a Geometric Problem of Erdös, Sárkozy, and Szermerédi Concerning Vector Sums. Eur. J. Comb. 4(1): 1-10 (1983) - [j12]József Beck:
There is no fast method for finding monochromatic complete subgraphs. J. Comb. Theory B 34(1): 58-64 (1983) - [j11]József Beck:
On size Ramsey number of paths, trees, and circuits. I. J. Graph Theory 7(1): 115-129 (1983) - 1982
- [j10]József Beck:
Irregularities of two-colourings of the NxN square lattice. Comb. 2(2): 111-123 (1982) - [j9]József Beck:
On a generalization of Kaplansky's game. Discret. Math. 42(1): 27-35 (1982) - [j8]József Beck, László Csirmaz:
Variations on a Game. J. Comb. Theory A 33(3): 297-315 (1982) - 1981
- [j7]József Beck:
Van der Waerden and Ramsey type games. Comb. 1(2): 103-116 (1981) - [j6]József Beck:
Balancing families of integer sequences. Comb. 1(3): 209-216 (1981) - [j5]József Beck:
Roth's estimate of the discrepancy of integer sequences is nearly sharp. Comb. 1(4): 319-325 (1981) - [j4]József Beck:
Balanced two-colorings of finite sets in the square I. Comb. 1(4): 327-335 (1981) - [j3]József Beck, Tibor Fiala:
"Integer-making" theorems. Discret. Appl. Math. 3(1): 1-8 (1981) - [j2]József Beck:
On Positional Games. J. Comb. Theory A 30(2): 117-133 (1981) - 1980
- [j1]József Beck:
A Remark Concerning Arithmetic Progressions. J. Comb. Theory A 29(3): 376-379 (1980)
Conference and Workshop Papers
- 2002
- [c2]József Beck, Sachin Lodha:
Efficient proper 2-coloring of almost disjoint hypergraphs. SODA 2002: 598-605 - 1990
- [c1]József Beck:
Parallel Matching Complexity of Ramsey's Theorem. Advances In Computational Complexity Theory 1990: 39-50
Parts in Books or Collections
- 2014
- [p2]József Beck:
Strong uniformity. Uniform Distribution and Quasi-Monte Carlo Methods 2014: 17-44 - 2013
- [p1]József Beck:
Games, Randomness and Algorithms. The Mathematics of Paul Erdős I 2013: 311-342
Reference Works
- 2004
- [r1]J. Ralph Alexander, József Beck, William W. L. Chen:
Geometric Discrepancy Theory Anduniform Distribution. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 279-304
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
