Joel H. Spencer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2020

On-line balancing of random inputsNikhil Bansal, Joel H. Spencer. rsa, 57(4):879-891, 2020. [doi]

2016

Bounded quantifier depth spectra for random graphsJoel H. Spencer, M. E. Zhukovskii. DM, 339(6):1651-1664, 2016. [doi]

2008

The Probabilistic Method, Third EditionNoga Alon, Joel H. Spencer. Wiley-Interscience series in discrete mathematics and optimization, Wiley, 2008.

The complexity of random ordered structuresJoel H. Spencer, Katherine St. John. APAL, 152(1-3):174-179, 2008. [doi]

2007

Deterministic random walks on the integersJoshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos. ejc, 28(8):2072-2090, 2007. [doi]

Birth control for giantsJoel H. Spencer, Nicholas C. Wormald. combinatorica, 27(5):587-628, 2007. [doi]

2006

The Complexity of Random Ordered StructuresJoel H. Spencer, Katherine St. John. ENTCS, 143:197-206, 2006. [doi]

2005

Random subgraphs of finite graphs: I. The scaling window under the triangle conditionChristian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel H. Spencer. rsa, 27(2):137-184, 2005. [doi]

The Liar Game Over an Arbitrary ChannelIoana Dumitriu, Joel H. Spencer. combinatorica, 25(5):537-559, 2005. [doi]

The Two-Batch Liar Game over an Arbitrary ChannelIoana Dumitriu, Joel H. Spencer. siamdm, 19(4):1056-1064, 2005. [doi]

How complex are random graphs in first order logic?Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky. rsa, 26(1-2):119-145, 2005. [doi]

Connectivity Transitions in Networks with Super-Linear Preferential AttachmentRoberto Imbuzeiro Oliveira, Joel H. Spencer. im, 2(2):121-163, 2005.

2004

A Scaling Result for Explosive ProcessesMichael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer. combinatorics, 11(1), 2004. [doi]

2002

Counting dyadic equipartitions of the unit squareJeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson. DM, 257(2-3):481-499, 2002. [doi]

2001

The Tenacity of Zero-One LawsJoel H. Spencer, Katherine St. John. combinatorics, 8(2), 2001. [doi]

2000

The Probabilistic Method, Second EditionNoga Alon, Joel H. Spencer. John Wiley, 2000. [doi]

1997

Real time asymptotic packingJoel H. Spencer. combinatorics, 4(2), 1997. [doi]

1991

mNoga Alon, Daniel J. Kleitman, Richard Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer. gc, 7(2):97-99, 1991. [doi]

1990

Gaps in Difference Sets, and the Graph of Nearly Equal DistancesPaul Erdös, Endre Makai, János Pach, Joel H. Spencer. dimacs 1991: 265-274

Note on vertex-partitions of infinite graphsJános Pach, Joel H. Spencer. DM, 79(1):107-108, 1990. [doi]

Counting extensionsJoel H. Spencer. JCT, 55(2):247-255, 1990. [doi]

Threshold functions for extension statementsJoel H. Spencer. JCT, 53(2):286-305, 1990. [doi]

1989

Ascending wavesNoga Alon, Joel H. Spencer. JCT, 52(2):275-287, 1989. [doi]

A useful elementary correlation inequalityRavi Boppona, Joel H. Spencer. JCT, 50(2):305-307, 1989. [doi]

Monochromatic sumsetsPaul Erdös, Joel H. Spencer. JCT, 50(1):162-163, 1989. [doi]

Asymptotic behavior of the chromatic index for hypergraphsNicholas Pippenger, Joel H. Spencer. JCT, 51(1):24-42, 1989. [doi]

1988

How to make a graph bipartitePaul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer. JCT, 45(1):86-98, 1988. [doi]

Three hundred million points sufficeJoel H. Spencer. JCT, 49(2):210-217, 1988. [doi]

1986

Functions that Never AgreeA. Robert Calderbank, Peter C. Fishburn, Joel H. Spencer. ejc, 7(3):207-210, 1986. [doi]

1985

Extremal subgraphs for two graphsFan R. K. Chung, Paul Erdös, Joel H. Spencer. JCT, 38(3):248-260, 1985. [doi]

1978

Balancing Families of SetsJohn E. Olson, Joel H. Spencer. JCT, 25(1):29-37, 1978.

1973

Families of k-independent setsDaniel J. Kleitman, Joel H. Spencer. DM, 6(3):255-262, 1973. [doi]

1971

Imbalances in k-colorationsPaul Erdös, Joel H. Spencer. networks, 1(4):379-385, 1971. [doi]

Sign in or sign up to see more results.

runs on WebDSL