Joel H. Spencer

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Existential monadic second order logic on random rooted trees.
Discrete Mathematics, 2019

2016
Bounded quantifier depth spectra for random graphs.
Discrete Mathematics, 2016

On the Length of a Random Minimum Spanning Tree.
Combinatorics, Probability & Computing, 2016

2013
Queueing with future information.
SIGMETRICS Performance Evaluation Review, 2013

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

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

2011
Proppian random walks in Z.
Discrete Mathematics, 2011

Deterministic Discrepancy Minimization.
Proceedings of the Algorithms - ESA 2011, 2011

2010
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 and Economic Behavior, 2010

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

2008
On the Size of Induced Acyclic Subgraphs in Random Digraphs.
Discrete Mathematics & Theoretical Computer Science, 2008

The complexity of random ordered structures.
Ann. Pure Appl. Logic, 2008

Deterministic random walks on regular trees.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Finite Model Theory and Its Applications
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-68804-4, 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.
Combinatorics, Probability & Computing, 2007

First-Order Definability of Trees and Sparse Random Graphs.
Combinatorics, Probability & Computing, 2007

Birth control for giants.
Combinatorica, 2007

2006
The Complexity of Random Ordered Structures.
Electr. Notes Theor. Comput. Sci., 2006

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

Simulating a Random Walk with Constant Error.
Combinatorics, Probability & Computing, 2006

Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube.
Combinatorica, 2006

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

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

2005
The Two-Batch Liar Game over an Arbitrary Channel.
SIAM J. Discrete 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 Mathematics, 2005

Discrepancy Games.
Electr. J. Comb., 2005

The Liar Game Over an Arbitrary Channel.
Combinatorica, 2005

Erdös Magic.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

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

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

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

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

2002
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.
Discrete Mathematics, 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

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

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

2000
Ten Years!
Random Struct. Algorithms, 2000

Packing Ferrers Shapes.
Combinatorics, Probability & Computing, 2000

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

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

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

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

New Bounds on Crossing Numbers.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
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

1997
Real time asymptotic packing.
Electr. 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

1996
Sudden Emergence of a Giantk-Core in a Random Graph.
J. Comb. Theory, Ser. B, 1996

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

1995
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.
Discrete Applied Mathematics, 1995

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

1994
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.
Discrete Mathematics, 1994

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

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

1992
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.
Combinatorics, Probability & Computing, 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

1991
Set systems with no union of cardinality 0 modulom.
Graphs and Combinatorics, 1991

Threshold spectra via the Ehrenfeucht game.
Discrete Applied Mathematics, 1991

Lopsided Lovász Local Lemma and Latin transversals.
Discrete Applied Mathematics, 1991

1990
Countable Sparse Random Graphs.
Random Struct. Algorithms, 1990

Extremal subgraphs of random graphs.
Journal of 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.
Discrete Mathematics, 1990

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

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

1989
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.
Discrete Mathematics, 1989

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

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

Cutting a graph into two dissimilar halves.
Journal of 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

1987
Sharp concentration of the chromatic number on random graphs Gn, p.
Combinatorica, 1987

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

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

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

On a method for random graphs.
Discrete Mathematics, 1986

Balancing vectors in the max norm.
Combinatorica, 1986

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

Probabilistic methods.
Graphs and Combinatorics, 1985

1984
Integral approximation sequences.
Math. Program., 1984

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

1983
Ramsey theory and Ramsey theoreticians.
Journal of Graph Theory, 1983

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

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

Balancing matrices with line shifts.
Combinatorica, 1983

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

1981
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.
Combinatorica, 1981

Suresums.
Combinatorica, 1981

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

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

1978
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

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

Asymptotic lower bounds for Ramsey functions.
Discrete Mathematics, 1977

1975
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.
Operations Research, 1975

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

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

Families of k-independent sets.
Discrete Mathematics, 1973

1972
Turán's theorem for k-graphs.
Discrete Mathematics, 1972

1971
Optimal ranking of tournaments.
Networks, 1971

Imbalances in k-colorations.
Networks, 1971


  Loading...