Joel H. Spencer

Joel Spencer, Madhu Sudan, Kuang Xu: Queueing with Future Information. CoRR abs/1211.0618 (2012)

Juliana Freire, Joel Spencer: Proppian random walks in Z. Discrete Mathematics 311(5): 349-361 (2011)

Nikhil Bansal, Joel Spencer: Deterministic Discrepancy Minimization. ESA 2011: 408-420

Abraham Neyman, Joel Spencer: Complexity and effective prediction. Games and Economic Behavior 69(1): 165-168 (2010)

Joel Spencer: Phase transitions for random structures and algorithms. Random Struct. Algorithms 36(1): 1-4 (2010)

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)

Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic random walks on regular trees. Random Struct. Algorithms 37(3): 353-366 (2010)

Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger: Synchrony and Asynchrony in Neural Networks. SODA 2010: 949-964

Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic Random Walks on Regular Trees. CoRR abs/1006.1441 (2010)

Joel H. Spencer, Katherine St. John: The complexity of random ordered structures. Ann. Pure Appl. Logic 152(1-3): 174-179 (2008)

Joel Spencer, C. R. Subramanian: On the Size of Induced Acyclic Subgraphs in Random Digraphs. Discrete Mathematics & Theoretical Computer Science 10(2) (2008)

Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic random walks on regular trees. SODA 2008: 766-772

Joel H. Spencer, Nicholas C. Wormald: Birth control for giants. Combinatorica 27(5): 587-628 (2007)

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. Combinatorics, Probability & Computing 16(3): 375-400 (2007)

Svante Janson, Joel Spencer: A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. Combinatorics, Probability & Computing 16(4): 631-658 (2007)

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)

Oleg Pikhurko, Joel Spencer, Oleg Verbitsky: Decomposable graphs and definitions with no quantifier alternation. Eur. J. Comb. 28(8): 2264-2283 (2007)

Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic Random Walks on Regular Trees. Electronic Notes in Discrete Mathematics 29: 509-513 (2007)

Oleg Pikhurko, Joel Spencer, Oleg Verbitsky: Succinct definitions in the first order theory of graphs. Ann. Pure Appl. Logic 139(1-3): 74-109 (2006)

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. Combinatorica 26(4): 395-410 (2006)

Joshua N. Cooper, Joel Spencer: Simulating a Random Walk with Constant Error. Combinatorics, Probability & Computing 15(6): 815-822 (2006)

Remco van der Hofstad, Joel Spencer: Counting connected graphs asymptotically. Eur. J. Comb. 27(8): 1294-1320 (2006)

Joel H. Spencer, Katherine St. John: The Complexity of Random Ordered Structures. Electr. Notes Theor. Comput. Sci. 143: 197-206 (2006)

Joshua N. Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos: Deterministic Random Walks. ANALCO 2006: 185-197

Ioana Dumitriu, Joel H. Spencer: The Liar Game Over an Arbitrary Channel. Combinatorica 25(5): 537-559 (2005)

Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó: Discrepancy Games. Electr. J. Comb. 12 (2005)

Roberto Imbuzeiro Oliveira, Joel H. Spencer: Connectivity Transitions in Networks with Super-Linear Preferential Attachment. Internet Mathematics 2(2): 121-163 (2005)

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)

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)

Ioana Dumitriu, Joel H. Spencer: The Two-Batch Liar Game over an Arbitrary Channel. SIAM J. Discrete Math. 19(4): 1056-1064 (2005)

Joel Spencer: Erdös Magic. FSTTCS 2005: 106

Michael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer: A Scaling Result for Explosive Processes. Electr. J. Comb. 11(1) (2004)

Ioana Dumitriu, Joel Spencer: A Halfliar's game. Theor. Comput. Sci. 303(3): 353-369 (2004)

Joel Spencer, Catherine H. Yan: The halflie problem. J. Comb. Theory, Ser. A 103(1): 69-89 (2003)

Joel Spencer: LIAR! COCOON 2003: 1-2

Jeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson: Counting dyadic equipartitions of the unit square. Discrete Mathematics 257(2-3): 481-499 (2002)

Svante Janson, Dana Randall, Joel Spencer: Random dyadic tilings of the unit square. Random Struct. Algorithms 21(3-4): 225-251 (2002)

Joel Spencer, Géza Tóth: Crossing numbers of random graphs. Random Struct. Algorithms 21(3-4): 347-358 (2002)

Yevgeniy Dodis, Joel Spencer: On the (non)Universality of the One-Time Pad. FOCS 2002: 376-

Joel Spencer: Erdos Magic. LATIN 2002: 3

Joel H. Spencer, Katherine St. John: The Tenacity of Zero-One Laws. Electr. J. Comb. 8(2) (2001)

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)

Joel Spencer, Gábor Tardos: Ups and Downs of First Order Sentences on Random Graphs. Combinatorica 20(2): 263-280 (2000)

Noga Alon, Miklós Bóna, Joel Spencer: Packing Ferrers Shapes. Combinatorics, Probability & Computing 9(3): 205-211 (2000)

János Pach, Joel Spencer, Géza Tóth: New Bounds on Crossing Numbers. Discrete & Computational Geometry 24(4): 623-644 (2000)

Michal Karonski, Joel Spencer: Ten Years! Random Struct. Algorithms 16(1): 1-3 (2000)

Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler: Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297

János Pach, Joel Spencer: Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. Combinatorica 19(1): 111-124 (1999)

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)

János Pach, Joel Spencer, Géza Tóth: New Bounds on Crossing Numbers. Symposium on Computational Geometry 1999: 124-133

Joel Spencer: A Useful Elementary Correlation Inequality, II. J. Comb. Theory, Ser. A 84(1): 95-98 (1998)

Joel Spencer, Katherine St. John: Random unary predicates: Almost sure theories and countable models. Random Struct. Algorithms 13(3-4): 229-248 (1998)

Joel Spencer, Katherine St. John: Random Sparse Bit Strings at the Threshold of Adjacency. STACS 1998: 94-104

Joel H. Spencer: Real time asymptotic packing. Electr. J. Comb. 4(2) (1997)

Boris 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)

Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer: Asymptotically Optimal Covering Designs. J. Comb. Theory, Ser. A 75(2): 270-280 (1996)

Noga Alon, Joel Spencer, Prasad Tetali: Covering with Latin Transversals. Discrete Applied Mathematics 57(1): 1-10 (1995)

Avrim Blum, Joel Spencer: Coloring Random and Semi-Random k-Colorable Graphs. J. Algorithms 19(2): 204-234 (1995)

Joel Spencer: Asymptotic Packing via a Branching Process. Random Struct. Algorithms 7(2): 167-172 (1995)

Joel Spencer: From Erdös to algorithms. Discrete Mathematics 136(1-3): 295-307 (1994)

Saharon Shelah, Joel Spencer: Can You Feel the Double Jump? Random Struct. Algorithms 5(1): 191-204 (1994)

Saharon Shelah, Joel Spencer: Random Sparse Unary Predicates. Random Struct. Algorithms 5(3): 375-394 (1994)

Joel Spencer: Randomization, Derandomization and Antirandomization: Three Games. Theor. Comput. Sci. 131(2): 415-429 (1994)

Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West: Clique coverings of the edges of a random graph. Combinatorica 13(1): 1-5 (1993)

Joel Spencer: Zero-One Laws with Variable Probability. J. Symb. Log. 58(1): 1-14 (1993)

Noga Alon, Joel Spencer: The Probabilistic Method. John Wiley 1992, isbn 0-471-53588-5

Joel Spencer, Peter Winkler: Three Thresholds for a Liar. Combinatorics, Probability & Computing 1: 81-93 (1992)

Svante Janson, Joel Spencer: Probabilistic Construction of Proportional Graphs. Random Struct. Algorithms 3(2): 127-138 (1992)

Joel Spencer: Ulam's Searching Game with a Fixed Number of Lies. Theor. Comput. Sci. 95(2): 307-321 (1992)

Joel Spencer: The Probabilistic Method. SODA 1992: 41-47

Paul Erdös, Joel Spencer: Lopsided Lovász Local Lemma and Latin transversals. Discrete Applied Mathematics 30(2-3): 151-154 (1991)

Joel Spencer: Threshold spectra via the Ehrenfeucht game. Discrete Applied Mathematics 30(2-3): 235-252 (1991)

Noga Alon, Daniel J. Kleitman, Richard Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer: Set systems with no union of cardinality 0 modulom. Graphs and Combinatorics 7(2): 97-99 (1991)

Joel Spencer: Infinite spectra in the first order theory of graphs. Combinatorica 10(1): 95-102 (1990)

János Pach, Joel H. Spencer: Note on vertex-partitions of infinite graphs. Discrete Mathematics 79(1): 107-108 (1990)

Joel H. Spencer: Threshold functions for extension statements. J. Comb. Theory, Ser. A 53(2): 286-305 (1990)

Joel H. Spencer: Counting extensions. J. Comb. Theory, Ser. A 55(2): 247-255 (1990)

László Babai, Miklós Simonovits, Joel Spencer: Extremal subgraphs of random graphs. Journal of Graph Theory 14(5): 599-622 (1990)

Joel Spencer: Countable Sparse Random Graphs. Random Struct. Algorithms 1(2): 205-214 (1990)

Joel Spencer: Coloring the projective plane. Discrete Mathematics 73(1-2): 213-220 (1989)

Paul Erdös, Joel H. Spencer: Monochromatic sumsets. J. Comb. Theory, Ser. A 50(1): 162-163 (1989)

Ravi Boppona, Joel H. Spencer: A useful elementary correlation inequality. J. Comb. Theory, Ser. A 50(2): 305-307 (1989)

Nicholas Pippenger, Joel H. Spencer: Asymptotic behavior of the chromatic index for hypergraphs. J. Comb. Theory, Ser. A 51(1): 24-42 (1989)

Noga Alon, Joel H. Spencer: Ascending waves. J. Comb. Theory, Ser. A 52(2): 275-287 (1989)

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)

Joel H. Spencer: Three hundred million points suffice. J. Comb. Theory, Ser. A 49(2): 210-217 (1988)

Paul Erdös, Mark Goldberg, János Pach, Joel Spencer: Cutting a graph into two dissimilar halves. Journal of Graph Theory 12(1): 121-131 (1988)

Svatopluk Poljak, Vojtech Rödl, Joel Spencer: Tournament Ranking with Expected Profit in Polynomial Time. SIAM J. Discrete Math. 1(3): 372-376 (1988)

János Pach, Joel Spencer: Explicit codes with low covering radius. IEEE Transactions on Information Theory 34(5): 1281-1285 (1988)

Joel Spencer: The design of a resilient network concentrator. ICCC 1988: 518-523

Eli Shamir, Joel Spencer: Sharp concentration of the chromatic number on random graphs G_{n, p}. Combinatorica 7(1): 121-129 (1987)

Saharon Shelah, Joel Spencer: Threshold Spectra for Random Graphs. STOC 1987: 421-424

Joel Spencer: Balancing vectors in the max norm. Combinatorica 6(1): 55-66 (1986)

Zbigniew Palka, Andrzej Rucinski, Joel Spencer: On a method for random graphs. Discrete Mathematics 61(2-3): 253-258 (1986)

Joel Spencer: Probabilistic methods. Graphs and Combinatorics 1(1): 357-382 (1985)

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)

József Beck, Joel Spencer: Unit Distances. J. Comb. Theory, Ser. A 37(3): 231-238 (1984)

Joel Spencer: What's not inside a Cayley graph. Combinatorica 3(2): 239-241 (1983)

József Beck, Joel Spencer: Balancing matrices with line shifts. Combinatorica 3(3): 299-304 (1983)

Joel Spencer: Canonical Configurations. J. Comb. Theory, Ser. A 34(3): 325-330 (1983)

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)

Joel Spencer: Suresums. Combinatorica 1(2): 203-208 (1981)

Joel Spencer: Extremal problems, partition theorems, symmetric hypergraphs. Combinatorica 1(3): 303-307 (1981)

Joel Spencer: Coloring n-Sets Red and Blue. J. Comb. Theory, Ser. A 30(1): 112-113 (1981)

Joel Spencer: Balancing Unit Vectors. J. Comb. Theory, Ser. A 30(3): 349-350 (1981)

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)

Joel Spencer: All Finite Configurations are Almost Ramsey. J. Comb. Theory, Ser. A 27(3): 401-403 (1979)

John E. Olson, Joel H. Spencer: Balancing Families of Sets. J. Comb. Theory, Ser. A 25(1): 29-37 (1978)

Norbert Sauer, Joel Spencer: Edge disjoint placement of graphs. J. Comb. Theory, Ser. B 25(3): 295-302 (1978)

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

Joel Spencer: Balancing games. J. Comb. Theory, Ser. B 23(1): 68-74 (1977)

Joel Spencer: Ramsey's Theorem - A New Lower Bound. J. Comb. Theory, Ser. A 18(1): 108-115 (1975)

Joel Spencer: Restricted Ramsey Configurations. J. Comb. Theory, Ser. A 19(3): 278-286 (1975)

Joel Spencer: Puncture Sets. J. Comb. Theory, Ser. A 17(3): 329-336 (1974)

Paul Erdös, Ronald L. Graham, P. Montgomery, B. L. Rothschild, Joel Spencer, Ernst G. Straus: Euclidean Ramsey Theorems I. J. Comb. Theory, Ser. A 14(3): 341-363 (1973)

Paul Erdös, Joel H. Spencer: Imbalances in k-colorations. Networks 1(4): 379-385 (1971)