Search the dblp DataBase
Joel Spencer :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Avrim Blum , Joel Spencer Coloring Random and Semi-Random k-Colorable Graphs. [Citation Graph (2, 0)][DBLP ] J. Algorithms, 1995, v:19, n:2, pp:204-234 [Journal ] Joel Spencer LIAR! [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:1-2 [Conf ] János Pach , Joel Spencer , Géza Tóth New Bounds on Crossing Numbers. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1999, pp:124-133 [Conf ] Yevgeniy Dodis , Joel Spencer On the (non)Universality of the One-Time Pad. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:376-0 [Conf ] Joel Spencer Erdös Magic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:106- [Conf ] Joel Spencer The design of a resilient network concentrator. [Citation Graph (0, 0)][DBLP ] ICCC, 1988, pp:518-523 [Conf ] Edward G. Coffman Jr. , George S. Lueker , Joel Spencer , Peter M. Winkler Average-Case Analysis of Retangle Packings. [Citation Graph (0, 0)][DBLP ] LATIN, 2000, pp:292-297 [Conf ] Joel Spencer Erdos Magic. [Citation Graph (0, 0)][DBLP ] LATIN, 2002, pp:3- [Conf ] Joel Spencer The Probabilistic Method. [Citation Graph (0, 0)][DBLP ] SODA, 1992, pp:41-47 [Conf ] Joel Spencer , Katherine St. John Random Sparse Bit Strings at the Threshold of Adjacency. [Citation Graph (0, 0)][DBLP ] STACS, 1998, pp:94-104 [Conf ] Ronald L. Rivest , Albert R. Meyer , Daniel J. Kleitman , Karl Winklmann , Joel Spencer Coping with Errors in Binary Search Procedures (Preliminary Report) [Citation Graph (0, 0)][DBLP ] STOC, 1978, pp:227-232 [Conf ] Saharon Shelah , Joel Spencer Threshold Spectra for Random Graphs [Citation Graph (0, 0)][DBLP ] STOC, 1987, pp:421-424 [Conf ] Oleg Pikhurko , Joel Spencer , Oleg Verbitsky Succinct definitions in the first order theory of graphs. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2006, v:139, n:1-3, pp:74-109 [Journal ] József Beck , Joel Spencer Balancing matrices with line shifts. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1983, v:3, n:3, pp:299-304 [Journal ] Béla Bollobás , Paul Erdös , Joel Spencer , Douglas B. West Clique coverings of the edges of a random graph. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1993, v:13, n:1, pp:1-5 [Journal ] Christian 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. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2006, v:26, n:4, pp:395-410 [Journal ] János Pach , Joel Spencer Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1999, v:19, n:1, pp:111-124 [Journal ] Eli Shamir , Joel Spencer Sharp concentration of the chromatic number on random graphs Gn, p . [Citation Graph (0, 0)][DBLP ] Combinatorica, 1987, v:7, n:1, pp:121-129 [Journal ] Joel Spencer Suresums. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:2, pp:203-208 [Journal ] Joel Spencer Extremal problems, partition theorems, symmetric hypergraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:3, pp:303-307 [Journal ] Joel Spencer What's not inside a Cayley graph. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1983, v:3, n:2, pp:239-241 [Journal ] Joel Spencer Balancing vectors in the max norm. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1986, v:6, n:1, pp:55-66 [Journal ] Joel Spencer Infinite spectra in the first order theory of graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1990, v:10, n:1, pp:95-102 [Journal ] Joel Spencer , Gábor Tardos Ups and Downs of First Order Sentences on Random Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2000, v:20, n:2, pp:263-280 [Journal ] Noga Alon , Miklós Bóna , Joel Spencer Packing Ferrers Shapes. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2000, v:9, n:3, pp:- [Journal ] Joel Spencer , Peter Winkler Three Thresholds for a Liar. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1992, v:1, n:, pp:81-93 [Journal ] Noga Alon , Joel Spencer , Prasad Tetali Covering with Latin Transversals. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1995, v:57, n:1, pp:1-10 [Journal ] János Pach , Joel Spencer , Géza Tóth New Bounds on Crossing Numbers. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2000, v:24, n:4, pp:623-644 [Journal ] Remco van der Hofstad , Joel Spencer Counting connected graphs asymptotically. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2006, v:27, n:8, pp:1294-1320 [Journal ] Ronald L. Rivest , Albert R. Meyer , Daniel J. Kleitman , Karl Winklmann , Joel Spencer Coping with Errors in Binary Search Procedures. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1980, v:20, n:3, pp:396-404 [Journal ] Miklós Ajtai , János Komlós , Janos Pintz , Joel Spencer , Endre Szemerédi Extremal Uncrowded Hypergraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1982, v:32, n:3, pp:321-335 [Journal ] József Beck , Joel Spencer Unit Distances. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:231-238 [Journal ] Paul Erdös , Ronald L. Graham , P. Montgomery , B. L. Rothschild , Joel Spencer , Ernst G. Straus Euclidean Ramsey Theorems I. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1973, v:14, n:3, pp:341-363 [Journal ] Daniel M. Gordon , Oren Patashnik , Greg Kuperberg , Joel Spencer Asymptotically Optimal Covering Designs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:75, n:2, pp:270-280 [Journal ] Boris Pittel , Joel Spencer , Nicholas C. Wormald Sudden Emergence of a Giantk -Core in a Random Graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1996, v:67, n:1, pp:111-151 [Journal ] Joel Spencer Puncture Sets. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1974, v:17, n:3, pp:329-336 [Journal ] Joel Spencer Ramsey's Theorem - A New Lower Bound. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1975, v:18, n:1, pp:108-115 [Journal ] Joel Spencer Restricted Ramsey Configurations. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1975, v:19, n:3, pp:278-286 [Journal ] Joel Spencer All Finite Configurations are Almost Ramsey. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1979, v:27, n:3, pp:401-403 [Journal ] Joel Spencer Coloring n-Sets Red and Blue. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1981, v:30, n:1, pp:112-113 [Journal ] Joel Spencer Balancing Unit Vectors. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1981, v:30, n:3, pp:349-350 [Journal ] Joel Spencer Canonical Configurations. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1983, v:34, n:3, pp:325-330 [Journal ] Joel Spencer A Useful Elementary Correlation Inequality, II. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1998, v:84, n:1, pp:95-98 [Journal ] Joel Spencer , Catherine H. Yan The halflie problem. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2003, v:103, n:1, pp:69-89 [Journal ] Norbert Sauer , Joel Spencer Edge disjoint placement of graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:295-302 [Journal ] Joel Spencer Balancing games. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1977, v:23, n:1, pp:68-74 [Journal ] Joel Spencer Zero-One Laws with Variable Probability. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1993, v:58, n:1, pp:1-14 [Journal ] Béla Bollobás , Oliver Riordan , Joel Spencer , Gábor E. Tusnády The degree sequence of a scale-free random graph process. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2001, v:18, n:3, pp:279-290 [Journal ] Christian Borgs , Jennifer T. Chayes , Harry Kesten , Joel Spencer Uniform boundedness of critical crossing probabilities implies hyperscaling. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1999, v:15, n:3-4, pp:368-413 [Journal ] Svante Janson , Dana Randall , Joel Spencer Random dyadic tilings of the unit square. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:21, n:3-4, pp:225-251 [Journal ] Svante Janson , Joel Spencer Probabilistic Construction of Proportional Graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1992, v:3, n:2, pp:127-138 [Journal ] Michal Karonski , Joel Spencer Ten Years! [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2000, v:16, n:1, pp:1-3 [Journal ] Saharon Shelah , Joel Spencer Can You Feel the Double Jump? [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1994, v:5, n:1, pp:191-204 [Journal ] Saharon Shelah , Joel Spencer Random Sparse Unary Predicates. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1994, v:5, n:3, pp:375-394 [Journal ] Joel Spencer Countable Sparse Random Graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1990, v:1, n:2, pp:205-214 [Journal ] Joel Spencer Asymptotic Packing via a Branching Process. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1995, v:7, n:2, pp:167-172 [Journal ] Joel Spencer , Katherine St. John Random unary predicates: Almost sure theories and countable models. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1998, v:13, n:3-4, pp:229-248 [Journal ] Joel Spencer , Géza Tóth Crossing numbers of random graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:21, n:3-4, pp:347-358 [Journal ] Svatopluk Poljak , Vojtech Rödl , Joel Spencer Tournament Ranking with Expected Profit in Polynomial Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1988, v:1, n:3, pp:372-376 [Journal ] Ioana Dumitriu , Joel Spencer A Halfliar's game. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:303, n:3, pp:353-369 [Journal ] Joel Spencer Ulam's Searching Game with a Fixed Number of Lies. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:95, n:2, pp:307-321 [Journal ] Joel Spencer Randomization, Derandomization and Antirandomization: Three Games. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:131, n:2, pp:415-429 [Journal ] János Pach , Joel Spencer Explicit codes with low covering radius. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1281-1285 [Journal ] Zbigniew Palka , Andrzej Rucinski , Joel Spencer On a method for random graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1986, v:61, n:2-3, pp:253-258 [Journal ] Joel Spencer Coloring the projective plane. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:73, n:1-2, pp:213-220 [Journal ] Joel Spencer From Erdös to algorithms. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:136, n:1-3, pp:295-307 [Journal ] Deterministic random walks on regular trees. [Citation Graph (, )][DBLP ] Synchrony and Asynchrony in Neural Networks. [Citation Graph (, )][DBLP ] Discrepancy Games. [Citation Graph (, )][DBLP ] Deterministic Random Walks on Regular Trees [Citation Graph (, )][DBLP ] First-Order Definability of Trees and Sparse Random Graphs. [Citation Graph (, )][DBLP ] Simulating a Random Walk with Constant Error. [Citation Graph (, )][DBLP ] A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. [Citation Graph (, )][DBLP ] Lopsided Lovász Local Lemma and Latin transversals. [Citation Graph (, )][DBLP ] Threshold spectra via the Ehrenfeucht game. [Citation Graph (, )][DBLP ] On the Size of Induced Acyclic Subgraphs in Random Digraphs. [Citation Graph (, )][DBLP ] Decomposable graphs and definitions with no quantifier alternation. [Citation Graph (, )][DBLP ] Search in 0.072secs, Finished in 0.076secs