Joel H. Spencer

According to our database, Joel H. Spencer authored at least 134 papers between 1971 and 2020.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of one.

2020

On-line balancing of random inputs.

Nikhil Bansal, Joel H. Spencer

Random Struct. Algorithms, 2020

2019

Existential monadic second order logic on random rooted trees.

Alexander E. Holroyd, Avi Levy, Moumanti Podder, Joel Spencer

Discret. Math., 2019

2018

Preferential Attachment When Stable.

Svante Janson, Subhabrata Sen, Joel Spencer

CoRR, 2018

2016

Bounded quantifier depth spectra for random graphs.

Joel H. Spencer, Maksim E. Zhukovskii

Discret. Math., 2016

On the Length of a Random Minimum Spanning Tree.

Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer

Comb. Probab. Comput., 2016

2013

Queueing with future information.

Joel Spencer, Madhu Sudan, Kuang Xu

SIGMETRICS Perform. Evaluation Rev., 2013

The Bohman-Frieze process near criticality.

Mihyun Kang, Will Perkins, Joel Spencer

Random Struct. Algorithms, 2013

The Erdős Existence Argument.

Joel Spencer

Proceedings of the Mathematics of Paul Erdős I, 2013

Erdős Magic.

Joel Spencer

Proceedings of the Mathematics of Paul Erdős I, 2013

2011

Proppian random walks in Z.

Juliana Freire, Joel Spencer

Discret. Math., 2011

Deterministic Discrepancy Minimization.

Nikhil Bansal, Joel Spencer

Proceedings of the Algorithms - ESA 2011, 2011

2010

Phase transitions for random structures and algorithms.

Joel Spencer

Random Struct. Algorithms, 2010

The second largest component in the supercritical 2D Hamming graph.

Remco van der Hofstad, Malwina J. Luczak, Joel Spencer

Random Struct. Algorithms, 2010

Complexity and effective prediction.

Abraham Neyman, Joel Spencer

Games Econ. Behav., 2010

Synchrony and Asynchrony in Neural Networks.

Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2008

On the Size of Induced Acyclic Subgraphs in Random Digraphs.

Joel Spencer, C. R. Subramanian

Discret. Math. Theor. Comput. Sci., 2008

The complexity of random ordered structures.

Joel H. Spencer, Katherine St. John

Ann. Pure Appl. Log., 2008

Deterministic random walks on regular trees.

Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

The Probabilistic Method, Third Edition.

Noga Alon, Joel H. Spencer

Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-470-17020-5, 2008

2007

Finite Model Theory and Its Applications

Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-68804-4, 2007

Decomposable graphs and definitions with no quantifier alternation.

Oleg Pikhurko, Joel Spencer, Oleg Verbitsky

Eur. J. Comb., 2007

Deterministic random walks on the integers.

Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos

Eur. J. Comb., 2007

A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution.

Svante Janson, Joel Spencer

Comb. Probab. Comput., 2007

First-Order Definability of Trees and Sparse Random Graphs.

Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky

Comb. Probab. Comput., 2007

Birth control for giants.

Joel H. Spencer, Nicholas C. Wormald

Comb., 2007

2006

Counting connected graphs asymptotically.

Remco van der Hofstad, Joel Spencer

Eur. J. Comb., 2006

Simulating a Random Walk with Constant Error.

Joshua N. Cooper, Joel Spencer

Comb. Probab. Comput., 2006

Random Subgraphs Of Finite Graphs: III. The Phase Transition For The <i>n</i>-Cube.

Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer

Comb., 2006

Succinct definitions in the first order theory of graphs.

Oleg Pikhurko, Joel Spencer, Oleg Verbitsky

Ann. Pure Appl. Log., 2006

Deterministic Random Walks.

Joshua N. Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos

Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005

The Two-Batch Liar Game over an Arbitrary Channel.

Ioana Dumitriu, Joel H. Spencer

SIAM J. Discret. Math., 2005

How complex are random graphs in first order logic?

Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky

Random Struct. Algorithms, 2005

Random subgraphs of finite graphs: I. The scaling window under the triangle condition.

Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel H. Spencer

Random Struct. Algorithms, 2005

Connectivity Transitions in Networks with Super-Linear Preferential Attachment.

Roberto Imbuzeiro Oliveira, Joel H. Spencer

Internet Math., 2005

Discrepancy Games.

Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó

Electron. J. Comb., 2005

The Liar Game Over an Arbitrary Channel.

Ioana Dumitriu, Joel H. Spencer

Comb., 2005

Erdös Magic.

Joel Spencer

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004

A Halfliar's game.

Ioana Dumitriu, Joel Spencer

Theor. Comput. Sci., 2004

A Scaling Result for Explosive Processes.

Michael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer

Electron. J. Comb., 2004

2003

The halflie problem.

Joel Spencer, Catherine H. Yan

J. Comb. Theory A, 2003

LIAR!

Joel Spencer

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Crossing numbers of random graphs.

Joel Spencer, Géza Tóth

Random Struct. Algorithms, 2002

Random dyadic tilings of the unit square.

Svante Janson, Dana Randall, Joel Spencer

Random Struct. Algorithms, 2002

Counting dyadic equipartitions of the unit square.

Jeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson

Discret. Math., 2002

On the (non)Universality of the One-Time Pad.

Yevgeniy Dodis, Joel Spencer

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

2001

The degree sequence of a scale-free random graph process.

Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor E. Tusnády

Random Struct. Algorithms, 2001

The Tenacity of Zero-One Laws.

Joel H. Spencer, Katherine St. John

Electron. J. Comb., 2001

2000

Ten Years!

Michal Karonski, Joel Spencer

Random Struct. Algorithms, 2000

Packing Ferrers Shapes.

Noga Alon, Miklós Bóna, Joel Spencer

Comb. Probab. Comput., 2000

Ups and Downs of First Order Sentences on Random Graphs.

Joel Spencer, Gábor Tardos

Comb., 2000

Average-Case Analysis of Retangle Packings.

Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

The Probabilistic Method, Second Edition

Noga Alon, Joel H. Spencer

John Wiley, ISBN: 978-0-47172215-1, 2000

1999

Uniform boundedness of critical crossing probabilities implies hyperscaling.

Christian Borgs, Jennifer T. Chayes, Harry Kesten, Joel Spencer

Random Struct. Algorithms, 1999

Uniformly Distributed Distances - a Geometric Application of Janson's Inequality.

János Pach, Joel Spencer

Comb., 1999

New Bounds on Crossing Numbers.

János Pach, Joel Spencer, Géza Tóth

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Random unary predicates: Almost sure theories and countable models.

Joel Spencer, Katherine St. John

Random Struct. Algorithms, 1998

A Useful Elementary Correlation Inequality, II.

Joel Spencer

J. Comb. Theory A, 1998

Random Sparse Bit Strings at the Threshold of Adjacency.

Joel Spencer, Katherine St. John

Proceedings of the STACS 98, 1998

1997

Real time asymptotic packing.

Joel H. Spencer

Electron. J. Comb., 1997

On the limit values of probabilities for the first order properties of graphs.

Joel Spencer, Lubos Thoma

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Sudden Emergence of a Giant<i>k</i>-Core in a Random Graph.

Boris G. Pittel, Joel Spencer, Nicholas C. Wormald

J. Comb. Theory B, 1996

Asymptotically Optimal Covering Designs.

Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer

J. Comb. Theory A, 1996

1995

Asymptotic Packing via a Branching Process.

Joel Spencer

Random Struct. Algorithms, 1995

Coloring Random and Semi-Random k-Colorable Graphs.

Avrim Blum, Joel Spencer

J. Algorithms, 1995

Covering with Latin Transversals.

Noga Alon, Joel Spencer, Prasad Tetali

Discret. Appl. Math., 1995

Smoothness laws for random ordered graphs.

Ravi Bopu Boppana, Joel Spencer

Proceedings of the Logic and Random Structures, 1995

1994

Randomization, Derandomization and Antirandomization: Three Games.

Joel Spencer

Theor. Comput. Sci., 1994

Random Sparse Unary Predicates.

Saharon Shelah, Joel Spencer

Random Struct. Algorithms, 1994

Can You Feel the Double Jump?

Saharon Shelah, Joel Spencer

Random Struct. Algorithms, 1994

From Erdös to algorithms.

Joel Spencer

Discret. Math., 1994

1993

Zero-One Laws with Variable Probability.

Joel Spencer

J. Symb. Log., 1993

Clique coverings of the edges of a random graph.

Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West

Comb., 1993

1992

Ulam's Searching Game with a Fixed Number of Lies.

Joel Spencer

Theor. Comput. Sci., 1992

Probabilistic Construction of Proportional Graphs.

Svante Janson, Joel Spencer

Random Struct. Algorithms, 1992

Three Thresholds for a Liar.

Joel Spencer, Peter Winkler

Comb. Probab. Comput., 1992

The Probabilistic Method.

Joel Spencer

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

The Probabilistic Method

Noga Alon, Joel Spencer

John Wiley, ISBN: 0-471-53588-5, 1992

1991

Set systems with no union of cardinality 0 modulo<i>m</i>.

Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer

Graphs Comb., 1991

Threshold spectra via the Ehrenfeucht game.

Joel Spencer

Discret. Appl. Math., 1991

Lopsided Lovász Local Lemma and Latin transversals.

Paul Erdös, Joel Spencer

Discret. Appl. Math., 1991

1990

Countable Sparse Random Graphs.

Joel Spencer

Random Struct. Algorithms, 1990

Extremal subgraphs of random graphs.

László Babai, Miklós Simonovits, Joel Spencer

J. Graph Theory, 1990

Threshold functions for extension statements.

Joel H. Spencer

J. Comb. Theory A, 1990

Counting extensions.

Joel H. Spencer

J. Comb. Theory A, 1990

Note on vertex-partitions of infinite graphs.

János Pach, Joel H. Spencer

Discret. Math., 1990

Infinite spectra in the first order theory of graphs.

Joel Spencer

Comb., 1990

Gaps in Difference Sets, and the Graph of Nearly Equal Distances.

Paul Erdös, Endre Makai, János Pach, Joel H. Spencer

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989

Asymptotic behavior of the chromatic index for hypergraphs.

Nicholas Pippenger, Joel H. Spencer

J. Comb. Theory A, 1989

Monochromatic sumsets.

Paul Erdös, Joel H. Spencer

J. Comb. Theory A, 1989

A useful elementary correlation inequality.

Ravi Boppona, Joel H. Spencer

J. Comb. Theory A, 1989

Ascending waves.

Noga Alon, Joel H. Spencer

J. Comb. Theory A, 1989

Coloring the projective plane.

Joel Spencer

Discret. Math., 1989

1988

Explicit codes with low covering radius.

János Pach, Joel Spencer

IEEE Trans. Inf. Theory, 1988

Tournament Ranking with Expected Profit in Polynomial Time.

Svatopluk Poljak, Vojtech Rödl, Joel Spencer

SIAM J. Discret. Math., 1988

Cutting a graph into two dissimilar halves.

Paul Erdös, Mark Goldberg, János Pach, Joel Spencer

J. Graph Theory, 1988

Three hundred million points suffice.

Joel H. Spencer

J. Comb. Theory A, 1988

How to make a graph bipartite.

Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer

J. Comb. Theory B, 1988

The design of a resilient network concentrator.

Joel Spencer

Proceedings of the Computer Communication Technologies for the 90's, Proceedings of the Ninth International Conference on Computer Communication, Tel Aviv, Israel, October 30, 1988

1987

Sharp concentration of the chromatic number on random graphs G_{n, p}.

Eli Shamir, Joel Spencer

Comb., 1987

Threshold Spectra for Random Graphs

Saharon Shelah, Joel Spencer

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986

Discrepancy of Set-systems and Matrices.

László Lovász, Joel Spencer, Katalin Vesztergombi

Eur. J. Comb., 1986

Functions that Never Agree.

A. Robert Calderbank, Peter C. Fishburn, Joel H. Spencer

Eur. J. Comb., 1986

On a method for random graphs.

Zbigniew Palka, Andrzej Rucinski, Joel Spencer

Discret. Math., 1986

Balancing vectors in the max norm.

Joel Spencer

Comb., 1986

1985

Extremal subgraphs for two graphs.

Fan R. K. Chung, Paul Erdös, Joel H. Spencer

J. Comb. Theory B, 1985

Probabilistic methods.

Joel Spencer

Graphs Comb., 1985

1984

Integral approximation sequences.

József Beck, Joel Spencer

Math. Program., 1984

Unit Distances.

József Beck, Joel Spencer

J. Comb. Theory A, 1984

1983

Ramsey theory and Ramsey theoreticians.

Joel Spencer

J. Graph Theory, 1983

Canonical Configurations.

Joel Spencer

J. Comb. Theory A, 1983

What's not inside a Cayley graph.

Joel Spencer

Comb., 1983

Balancing matrices with line shifts.

József Beck, Joel Spencer

Comb., 1983

1982

Extremal Uncrowded Hypergraphs.

Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi

J. Comb. Theory A, 1982

1981

Balancing Unit Vectors.

Joel Spencer

J. Comb. Theory A, 1981

Coloring n-Sets Red and Blue.

Joel Spencer

J. Comb. Theory A, 1981

Discrete Ham Sandwich Theorems.

Joel Spencer

Eur. J. Comb., 1981

Extremal problems, partition theorems, symmetric hypergraphs.

Joel Spencer

Comb., 1981

Suresums.

Joel Spencer

Comb., 1981

1980

Coping with Errors in Binary Search Procedures.

Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer

J. Comput. Syst. Sci., 1980

1979

All Finite Configurations are Almost Ramsey.

Joel Spencer

J. Comb. Theory A, 1979

1978

Edge disjoint placement of graphs.

Norbert Sauer, Joel Spencer

J. Comb. Theory B, 1978

Balancing Families of Sets.

John E. Olson, Joel H. Spencer

J. Comb. Theory A, 1978

Coping with Errors in Binary Search Procedures (Preliminary Report)

Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1977

Balancing games.

Joel Spencer

J. Comb. Theory B, 1977

Asymptotic lower bounds for Ramsey functions.

Joel Spencer

Discret. Math., 1977

1975

Restricted Ramsey Configurations.

Joel Spencer

J. Comb. Theory A, 1975

Ramsey's Theorem - A New Lower Bound.

Joel Spencer

J. Comb. Theory A, 1975

Optimal Doubling in Backgammon.

Emmett B. Keeler, Joel Spencer

Oper. Res., 1975

1974

Puncture Sets.

Joel Spencer

J. Comb. Theory A, 1974

1973

Euclidean Ramsey Theorems I.

Paul Erdös, Ronald L. Graham, Peter Montgomery, Bruce Lee Rothschild, Joel Spencer, Ernst G. Straus

J. Comb. Theory A, 1973

Families of k-independent sets.

Daniel J. Kleitman, Joel H. Spencer

Discret. Math., 1973

1972

Turán's theorem for k-graphs.

Joel Spencer

Discret. Math., 1972

1971

Optimal ranking of tournaments.

Joel H. Spencer

Networks, 1971

Imbalances in k-colorations.

Paul Erdös, Joel H. Spencer

Networks, 1971