Joel H. Spencer

  • New York University, USA

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

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


Online presence:



On-line balancing of random inputs.
Random Struct. Algorithms, 2020

Existential monadic second order logic on random rooted trees.
Discret. Math., 2019

Preferential Attachment When Stable.
CoRR, 2018

Bounded quantifier depth spectra for random graphs.
Discret. Math., 2016

On the Length of a Random Minimum Spanning Tree.
Comb. Probab. Comput., 2016

Queueing with future information.
SIGMETRICS Perform. Evaluation Rev., 2013

The Bohman-Frieze process near criticality.
Random Struct. Algorithms, 2013

Deterministic Discrepancy Minimization.
Algorithmica, 2013

The Erdős Existence Argument.
Proceedings of the Mathematics of Paul Erdős I, 2013

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

Proppian random walks in Z.
Discret. Math., 2011

Phase transitions for random structures and algorithms.
Random Struct. Algorithms, 2010

The second largest component in the supercritical 2D Hamming graph.
Random Struct. Algorithms, 2010

Complexity and effective prediction.
Games Econ. Behav., 2010

Synchrony and Asynchrony in Neural Networks.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

On the Size of Induced Acyclic Subgraphs in Random Digraphs.
Discret. Math. Theor. Comput. Sci., 2008

The Probabilistic Method, Third Edition.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-470-17020-5, 2008

Finite Model Theory and Its Applications
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-68804-4, 2007

Deterministic Random Walks on Regular Trees.
Electron. Notes Discret. Math., 2007

Decomposable graphs and definitions with no quantifier alternation.
Eur. J. Comb., 2007

Deterministic random walks on the integers.
Eur. J. Comb., 2007

A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution.
Comb. Probab. Comput., 2007

First-Order Definability of Trees and Sparse Random Graphs.
Comb. Probab. Comput., 2007

Birth control for giants.
Comb., 2007

Counting connected graphs asymptotically.
Eur. J. Comb., 2006

Simulating a Random Walk with Constant Error.
Comb. Probab. Comput., 2006

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

Succinct definitions in the first order theory of graphs.
Ann. Pure Appl. Log., 2006

Deterministic Random Walks.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

The Two-Batch Liar Game over an Arbitrary Channel.
SIAM J. Discret. Math., 2005

How complex are random graphs in first order logic?
Random Struct. Algorithms, 2005

Random subgraphs of finite graphs: I. The scaling window under the triangle condition.
Random Struct. Algorithms, 2005

Connectivity Transitions in Networks with Super-Linear Preferential Attachment.
Internet Math., 2005

The Complexity of Random Ordered Structures.
Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

Discrepancy Games.
Electron. J. Comb., 2005

The Liar Game Over an Arbitrary Channel.
Comb., 2005

A Halfliar's game.
Theor. Comput. Sci., 2004

A Scaling Result for Explosive Processes.
Electron. J. Comb., 2004

The halflie problem.
J. Comb. Theory, Ser. A, 2003

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

Crossing numbers of random graphs.
Random Struct. Algorithms, 2002

Random dyadic tilings of the unit square.
Random Struct. Algorithms, 2002

Counting dyadic equipartitions of the unit square.
Discret. Math., 2002

Erdős Magic.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the (non)Universality of the One-Time Pad.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

The degree sequence of a scale-free random graph process.
Random Struct. Algorithms, 2001

The Tenacity of Zero-One Laws.
Electron. J. Comb., 2001

Ten Years!
Random Struct. Algorithms, 2000

New Bounds on Crossing Numbers.
Discret. Comput. Geom., 2000

Packing Ferrers Shapes.
Comb. Probab. Comput., 2000

Ups and Downs of First Order Sentences on Random Graphs.
Comb., 2000

Average-Case Analysis of Retangle Packings.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

The Probabilistic Method, Second Edition
John Wiley, ISBN: 978-0-47172215-1, 2000

Uniform boundedness of critical crossing probabilities implies hyperscaling.
Random Struct. Algorithms, 1999

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

Random unary predicates: Almost sure theories and countable models.
Random Struct. Algorithms, 1998

A Useful Elementary Correlation Inequality, II.
J. Comb. Theory, Ser. A, 1998

Random Sparse Bit Strings at the Threshold of Adjacency.
Proceedings of the STACS 98, 1998

Real time asymptotic packing.
Electron. J. Comb., 1997

On the limit values of probabilities for the first order properties of graphs.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

Sudden Emergence of a Giant<i>k</i>-Core in a Random Graph.
J. Comb. Theory, Ser. B, 1996

Asymptotically Optimal Covering Designs.
J. Comb. Theory, Ser. A, 1996

Asymptotic Packing via a Branching Process.
Random Struct. Algorithms, 1995

Coloring Random and Semi-Random k-Colorable Graphs.
J. Algorithms, 1995

Covering with Latin Transversals.
Discret. Appl. Math., 1995

Smoothness laws for random ordered graphs.
Proceedings of the Logic and Random Structures, 1995

Randomization, Derandomization and Antirandomization: Three Games.
Theor. Comput. Sci., 1994

Random Sparse Unary Predicates.
Random Struct. Algorithms, 1994

Can You Feel the Double Jump?
Random Struct. Algorithms, 1994

From Erdös to algorithms.
Discret. Math., 1994

Zero-One Laws with Variable Probability.
J. Symb. Log., 1993

Clique coverings of the edges of a random graph.
Comb., 1993

Ulam's Searching Game with a Fixed Number of Lies.
Theor. Comput. Sci., 1992

Probabilistic Construction of Proportional Graphs.
Random Struct. Algorithms, 1992

Three Thresholds for a Liar.
Comb. Probab. Comput., 1992

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

The Probabilistic Method
John Wiley, ISBN: 0-471-53588-5, 1992

Set systems with no union of cardinality 0 modulo<i>m</i>.
Graphs Comb., 1991

Threshold spectra via the Ehrenfeucht game.
Discret. Appl. Math., 1991

Lopsided Lovász Local Lemma and Latin transversals.
Discret. Appl. Math., 1991

Countable Sparse Random Graphs.
Random Struct. Algorithms, 1990

Extremal subgraphs of random graphs.
J. Graph Theory, 1990

Threshold functions for extension statements.
J. Comb. Theory, Ser. A, 1990

Counting extensions.
J. Comb. Theory, Ser. A, 1990

Note on vertex-partitions of infinite graphs.
Discret. Math., 1990

Infinite spectra in the first order theory of graphs.
Comb., 1990

Gaps in Difference Sets, and the Graph of Nearly Equal Distances.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Asymptotic behavior of the chromatic index for hypergraphs.
J. Comb. Theory, Ser. A, 1989

Monochromatic sumsets.
J. Comb. Theory, Ser. A, 1989

A useful elementary correlation inequality.
J. Comb. Theory, Ser. A, 1989

Ascending waves.
J. Comb. Theory, Ser. A, 1989

Coloring the projective plane.
Discret. Math., 1989

Explicit codes with low covering radius.
IEEE Trans. Inf. Theory, 1988

Tournament Ranking with Expected Profit in Polynomial Time.
SIAM J. Discret. Math., 1988

Cutting a graph into two dissimilar halves.
J. Graph Theory, 1988

Three hundred million points suffice.
J. Comb. Theory, Ser. A, 1988

How to make a graph bipartite.
J. Comb. Theory, Ser. B, 1988

The design of a resilient network concentrator.
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

Sharp concentration of the chromatic number on random graphs G<sub>n, p</sub>.
Comb., 1987

Threshold Spectra for Random Graphs
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Discrepancy of Set-systems and Matrices.
Eur. J. Comb., 1986

Functions that Never Agree.
Eur. J. Comb., 1986

On a method for random graphs.
Discret. Math., 1986

Balancing vectors in the max norm.
Comb., 1986

Extremal subgraphs for two graphs.
J. Comb. Theory, Ser. B, 1985

Probabilistic methods.
Graphs Comb., 1985

Integral approximation sequences.
Math. Program., 1984

Unit Distances.
J. Comb. Theory, Ser. A, 1984

Ramsey theory and Ramsey theoreticians.
J. Graph Theory, 1983

Canonical Configurations.
J. Comb. Theory, Ser. A, 1983

What's not inside a Cayley graph.
Comb., 1983

Balancing matrices with line shifts.
Comb., 1983

Extremal Uncrowded Hypergraphs.
J. Comb. Theory, Ser. A, 1982

Balancing Unit Vectors.
J. Comb. Theory, Ser. A, 1981

Coloring n-Sets Red and Blue.
J. Comb. Theory, Ser. A, 1981

Discrete Ham Sandwich Theorems.
Eur. J. Comb., 1981

Extremal problems, partition theorems, symmetric hypergraphs.
Comb., 1981

Comb., 1981

Coping with Errors in Binary Search Procedures.
J. Comput. Syst. Sci., 1980

All Finite Configurations are Almost Ramsey.
J. Comb. Theory, Ser. A, 1979

Edge disjoint placement of graphs.
J. Comb. Theory, Ser. B, 1978

Balancing Families of Sets.
J. Comb. Theory, Ser. A, 1978

Coping with Errors in Binary Search Procedures (Preliminary Report)
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

Balancing games.
J. Comb. Theory, Ser. B, 1977

Asymptotic lower bounds for Ramsey functions.
Discret. Math., 1977

Restricted Ramsey Configurations.
J. Comb. Theory, Ser. A, 1975

Ramsey's Theorem - A New Lower Bound.
J. Comb. Theory, Ser. A, 1975

Optimal Doubling in Backgammon.
Oper. Res., 1975

Puncture Sets.
J. Comb. Theory, Ser. A, 1974

Euclidean Ramsey Theorems I.
J. Comb. Theory, Ser. A, 1973

Families of k-independent sets.
Discret. Math., 1973

Turán's theorem for k-graphs.
Discret. Math., 1972

Optimal ranking of tournaments.
Networks, 1971

Imbalances in k-colorations.
Networks, 1971