dblp.uni-trier.dewww.uni-trier.de

Joel H. Spencer

Joel Spencer

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
99EEJoshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic random walks on regular trees. SODA 2008: 766-772
98EEJoel H. Spencer, Katherine St. John: The complexity of random ordered structures. Ann. Pure Appl. Logic 152(1-3): 174-179 (2008)
2007
97EETom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky: First-Order Definability of Trees and Sparse Random Graphs. Combinatorics, Probability & Computing 16(3): 375-400 (2007)
96EESvante Janson, Joel Spencer: A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. Combinatorics, Probability & Computing 16(4): 631-658 (2007)
95EEJoshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic Random Walks on Regular Trees. Electronic Notes in Discrete Mathematics 29: 509-513 (2007)
94EEJoshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos: Deterministic random walks on the integers. Eur. J. Comb. 28(8): 2072-2090 (2007)
93EEOleg Pikhurko, Joel Spencer, Oleg Verbitsky: Decomposable graphs and definitions with no quantifier alternation. Eur. J. Comb. 28(8): 2264-2283 (2007)
2006
92EEOleg Pikhurko, Joel Spencer, Oleg Verbitsky: Succinct definitions in the first order theory of graphs. Ann. Pure Appl. Logic 139(1-3): 74-109 (2006)
91EEChristian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer: Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube. Combinatorica 26(4): 395-410 (2006)
90EEJoshua N. Cooper, Joel Spencer: Simulating a Random Walk with Constant Error. Combinatorics, Probability & Computing 15(6): 815-822 (2006)
89EEJoel H. Spencer, Katherine St. John: The Complexity of Random Ordered Structures. Electr. Notes Theor. Comput. Sci. 143: 197-206 (2006)
88EERemco van der Hofstad, Joel Spencer: Counting connected graphs asymptotically. Eur. J. Comb. 27(8): 1294-1320 (2006)
2005
87EEJoel Spencer: Erdös Magic. FSTTCS 2005: 106
86EEIoana Dumitriu, Joel H. Spencer: The Liar Game Over an Arbitrary Channel. Combinatorica 25(5): 537-559 (2005)
85EENoga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó: Discrepancy Games. Electr. J. Comb. 12: (2005)
84 Roberto Imbuzeiro Oliveira, Joel H. Spencer: Connectivity Transitions in Networks with Super-Linear Preferential Attachment. Internet Mathematics 2(2): (2005)
83EEJeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky: How complex are random graphs in first order logic? Random Struct. Algorithms 26(1-2): 119-145 (2005)
82EEChristian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel H. Spencer: Random subgraphs of finite graphs: I. The scaling window under the triangle condition. Random Struct. Algorithms 27(2): 137-184 (2005)
81EEIoana Dumitriu, Joel H. Spencer: The Two-Batch Liar Game over an Arbitrary Channel. SIAM J. Discrete Math. 19(4): 1056-1064 (2005)
2004
80EEMichael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer: A Scaling Result for Explosive Processes. Electr. J. Comb. 11(1): (2004)
79EEIoana Dumitriu, Joel Spencer: A Halfliar's game. Theor. Comput. Sci. 303(3): 353-369 (2004)
2003
78EEJoel Spencer: LIAR! COCOON 2003: 1-2
77EEJoel Spencer, Catherine H. Yan: The halflie problem. J. Comb. Theory, Ser. A 103(1): 69-89 (2003)
2002
76EEYevgeniy Dodis, Joel Spencer: On the (non)Universality of the One-Time Pad. FOCS 2002: 376-
75EEJoel Spencer: Erdos Magic. LATIN 2002: 3
74EEJeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson: Counting dyadic equipartitions of the unit square. Discrete Mathematics 257(2-3): 481-499 (2002)
73EESvante Janson, Dana Randall, Joel Spencer: Random dyadic tilings of the unit square. Random Struct. Algorithms 21(3-4): 225-251 (2002)
72EEJoel Spencer, Géza Tóth: Crossing numbers of random graphs. Random Struct. Algorithms 21(3-4): 347-358 (2002)
2001
71EEJoel H. Spencer, Katherine St. John: The Tenacity of Zero-One Laws. Electr. J. Comb. 8(2): (2001)
70 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): 279-290 (2001)
2000
69 Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler: Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297
68EEJoel Spencer, Gábor Tardos: Ups and Downs of First Order Sentences on Random Graphs. Combinatorica 20(2): 263-280 (2000)
67 Noga Alon, Miklós Bóna, Joel Spencer: Packing Ferrers Shapes. Combinatorics, Probability & Computing 9(3): (2000)
66EEJános Pach, Joel Spencer, Géza Tóth: New Bounds on Crossing Numbers. Discrete & Computational Geometry 24(4): 623-644 (2000)
65 Michal Karonski, Joel Spencer: Ten Years! Random Struct. Algorithms 16(1): 1-3 (2000)
1999
64EEJános Pach, Joel Spencer, Géza Tóth: New Bounds on Crossing Numbers. Symposium on Computational Geometry 1999: 124-133
63EEJános Pach, Joel Spencer: Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. Combinatorica 19(1): 111-124 (1999)
62 Christian Borgs, Jennifer T. Chayes, Harry Kesten, Joel Spencer: Uniform boundedness of critical crossing probabilities implies hyperscaling. Random Struct. Algorithms 15(3-4): 368-413 (1999)
1998
61 Joel Spencer, Katherine St. John: Random Sparse Bit Strings at the Threshold of Adjacency. STACS 1998: 94-104
60EEJoel Spencer: A Useful Elementary Correlation Inequality, II. J. Comb. Theory, Ser. A 84(1): 95-98 (1998)
59 Joel Spencer, Katherine St. John: Random unary predicates: Almost sure theories and countable models. Random Struct. Algorithms 13(3-4): 229-248 (1998)
1997
58EEJoel H. Spencer: Real time asymptotic packing. Electr. J. Comb. 4(2): (1997)
1996
57EEDaniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer: Asymptotically Optimal Covering Designs. J. Comb. Theory, Ser. A 75(2): 270-280 (1996)
56EEBoris Pittel, Joel Spencer, Nicholas C. Wormald: Sudden Emergence of a Giantk-Core in a Random Graph. J. Comb. Theory, Ser. B 67(1): 111-151 (1996)
1995
55EENoga Alon, Joel Spencer, Prasad Tetali: Covering with Latin Transversals. Discrete Applied Mathematics 57(1): 1-10 (1995)
54 Avrim Blum, Joel Spencer: Coloring Random and Semi-Random k-Colorable Graphs. J. Algorithms 19(2): 204-234 (1995)
53 Joel Spencer: Asymptotic Packing via a Branching Process. Random Struct. Algorithms 7(2): 167-172 (1995)
1994
52EEJoel Spencer: From Erdös to algorithms. Discrete Mathematics 136(1-3): 295-307 (1994)
51 Saharon Shelah, Joel Spencer: Can You Feel the Double Jump? Random Struct. Algorithms 5(1): 191-204 (1994)
50 Saharon Shelah, Joel Spencer: Random Sparse Unary Predicates. Random Struct. Algorithms 5(3): 375-394 (1994)
49 Joel Spencer: Randomization, Derandomization and Antirandomization: Three Games. Theor. Comput. Sci. 131(2): 415-429 (1994)
1993
48 Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West: Clique coverings of the edges of a random graph. Combinatorica 13(1): 1-5 (1993)
47 Joel Spencer: Zero-One Laws with Variable Probability. J. Symb. Log. 58(1): 1-14 (1993)
1992
46 Noga Alon, Joel Spencer: The Probabilistic Method John Wiley 1992
45EEJoel Spencer: The Probabilistic Method. SODA 1992: 41-47
44 Joel Spencer, Peter Winkler: Three Thresholds for a Liar. Combinatorics, Probability & Computing 1: 81-93 (1992)
43 Svante Janson, Joel Spencer: Probabilistic Construction of Proportional Graphs. Random Struct. Algorithms 3(2): 127-138 (1992)
42 Joel Spencer: Ulam's Searching Game with a Fixed Number of Lies. Theor. Comput. Sci. 95(2): 307-321 (1992)
1991
41EEPaul Erdös, Joel Spencer: Lopsided Lovász Local Lemma and Latin transversals. Discrete Applied Mathematics 30(2-3): 151-154 (1991)
40EEJoel Spencer: Threshold spectra via the Ehrenfeucht game. Discrete Applied Mathematics 30(2-3): 235-252 (1991)
1990
39 Joel Spencer: Infinite spectra in the first order theory of graphs. Combinatorica 10(1): 95-102 (1990)
38EEJános Pach, Joel H. Spencer: Note on vertex-partitions of infinite graphs. Discrete Mathematics 79(1): 107-108 (1990)
37EEJoel H. Spencer: Threshold functions for extension statements. J. Comb. Theory, Ser. A 53(2): 286-305 (1990)
36EEJoel H. Spencer: Counting extensions. J. Comb. Theory, Ser. A 55(2): 247-255 (1990)
35 Joel Spencer: Countable Sparse Random Graphs. Random Struct. Algorithms 1(2): 205-214 (1990)
1989
34EEJoel Spencer: Coloring the projective plane. Discrete Mathematics 73(1-2): 213-220 (1989)
33EEPaul Erdös, Joel H. Spencer: Monochromatic sumsets. J. Comb. Theory, Ser. A 50(1): 162-163 (1989)
32EERavi Boppona, Joel H. Spencer: A useful elementary correlation inequality. J. Comb. Theory, Ser. A 50(2): 305-307 (1989)
31EENicholas Pippenger, Joel H. Spencer: Asymptotic behavior of the chromatic index for hypergraphs. J. Comb. Theory, Ser. A 51(1): 24-42 (1989)
30EENoga Alon, Joel H. Spencer: Ascending waves. J. Comb. Theory, Ser. A 52(2): 275-287 (1989)
1988
29 Joel Spencer: The design of a resilient network concentrator. ICCC 1988: 518-523
28 János Pach, Joel Spencer: Explicit codes with low covering radius. IEEE Transactions on Information Theory 34(5): 1281-1285 (1988)
27EEJoel H. Spencer: Three hundred million points suffice. J. Comb. Theory, Ser. A 49(2): 210-217 (1988)
26EEPaul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer: How to make a graph bipartite. J. Comb. Theory, Ser. B 45(1): 86-98 (1988)
25 Svatopluk Poljak, Vojtech Rödl, Joel Spencer: Tournament Ranking with Expected Profit in Polynomial Time. SIAM J. Discrete Math. 1(3): 372-376 (1988)
1987
24 Saharon Shelah, Joel Spencer: Threshold Spectra for Random Graphs STOC 1987: 421-424
23 Eli Shamir, Joel Spencer: Sharp concentration of the chromatic number on random graphs Gn, p. Combinatorica 7(1): 121-129 (1987)
1986
22 Joel Spencer: Balancing vectors in the max norm. Combinatorica 6(1): 55-66 (1986)
21EEZbigniew Palka, Andrzej Rucinski, Joel Spencer: On a method for random graphs. Discrete Mathematics 61(2-3): 253-258 (1986)
1985
20EEFan R. K. Chung, Paul Erdös, Joel H. Spencer: Extremal subgraphs for two graphs. J. Comb. Theory, Ser. B 38(3): 248-260 (1985)
1984
19 József Beck, Joel Spencer: Unit Distances. J. Comb. Theory, Ser. A 37(3): 231-238 (1984)
1983
18 Joel Spencer: What's not inside a Cayley graph. Combinatorica 3(2): 239-241 (1983)
17 József Beck, Joel Spencer: Balancing matrices with line shifts. Combinatorica 3(3): 299-304 (1983)
16 Joel Spencer: Canonical Configurations. J. Comb. Theory, Ser. A 34(3): 325-330 (1983)
1982
15 Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi: Extremal Uncrowded Hypergraphs. J. Comb. Theory, Ser. A 32(3): 321-335 (1982)
1981
14 Joel Spencer: Suresums. Combinatorica 1(2): 203-208 (1981)
13 Joel Spencer: Extremal problems, partition theorems, symmetric hypergraphs. Combinatorica 1(3): 303-307 (1981)
12 Joel Spencer: Coloring n-Sets Red and Blue. J. Comb. Theory, Ser. A 30(1): 112-113 (1981)
11 Joel Spencer: Balancing Unit Vectors. J. Comb. Theory, Ser. A 30(3): 349-350 (1981)
1980
10 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): 396-404 (1980)
1979
9 Joel Spencer: All Finite Configurations are Almost Ramsey. J. Comb. Theory, Ser. A 27(3): 401-403 (1979)
1978
8 Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer: Coping with Errors in Binary Search Procedures (Preliminary Report) STOC 1978: 227-232
7 John E. Olson, Joel H. Spencer: Balancing Families of Sets. J. Comb. Theory, Ser. A 25(1): 29-37 (1978)
6EENorbert Sauer, Joel Spencer: Edge disjoint placement of graphs. J. Comb. Theory, Ser. B 25(3): 295-302 (1978)
1977
5EEJoel Spencer: Balancing games. J. Comb. Theory, Ser. B 23(1): 68-74 (1977)
1975
4 Joel Spencer: Ramsey's Theorem - A New Lower Bound. J. Comb. Theory, Ser. A 18(1): 108-115 (1975)
3 Joel Spencer: Restricted Ramsey Configurations. J. Comb. Theory, Ser. A 19(3): 278-286 (1975)
1974
2 Joel Spencer: Puncture Sets. J. Comb. Theory, Ser. A 17(3): 329-336 (1974)
1973
1 Paul Erdös, Ronald L. Graham, P. Montgomery, B. L. Rothschild, Joel Spencer, Ernst G. Straus: Euclidean Ramsey Theorems I. J. Comb. Theory, Ser. A 14(3): 341-363 (1973)

Coauthor Index

1Miklós Ajtai [15]
2Noga Alon [30] [46] [55] [67] [85]
3József Beck [17] [19]
4Avrim Blum [54]
5Tom Bohman [97]
6Béla Bollobás [48] [70]
7Miklós Bóna [67]
8Ravi Boppona [32]
9Christian Borgs [62] [82] [91]
10Jennifer T. Chayes [62] [82] [91]
11Fan R. K. Chung (Fan Chung Graham) [20]
12Edward G. Coffman Jr. [69]
13Joshua N. Cooper [90] [94] [95] [99]
14Yevgeniy Dodis [76]
15Benjamin Doerr [94] [95] [99]
16Ioana Dumitriu [79] [81] [86]
17Paul Erdös [1] [20] [26] [33] [41] [48]
18Ralph J. Faudree [26]
19Tobias Friedrich [95] [99]
20Alan M. Frieze [97]
21Daniel M. Gordon [57]
22Ronald L. Graham [1]
23Remco van der Hofstad [82] [88] [91]
24Svante Janson [43] [73] [96]
25Katherine St. John [59] [61] [71] [89] [98]
26Michal Karonski [65]
27Harry Kesten [62]
28Jeong Han Kim [83]
29Daniel J. Kleitman [8] [10]
30János Komlós [15]
31Michael Krivelevich [85]
32Greg Kuperberg [57]
33Jeffrey C. Lagarias (J. C. Lagarias) [74]
34Tomasz Luczak [97]
35George S. Lueker [69]
36Albert R. Meyer [8] [10]
37Michael Mitzenmacher [80]
38P. Montgomery [1]
39Roberto Imbuzeiro Oliveira [80] [84]
40John E. Olson [7]
41János Pach [26] [28] [38] [63] [64] [66]
42Zbigniew Palka [21]
43Oren Patashnik [57]
44Oleg Pikhurko [83] [92] [93] [97]
45Janos Pintz [15]
46Nicholas Pippenger [31]
47Boris Pittel [56]
48Svatopluk Poljak [25]
49Dana Randall [73]
50Oliver Riordan [70]
51Ronald L. Rivest [8] [10]
52Vojtech Rödl [25]
53Bruce Rothschild (B. L. Rothschild) [1]
54Andrzej Rucinski [21]
55Norbert Sauer (Norbert W. Sauer) [6]
56Eli Shamir [23]
57Saharon Shelah [24] [50] [51]
58Gordon Slade [82] [91]
59Clifford D. Smyth [97]
60Ernst G. Straus [1]
61Tibor Szabó [85]
62Endre Szemerédi [15]
63Gábor Tardos [68] [94]
64Prasad Tetali [55]
65Géza Tóth [64] [66] [72]
66Gábor E. Tusnády [70]
67Oleg Verbitsky [83] [92] [93] [97]
68Jade P. Vinson [74]
69Douglas B. West [48]
70Peter Winkler (Peter M. Winkler) [44] [69]
71Karl Winklmann [8] [10]
72Nicholas C. Wormald [56]
73Catherine H. Yan [77]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)