Остановите войну!
for scientists:
default search action
Joel H. Spencer
- > Home > Persons > Joel H. Spencer
Publications
- 2020
- [j114]Nikhil Bansal, Joel H. Spencer:
On-line balancing of random inputs. Random Struct. Algorithms 57(4): 879-891 (2020) - 2019
- [j113]Alexander E. Holroyd, Avi Levy, Moumanti Podder, Joel Spencer:
Existential monadic second order logic on random rooted trees. Discret. Math. 342(1): 152-167 (2019) - [i4]Nikhil Bansal, Joel H. Spencer:
On-Line Balancing of Random Inputs. CoRR abs/1903.06898 (2019) - 2018
- [i3]Svante Janson, Subhabrata Sen, Joel Spencer:
Preferential Attachment When Stable. CoRR abs/1805.10653 (2018) - 2016
- [j112]Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer:
On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. 25(1): 89-107 (2016) - [j111]Joel H. Spencer, Maksim E. Zhukovskii:
Bounded quantifier depth spectra for random graphs. Discret. Math. 339(6): 1651-1664 (2016) - 2013
- [j110]Nikhil Bansal, Joel Spencer:
Deterministic Discrepancy Minimization. Algorithmica 67(4): 451-471 (2013) - [j109]Mihyun Kang, Will Perkins, Joel Spencer:
The Bohman-Frieze process near criticality. Random Struct. Algorithms 43(2): 221-250 (2013) - [j108]Joel Spencer, Madhu Sudan, Kuang Xu:
Queueing with future information. SIGMETRICS Perform. Evaluation Rev. 41(3): 40-42 (2013) - 2012
- [i2]Joel Spencer, Madhu Sudan, Kuang Xu:
Queueing with Future Information. CoRR abs/1211.0618 (2012) - 2011
- [c19]Nikhil Bansal, Joel Spencer:
Deterministic Discrepancy Minimization. ESA 2011: 408-420 - 2010
- [j104]Remco van der Hofstad, Malwina J. Luczak, Joel Spencer:
The second largest component in the supercritical 2D Hamming graph. Random Struct. Algorithms 36(1): 80-89 (2010) - [j103]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic random walks on regular trees. Random Struct. Algorithms 37(3): 353-366 (2010) - [c18]Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger:
Synchrony and Asynchrony in Neural Networks. SODA 2010: 949-964 - [i1]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic Random Walks on Regular Trees. CoRR abs/1006.1441 (2010) - 2008
- [b4]Noga Alon, Joel H. Spencer:
The Probabilistic Method, Third Edition. Wiley-Interscience series in discrete mathematics and optimization, Wiley 2008, ISBN 978-0-470-17020-5, pp. I-XV, 1-352 - [c17]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic random walks on regular trees. SODA 2008: 766-772 - 2007
- [b3]Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein:
Finite Model Theory and Its Applications. Texts in Theoretical Computer Science. An EATCS Series, Springer 2007, ISBN 978-3-540-00428-8, pp. 1-437 - [j100]Joel H. Spencer, Nicholas C. Wormald:
Birth control for giants. Comb. 27(5): 587-628 (2007) - [j99]Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky:
First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. 16(3): 375-400 (2007) - [j98]Svante Janson, Joel Spencer:
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. Comb. Probab. Comput. 16(4): 631-658 (2007) - [j97]Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos:
Deterministic random walks on the integers. Eur. J. Comb. 28(8): 2072-2090 (2007) - [j96]Oleg Pikhurko, Joel Spencer, Oleg Verbitsky:
Decomposable graphs and definitions with no quantifier alternation. Eur. J. Comb. 28(8): 2264-2283 (2007) - [j95]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic Random Walks on Regular Trees. Electron. Notes Discret. Math. 29: 509-513 (2007) - 2006
- [j94]Oleg Pikhurko, Joel Spencer, Oleg Verbitsky:
Succinct definitions in the first order theory of graphs. Ann. Pure Appl. Log. 139(1-3): 74-109 (2006) - [j93]Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer:
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube. Comb. 26(4): 395-410 (2006) - [j92]Joshua N. Cooper, Joel Spencer:
Simulating a Random Walk with Constant Error. Comb. Probab. Comput. 15(6): 815-822 (2006) - [j91]Remco van der Hofstad, Joel Spencer:
Counting connected graphs asymptotically. Eur. J. Comb. 27(8): 1294-1320 (2006) - [c16]Joshua N. Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos:
Deterministic Random Walks. ANALCO 2006: 185-197 - 2005
- [j90]Ioana Dumitriu, Joel H. Spencer:
The Liar Game Over an Arbitrary Channel. Comb. 25(5): 537-559 (2005) - [j89]Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó:
Discrepancy Games. Electron. J. Comb. 12 (2005) - [j88]Roberto Imbuzeiro Oliveira, Joel H. Spencer:
Connectivity Transitions in Networks with Super-Linear Preferential Attachment. Internet Math. 2(2): 121-163 (2005) - [j87]Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky:
How complex are random graphs in first order logic? Random Struct. Algorithms 26(1-2): 119-145 (2005) - [j86]Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel H. Spencer:
Random subgraphs of finite graphs: I. The scaling window under the triangle condition. Random Struct. Algorithms 27(2): 137-184 (2005) - [j85]Ioana Dumitriu, Joel H. Spencer:
The Two-Batch Liar Game over an Arbitrary Channel. SIAM J. Discret. Math. 19(4): 1056-1064 (2005) - 2004
- [j84]Michael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer:
A Scaling Result for Explosive Processes. Electron. J. Comb. 11(1) (2004) - [j83]Ioana Dumitriu, Joel Spencer:
A Halfliar's game. Theor. Comput. Sci. 313(3): 353-369 (2004) - 2003
- [j82]Joel Spencer, Catherine H. Yan:
The halflie problem. J. Comb. Theory, Ser. A 103(1): 69-89 (2003) - 2002
- [j81]Jeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson:
Counting dyadic equipartitions of the unit square. Discret. Math. 257(2-3): 481-499 (2002) - [j80]Svante Janson, Dana Randall, Joel Spencer:
Random dyadic tilings of the unit square. Random Struct. Algorithms 21(3-4): 225-251 (2002) - [j79]Joel Spencer, Géza Tóth:
Crossing numbers of random graphs. Random Struct. Algorithms 21(3-4): 347-358 (2002) - [c12]Yevgeniy Dodis, Joel Spencer:
On the (non)Universality of the One-Time Pad. FOCS 2002: 376- - 2001
- [j77]Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor E. Tusnády:
The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3): 279-290 (2001) - 2000
- [b2]Noga Alon, Joel H. Spencer:
The Probabilistic Method, Second Edition. John Wiley 2000, ISBN 978-0-47137046-8 - [j76]Joel Spencer, Gábor Tardos:
Ups and Downs of First Order Sentences on Random Graphs. Comb. 20(2): 263-280 (2000) - [j75]Noga Alon, Miklós Bóna, Joel Spencer:
Packing Ferrers Shapes. Comb. Probab. Comput. 9(3): 205-211 (2000) - [j74]János Pach, Joel Spencer, Géza Tóth:
New Bounds on Crossing Numbers. Discret. Comput. Geom. 24(4): 623-644 (2000) - [j73]Michal Karonski, Joel Spencer:
Ten Years! Random Struct. Algorithms 16(1): 1-3 (2000) - [c10]Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler:
Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297 - 1999
- [j72]János Pach, Joel Spencer:
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. Comb. 19(1): 111-124 (1999) - [j71]Christian Borgs, Jennifer T. Chayes, Harry Kesten, Joel Spencer:
Uniform boundedness of critical crossing probabilities implies hyperscaling. Random Struct. Algorithms 15(3-4): 368-413 (1999) - [c9]János Pach, Joel Spencer, Géza Tóth:
New Bounds on Crossing Numbers. SCG 1999: 124-133 - 1997
- [c7]Joel Spencer, Lubos Thoma:
On the limit values of probabilities for the first order properties of graphs. Contemporary Trends in Discrete Mathematics 1997: 317-336 - 1996
- [j67]Boris G. Pittel, Joel Spencer, Nicholas C. Wormald:
Sudden Emergence of a Giantk-Core in a Random Graph. J. Comb. Theory, Ser. B 67(1): 111-151 (1996) - [j66]Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer:
Asymptotically Optimal Covering Designs. J. Comb. Theory, Ser. A 75(2): 270-280 (1996) - 1995
- [j65]Noga Alon, Joel Spencer, Prasad Tetali:
Covering with Latin Transversals. Discret. Appl. Math. 57(1): 1-10 (1995) - [j64]Avrim Blum, Joel Spencer:
Coloring Random and Semi-Random k-Colorable Graphs. J. Algorithms 19(2): 204-234 (1995) - [c6]Ravi Bopu Boppana, Joel Spencer:
Smoothness laws for random ordered graphs. Logic and Random Structures 1995: 15-32 - 1994
- [j61]Saharon Shelah, Joel Spencer:
Can You Feel the Double Jump? Random Struct. Algorithms 5(1): 191-204 (1994) - [j60]Saharon Shelah, Joel Spencer:
Random Sparse Unary Predicates. Random Struct. Algorithms 5(3): 375-394 (1994) - 1993
- [j58]Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West:
Clique coverings of the edges of a random graph. Comb. 13(1): 1-5 (1993) - 1992
- [b1]Noga Alon, Joel Spencer:
The Probabilistic Method. John Wiley 1992, ISBN 0-471-53588-5 - [j56]Joel Spencer, Peter Winkler:
Three Thresholds for a Liar. Comb. Probab. Comput. 1: 81-93 (1992) - [j55]Svante Janson, Joel Spencer:
Probabilistic Construction of Proportional Graphs. Random Struct. Algorithms 3(2): 127-138 (1992) - 1991
- [j53]Paul Erdös, Joel Spencer:
Lopsided Lovász Local Lemma and Latin transversals. Discret. Appl. Math. 30(2-3): 151-154 (1991) - [j51]Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer:
Set systems with no union of cardinality 0 modulom. Graphs Comb. 7(2): 97-99 (1991) - 1990
- [j49]János Pach, Joel H. Spencer:
Note on vertex-partitions of infinite graphs. Discret. Math. 79(1): 107-108 (1990) - [j46]László Babai, Miklós Simonovits, Joel Spencer:
Extremal subgraphs of random graphs. J. Graph Theory 14(5): 599-622 (1990) - [c4]Paul Erdös, Endre Makai, János Pach, Joel H. Spencer:
Gaps in Difference Sets, and the Graph of Nearly Equal Distances. Applied Geometry And Discrete Mathematics 1990: 265-274 - 1989
- [j43]Paul Erdös, Joel H. Spencer:
Monochromatic sumsets. J. Comb. Theory, Ser. A 50(1): 162-163 (1989) - [j41]Nicholas Pippenger, Joel H. Spencer:
Asymptotic behavior of the chromatic index for hypergraphs. J. Comb. Theory, Ser. A 51(1): 24-42 (1989) - [j40]Noga Alon, Joel H. Spencer:
Ascending waves. J. Comb. Theory, Ser. A 52(2): 275-287 (1989) - 1988
- [j39]Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer:
How to make a graph bipartite. J. Comb. Theory, Ser. B 45(1): 86-98 (1988) - [j37]Paul Erdös, Mark Goldberg, János Pach, Joel Spencer:
Cutting a graph into two dissimilar halves. J. Graph Theory 12(1): 121-131 (1988) - [j36]Svatopluk Poljak, Vojtech Rödl, Joel Spencer:
Tournament Ranking with Expected Profit in Polynomial Time. SIAM J. Discret. Math. 1(3): 372-376 (1988) - [j35]János Pach, Joel Spencer:
Explicit codes with low covering radius. IEEE Trans. Inf. Theory 34(5): 1281-1285 (1988) - 1987
- [j34]Eli Shamir, Joel Spencer:
Sharp concentration of the chromatic number on random graphs Gn, p. Comb. 7(1): 121-129 (1987) - [c2]Saharon Shelah, Joel Spencer:
Threshold Spectra for Random Graphs. STOC 1987: 421-424 - 1986
- [j32]Zbigniew Palka, Andrzej Rucinski, Joel Spencer:
On a method for random graphs. Discret. Math. 61(2-3): 253-258 (1986) - [j31]László Lovász, Joel Spencer, Katalin Vesztergombi:
Discrepancy of Set-systems and Matrices. Eur. J. Comb. 7(2): 151-160 (1986) - [j30]A. Robert Calderbank, Peter C. Fishburn, Joel H. Spencer:
Functions that Never Agree. Eur. J. Comb. 7(3): 207-210 (1986) - 1985
- [j28]Fan R. K. Chung, Paul Erdös, Joel H. Spencer:
Extremal subgraphs for two graphs. J. Comb. Theory, Ser. B 38(3): 248-260 (1985) - 1982
- [j21]Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi:
Extremal Uncrowded Hypergraphs. J. Comb. Theory, Ser. A 32(3): 321-335 (1982) - 1980
- [j15]Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer:
Coping with Errors in Binary Search Procedures. J. Comput. Syst. Sci. 20(3): 396-404 (1980) - 1978
- [j12]Norbert Sauer, Joel Spencer:
Edge disjoint placement of graphs. J. Comb. Theory, Ser. B 25(3): 295-302 (1978) - [c1]Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer:
Coping with Errors in Binary Search Procedures (Preliminary Report). STOC 1978: 227-232 - 1973
- [j5]Daniel J. Kleitman, Joel H. Spencer:
Families of k-independent sets. Discret. Math. 6(3): 255-262 (1973) - [j4]Paul Erdös, Ronald L. Graham, Peter Montgomery, Bruce Lee Rothschild, Joel Spencer, Ernst G. Straus:
Euclidean Ramsey Theorems I. J. Comb. Theory, Ser. A 14(3): 341-363 (1973) - 1971
- [j1]Paul Erdös, Joel H. Spencer:
Imbalances in k-colorations. Networks 1(4): 379-385 (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-01 22:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint