Остановите войну!
for scientists:
default search action
Joel H. Spencer
- > Home > Persons > Joel H. Spencer
Publications
- 2013
- [p2]Joel Spencer:
Erdős Magic. The Mathematics of Paul Erdős I 2013: 43-46 - [p1]Joel Spencer:
The Erdős Existence Argument. The Mathematics of Paul Erdős I 2013: 435-444 - 2010
- [j105]Joel Spencer:
Phase transitions for random structures and algorithms. Random Struct. Algorithms 36(1): 1-4 (2010) - 2005
- [c15]Joel Spencer:
Erdös Magic. FSTTCS 2005: 106 - 2003
- [c13]Joel Spencer:
LIAR! COCOON 2003: 1-2 - 2002
- [c11]Joel Spencer:
Erdős Magic. LATIN 2002: 3 - 1998
- [j70]Joel Spencer:
A Useful Elementary Correlation Inequality, II. J. Comb. Theory, Ser. A 84(1): 95-98 (1998) - 1997
- [j68]Joel H. Spencer:
Real time asymptotic packing. Electron. J. Comb. 4(2) (1997) - 1995
- [j63]Joel Spencer:
Asymptotic Packing via a Branching Process. Random Struct. Algorithms 7(2): 167-172 (1995) - 1994
- [j62]Joel Spencer:
From Erdös to algorithms. Discret. Math. 136(1-3): 295-307 (1994) - [j59]Joel Spencer:
Randomization, Derandomization and Antirandomization: Three Games. Theor. Comput. Sci. 131(2): 415-429 (1994) - 1993
- [j57]Joel Spencer:
Zero-One Laws with Variable Probability. J. Symb. Log. 58(1): 1-14 (1993) - 1992
- [j54]Joel Spencer:
Ulam's Searching Game with a Fixed Number of Lies. Theor. Comput. Sci. 95(2): 307-321 (1992) - [c5]Joel Spencer:
The Probabilistic Method. SODA 1992: 41-47 - 1991
- [j52]Joel Spencer:
Threshold spectra via the Ehrenfeucht game. Discret. Appl. Math. 30(2-3): 235-252 (1991) - 1990
- [j50]Joel Spencer:
Infinite spectra in the first order theory of graphs. Comb. 10(1): 95-102 (1990) - [j48]Joel H. Spencer:
Threshold functions for extension statements. J. Comb. Theory, Ser. A 53(2): 286-305 (1990) - [j47]Joel H. Spencer:
Counting extensions. J. Comb. Theory, Ser. A 55(2): 247-255 (1990) - [j45]Joel Spencer:
Countable Sparse Random Graphs. Random Struct. Algorithms 1(2): 205-214 (1990) - 1989
- [j44]Joel Spencer:
Coloring the projective plane. Discret. Math. 73(1-2): 213-220 (1989) - 1988
- [j38]Joel H. Spencer:
Three hundred million points suffice. J. Comb. Theory, Ser. A 49(2): 210-217 (1988) - [c3]Joel Spencer:
The design of a resilient network concentrator. ICCC 1988: 518-523 - 1986
- [j33]Joel Spencer:
Balancing vectors in the max norm. Comb. 6(1): 55-66 (1986) - 1985
- [j29]Joel Spencer:
Probabilistic methods. Graphs Comb. 1(1): 357-382 (1985) - 1983
- [j25]Joel Spencer:
What's not inside a Cayley graph. Comb. 3(2): 239-241 (1983) - [j23]Joel Spencer:
Canonical Configurations. J. Comb. Theory, Ser. A 34(3): 325-330 (1983) - [j22]Joel Spencer:
Ramsey theory and Ramsey theoreticians. J. Graph Theory 7(1): 15-23 (1983) - 1981
- [j20]Joel Spencer:
Suresums. Comb. 1(2): 203-208 (1981) - [j19]Joel Spencer:
Extremal problems, partition theorems, symmetric hypergraphs. Comb. 1(3): 303-307 (1981) - [j18]Joel Spencer:
Discrete Ham Sandwich Theorems. Eur. J. Comb. 2(3): 291-298 (1981) - [j17]Joel Spencer:
Coloring n-Sets Red and Blue. J. Comb. Theory, Ser. A 30(1): 112-113 (1981) - [j16]Joel Spencer:
Balancing Unit Vectors. J. Comb. Theory, Ser. A 30(3): 349-350 (1981) - 1979
- [j14]Joel Spencer:
All Finite Configurations are Almost Ramsey. J. Comb. Theory, Ser. A 27(3): 401-403 (1979) - 1977
- [j11]Joel Spencer:
Asymptotic lower bounds for Ramsey functions. Discret. Math. 20: 69-76 (1977) - [j10]Joel Spencer:
Balancing games. J. Comb. Theory, Ser. B 23(1): 68-74 (1977) - 1975
- [j8]Joel Spencer:
Ramsey's Theorem - A New Lower Bound. J. Comb. Theory, Ser. A 18(1): 108-115 (1975) - [j7]Joel Spencer:
Restricted Ramsey Configurations. J. Comb. Theory, Ser. A 19(3): 278-286 (1975) - 1974
- [j6]Joel Spencer:
Puncture Sets. J. Comb. Theory, Ser. A 17(3): 329-336 (1974) - 1972
- [j3]Joel Spencer:
Turán's theorem for k-graphs. Discret. Math. 2(2): 183-186 (1972) - 1971
- [j2]Joel H. Spencer:
Optimal ranking of tournaments. Networks 1(2): 135-138 (1971)
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 2023-10-02 01:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint