Joel Spencer

Publication Activity (10 Years)

Years Active: 1972-2019
Publications (10 Years): 3

Top Venues

CoRR

Comb. Probab. Comput.

SIGMETRICS Perform. Evaluation Rev.

Random Struct. Algorithms

Publications

Alexander E. Holroyd, Avi Levy, Moumanti Podder, Joel Spencer
Existential monadic second order logic on random rooted trees. Discret. Math. 342 (1) (2019)
Svante Janson, Subhabrata Sen, Joel Spencer
Preferential Attachment When Stable. CoRR (2018)
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) (2016)
Nikhil Bansal, Joel Spencer
Deterministic Discrepancy Minimization. Algorithmica 67 (4) (2013)
Joel Spencer, Madhu Sudan, Kuang Xu
Queueing with future information. SIGMETRICS Perform. Evaluation Rev. 41 (3) (2013)
Mihyun Kang, Will Perkins, Joel Spencer
The Bohman-Frieze process near criticality. Random Struct. Algorithms 43 (2) (2013)
Joel Spencer, Madhu Sudan, Kuang Xu
Queueing with Future Information CoRR (2012)
Nikhil Bansal, Joel Spencer
Deterministic Discrepancy Minimization. ESA (2011)
Juliana Freire, Joel Spencer
Proppian random walks in Z. Discret. Math. 311 (5) (2011)
Abraham Neyman, Joel Spencer
Complexity and effective prediction. Games Econ. Behav. 69 (1) (2010)
Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger
Synchrony and Asynchrony in Neural Networks. SODA (2010)
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
Deterministic random walks on regular trees. Random Struct. Algorithms 37 (3) (2010)
Joel Spencer
Phase transitions for random structures and algorithms. Random Struct. Algorithms 36 (1) (2010)
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
Deterministic Random Walks on Regular Trees CoRR (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) (2010)
Joel Spencer, C. R. Subramanian
On the Size of Induced Acyclic Subgraphs in Random Digraphs. Discret. Math. Theor. Comput. Sci. 10 (2) (2008)
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
Deterministic random walks on regular trees. SODA (2008)
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
Deterministic Random Walks on Regular Trees. Electron. Notes Discret. Math. 29 (2007)
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) (2007)
Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
Decomposable graphs and definitions with no quantifier alternation. Eur. J. Comb. 28 (8) (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. Comb. Probab. Comput. 16 (3) (2007)
Joshua N. Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos
Deterministic Random Walks. ANALCO (2006)
Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
Succinct definitions in the first order theory of graphs. Ann. Pure Appl. Log. 139 (1-3) (2006)
Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer
-Cube. Comb. 26 (4) (2006)
Remco van der Hofstad, Joel Spencer
Counting connected graphs asymptotically. Eur. J. Comb. 27 (8) (2006)
Joshua N. Cooper, Joel Spencer
Simulating a Random Walk with Constant Error. Comb. Probab. Comput. 15 (6) (2006)
Joel Spencer
Erdös Magic. FSTTCS (2005)
Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó
Discrepancy Games. Electron. J. Comb. 12 (2005)
Ioana Dumitriu, Joel Spencer
A Halfliar's game. Theor. Comput. Sci. 313 (3) (2004)
Joel Spencer
LIAR! COCOON (2003)
Joel Spencer, Catherine H. Yan
The halflie problem. J. Comb. Theory, Ser. A 103 (1) (2003)
Yevgeniy Dodis, Joel Spencer
On the (non)Universality of the One-Time Pad. FOCS (2002)
Joel Spencer, Géza Tóth
Crossing numbers of random graphs. Random Struct. Algorithms 21 (3-4) (2002)
Joel Spencer
Erdős Magic. LATIN (2002)
Svante Janson, Dana Randall, Joel Spencer
Random dyadic tilings of the unit square. Random Struct. Algorithms 21 (3-4) (2002)
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) (2001)
János Pach, Joel Spencer, Géza Tóth
New Bounds on Crossing Numbers. Discret. Comput. Geom. 24 (4) (2000)
Michal Karonski, Joel Spencer
Ten Years! Random Struct. Algorithms 16 (1) (2000)
Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler
Average-Case Analysis of Retangle Packings. LATIN (2000)
Joel Spencer, Gábor Tardos
Ups and Downs of First Order Sentences on Random Graphs. Comb. 20 (2) (2000)
Noga Alon, Miklós Bóna, Joel Spencer
Packing Ferrers Shapes. Comb. Probab. Comput. 9 (3) (2000)
Christian Borgs, Jennifer T. Chayes, Harry Kesten, Joel Spencer
Uniform boundedness of critical crossing probabilities implies hyperscaling. Random Struct. Algorithms 15 (3-4) (1999)
János Pach, Joel Spencer
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. Comb. 19 (1) (1999)
János Pach, Joel Spencer, Géza Tóth
New Bounds on Crossing Numbers. SCG (1999)
Joel Spencer
A Useful Elementary Correlation Inequality, II. J. Comb. Theory, Ser. A 84 (1) (1998)
Joel Spencer, Katherine St. John
Random Sparse Bit Strings at the Threshold of Adjacency. STACS (1998)
Joel Spencer, Katherine St. John
Random unary predicates: Almost sure theories and countable models. Random Struct. Algorithms 13 (3-4) (1998)
Joel Spencer, Lubos Thoma
On the limit values of probabilities for the first order properties of graphs. Contemporary Trends in Discrete Mathematics (1997)
Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer
Asymptotically Optimal Covering Designs. J. Comb. Theory, Ser. A 75 (2) (1996)
Boris G. Pittel, Joel Spencer, Nicholas C. Wormald
-Core in a Random Graph. J. Comb. Theory, Ser. B 67 (1) (1996)
Avrim Blum, Joel Spencer
Coloring Random and Semi-Random k-Colorable Graphs. J. Algorithms 19 (2) (1995)
Ravi Bopu Boppana, Joel Spencer
Smoothness laws for random ordered graphs. Logic and Random Structures (1995)
Joel Spencer
Asymptotic Packing via a Branching Process. Random Struct. Algorithms 7 (2) (1995)
Noga Alon, Joel Spencer, Prasad Tetali
Covering with Latin Transversals. Discret. Appl. Math. 57 (1) (1995)
Joel Spencer
From Erdös to algorithms. Discret. Math. 136 (1-3) (1994)
Saharon Shelah, Joel Spencer
Can You Feel the Double Jump? Random Struct. Algorithms 5 (1) (1994)
Joel Spencer
Randomization, Derandomization and Antirandomization: Three Games. Theor. Comput. Sci. 131 (2) (1994)
Saharon Shelah, Joel Spencer
Random Sparse Unary Predicates. Random Struct. Algorithms 5 (3) (1994)
Joel Spencer
Zero-One Laws with Variable Probability. J. Symb. Log. 58 (1) (1993)
Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West
Clique coverings of the edges of a random graph. Comb. 13 (1) (1993)
Joel Spencer, Peter Winkler
Three Thresholds for a Liar. Comb. Probab. Comput. 1 (1992)
Svante Janson, Joel Spencer
Probabilistic Construction of Proportional Graphs. Random Struct. Algorithms 3 (2) (1992)
Joel Spencer
The Probabilistic Method. SODA (1992)
Joel Spencer
Ulam's Searching Game with a Fixed Number of Lies. Theor. Comput. Sci. 95 (2) (1992)
Joel Spencer
Threshold spectra via the Ehrenfeucht game. Discret. Appl. Math. 30 (2-3) (1991)
Paul Erdös, Joel Spencer
Lopsided Lovász Local Lemma and Latin transversals. Discret. Appl. Math. 30 (2-3) (1991)
Joel Spencer
Countable Sparse Random Graphs. Random Struct. Algorithms 1 (2) (1990)
Joel Spencer
Infinite spectra in the first order theory of graphs. Comb. 10 (1) (1990)
László Babai, Miklós Simonovits, Joel Spencer
Extremal subgraphs of random graphs. J. Graph Theory 14 (5) (1990)
Joel Spencer
Coloring the projective plane. Discret. Math. 73 (1-2) (1989)
Svatopluk Poljak, Vojtech Rödl, Joel Spencer
Tournament Ranking with Expected Profit in Polynomial Time. SIAM J. Discret. Math. 1 (3) (1988)
Paul Erdös, Mark Goldberg, János Pach, Joel Spencer
Cutting a graph into two dissimilar halves. J. Graph Theory 12 (1) (1988)
János Pach, Joel Spencer
Explicit codes with low covering radius. IEEE Trans. Inf. Theory 34 (5) (1988)
Joel Spencer
The design of a resilient network concentrator. ICCC (1988)
Saharon Shelah, Joel Spencer
Threshold Spectra for Random Graphs STOC (1987)
Eli Shamir, Joel Spencer
. Comb. 7 (1) (1987)
Joel Spencer
Balancing vectors in the max norm. Comb. 6 (1) (1986)
László Lovász, Joel Spencer, Katalin Vesztergombi
Discrepancy of Set-systems and Matrices. Eur. J. Comb. 7 (2) (1986)
Zbigniew Palka, Andrzej Rucinski, Joel Spencer
On a method for random graphs. Discret. Math. 61 (2-3) (1986)
Joel Spencer
Probabilistic methods. Graphs Comb. 1 (1) (1985)
József Beck, Joel Spencer
Integral approximation sequences. Math. Program. 30 (1) (1984)
József Beck, Joel Spencer
Unit Distances. J. Comb. Theory, Ser. A 37 (3) (1984)
Joel Spencer
Canonical Configurations. J. Comb. Theory, Ser. A 34 (3) (1983)
Joel Spencer
Ramsey theory and Ramsey theoreticians. J. Graph Theory 7 (1) (1983)
József Beck, Joel Spencer
Balancing matrices with line shifts. Comb. 3 (3) (1983)
Joel Spencer
What's not inside a Cayley graph. Comb. 3 (2) (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) (1982)
Joel Spencer
Balancing Unit Vectors. J. Comb. Theory, Ser. A 30 (3) (1981)
Joel Spencer
Extremal problems, partition theorems, symmetric hypergraphs. Comb. 1 (3) (1981)
Joel Spencer
Discrete Ham Sandwich Theorems. Eur. J. Comb. 2 (3) (1981)
Joel Spencer
Coloring n-Sets Red and Blue. J. Comb. Theory, Ser. A 30 (1) (1981)
Joel Spencer
Suresums. Comb. 1 (2) (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) (1980)
Joel Spencer
All Finite Configurations are Almost Ramsey. J. Comb. Theory, Ser. A 27 (3) (1979)
Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
Coping with Errors in Binary Search Procedures (Preliminary Report) STOC (1978)
Norbert Sauer, Joel Spencer
Edge disjoint placement of graphs. J. Comb. Theory, Ser. B 25 (3) (1978)
Joel Spencer
Asymptotic lower bounds for Ramsey functions. Discret. Math. 20 (1977)
Joel Spencer
Balancing games. J. Comb. Theory, Ser. B 23 (1) (1977)
Joel Spencer
Ramsey's Theorem - A New Lower Bound. J. Comb. Theory, Ser. A 18 (1) (1975)
Emmett B. Keeler, Joel Spencer
Optimal Doubling in Backgammon. Oper. Res. 23 (6) (1975)

Joel Spencer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joel Spencer