Search the dblp DataBase

Publications of Author

1. Ioana Dumitriu, Joel H. Spencer
   The Liar Game Over an Arbitrary Channel. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2005, v:25, n:5, pp:537-559 [Journal]
   
2. Michael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer
   A Scaling Result for Explosive Processes. [Citation Graph (0, 0)][DBLP]
   Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
   
3. Joel H. Spencer
   Real time asymptotic packing. [Citation Graph (0, 0)][DBLP]
   Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
   
4. Joel H. Spencer, Katherine St. John
   The Tenacity of Zero-One Laws. [Citation Graph (0, 0)][DBLP]
   Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
   
5. Jeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson
   Counting dyadic equipartitions of the unit square. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:257, n:2-3, pp:481-499 [Journal]
   
6. Joel H. Spencer, Katherine St. John
   The Complexity of Random Ordered Structures. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2006, v:143, n:, pp:197-206 [Journal]
   
7. Noga Alon, Joel H. Spencer
   Ascending waves. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:275-287 [Journal]
   
8. Ravi Boppona, Joel H. Spencer
   A useful elementary correlation inequality. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1989, v:50, n:2, pp:305-307 [Journal]
   
9. Fan R. K. Chung, Paul Erdös, Joel H. Spencer
   Extremal subgraphs for two graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:248-260 [Journal]
   
10. Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer
    How to make a graph bipartite. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:86-98 [Journal]
    
11. Paul Erdös, Joel H. Spencer
    Monochromatic sumsets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:50, n:1, pp:162-163 [Journal]
    
12. John E. Olson, Joel H. Spencer
    Balancing Families of Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:25, n:1, pp:29-37 [Journal]
    
13. Nicholas Pippenger, Joel H. Spencer
    Asymptotic behavior of the chromatic index for hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:51, n:1, pp:24-42 [Journal]
    
14. Joel H. Spencer
    Three hundred million points suffice. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:210-217 [Journal]
    
15. Joel H. Spencer
    Counting extensions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:55, n:2, pp:247-255 [Journal]
    
16. Joel H. Spencer
    Threshold functions for extension statements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:53, n:2, pp:286-305 [Journal]
    
17. Christian 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. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:27, n:2, pp:137-184 [Journal]
    
18. Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky
    How complex are random graphs in first order logic? [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:1-2, pp:119-145 [Journal]
    
19. Ioana Dumitriu, Joel H. Spencer
    The Two-Batch Liar Game over an Arbitrary Channel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:1056-1064 [Journal]
    
20. János Pach, Joel H. Spencer
    Note on vertex-partitions of infinite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:1, pp:107-108 [Journal]
    
21. 
    The complexity of random ordered structures. [Citation Graph (, )][DBLP]
    
    
22. 
    Birth control for giants. [Citation Graph (, )][DBLP]
    
    
23. 
    Deterministic random walks on the integers. [Citation Graph (, )][DBLP]