Joel Spencer - RankMe

108 papers A* 6A 2B 2C 1Misc 1Journal 87Unranked 5

Year	Rank	Type	Title / Venue / Authors
2019	J	`jnl`	Existential monadic second order logic on random rooted trees. Discret. Math. Alexander E. Holroyd, Avi Levy, Moumanti Podder, Joel Spencer
2018	J	`jnl`	Preferential Attachment When Stable. CoRR Svante Janson, Subhabrata Sen, Joel Spencer
2016	J	`jnl`	On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer
2013	J	`jnl`	Deterministic Discrepancy Minimization. Algorithmica Nikhil Bansal, Joel Spencer
2013	—	`ch.`	Erdős Magic. The Mathematics of Paul Erdős I Joel Spencer
2013	J	`jnl`	Queueing with future information. SIGMETRICS Perform. Evaluation Rev. Joel Spencer, Madhu Sudan, Kuang Xu
2013	J	`jnl`	The Bohman-Frieze process near criticality. Random Struct. Algorithms Mihyun Kang, Will Perkins, Joel Spencer
2013	—	`ch.`	The Erdős Existence Argument. The Mathematics of Paul Erdős I Joel Spencer
2012	J	`jnl`	Queueing with Future Information CoRR Joel Spencer, Madhu Sudan, Kuang Xu
2011	A	`conf`	Deterministic Discrepancy Minimization. ESA Nikhil Bansal, Joel Spencer
2011	J	`jnl`	Proppian random walks in Z. Discret. Math. Juliana Freire, Joel Spencer
2010	J	`jnl`	Complexity and effective prediction. Games Econ. Behav. Abraham Neyman, Joel Spencer
2010	J	`jnl`	Deterministic Random Walks on Regular Trees CoRR Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2010	J	`jnl`	Deterministic random walks on regular trees. Random Struct. Algorithms Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2010	J	`jnl`	Phase transitions for random structures and algorithms. Random Struct. Algorithms Joel Spencer
2010	A*	`conf`	Synchrony and Asynchrony in Neural Networks. SODA Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger
2010	J	`jnl`	The second largest component in the supercritical 2D Hamming graph. Random Struct. Algorithms Remco van der Hofstad, Malwina J. Luczak, Joel Spencer
2008	A*	`conf`	Deterministic random walks on regular trees. SODA Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2008	J	`jnl`	On the Size of Induced Acyclic Subgraphs in Random Digraphs. Discret. Math. Theor. Comput. Sci. Joel Spencer, C. R. Subramanian
2007	J	`jnl`	A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. Comb. Probab. Comput. Svante Janson, Joel Spencer
2007	J	`jnl`	Decomposable graphs and definitions with no quantifier alternation. Eur. J. Comb. Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
2007	J	`jnl`	Deterministic Random Walks on Regular Trees. Electron. Notes Discret. Math. Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2007	—	`book`	Finite Model Theory and Its Applications Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein
2007	J	`jnl`	First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky
2006	J	`jnl`	Counting connected graphs asymptotically. Eur. J. Comb. Remco van der Hofstad, Joel Spencer
2006	—	`conf`	Deterministic Random Walks. ANALCO Joshua N. Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos
2006	J	`jnl`	Random Subgraphs Of Finite Graphs: III. The Phase Transition For The Comb. Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer
2006	J	`jnl`	Simulating a Random Walk with Constant Error. Comb. Probab. Comput. Joshua N. Cooper, Joel Spencer
2006	J	`jnl`	Succinct definitions in the first order theory of graphs. Ann. Pure Appl. Log. Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
2005	J	`jnl`	Discrepancy Games. Electron. J. Comb. Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó
2005	—	`conf`	Erdös Magic. FSTTCS Joel Spencer
2004	J	`jnl`	A Halfliar's game. Theor. Comput. Sci. Ioana Dumitriu, Joel Spencer
2003	Misc	`conf`	LIAR! COCOON Joel Spencer
2003	J	`jnl`	The halflie problem. J. Comb. Theory A Joel Spencer, Catherine H. Yan
2002	J	`jnl`	Crossing numbers of random graphs. Random Struct. Algorithms Joel Spencer, Géza Tóth
2002	B	`conf`	Erdős Magic. LATIN Joel Spencer
2002	A*	`conf`	On the (non)Universality of the One-Time Pad. FOCS Yevgeniy Dodis, Joel Spencer
2002	J	`jnl`	Random dyadic tilings of the unit square. Random Struct. Algorithms Svante Janson, Dana Randall, Joel Spencer
2001	J	`jnl`	The degree sequence of a scale-free random graph process. Random Struct. Algorithms Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor E. Tusnády
2000	B	`conf`	Average-Case Analysis of Retangle Packings. LATIN Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler
2000	J	`jnl`	New Bounds on Crossing Numbers. Discret. Comput. Geom. János Pach, Joel Spencer, Géza Tóth
2000	J	`jnl`	Packing Ferrers Shapes. Comb. Probab. Comput. Noga Alon, Miklós Bóna, Joel Spencer
2000	J	`jnl`	Ten Years! Random Struct. Algorithms Michal Karonski, Joel Spencer
2000	J	`jnl`	Ups and Downs of First Order Sentences on Random Graphs. Comb. Joel Spencer, Gábor Tardos
1999	—	`conf`	New Bounds on Crossing Numbers. SCG János Pach, Joel Spencer, Géza Tóth
1999	J	`jnl`	Uniform boundedness of critical crossing probabilities implies hyperscaling. Random Struct. Algorithms Christian Borgs, Jennifer T. Chayes, Harry Kesten, Joel Spencer
1999	J	`jnl`	Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. Comb. János Pach, Joel Spencer
1998	J	`jnl`	A Useful Elementary Correlation Inequality, II. J. Comb. Theory A Joel Spencer
1998	A	`conf`	Random Sparse Bit Strings at the Threshold of Adjacency. STACS Joel Spencer, Katherine St. John
1998	J	`jnl`	Random unary predicates: Almost sure theories and countable models. Random Struct. Algorithms Joel Spencer, Katherine St. John
1997	—	`conf`	On the limit values of probabilities for the first order properties of graphs. Contemporary Trends in Discrete Mathematics Joel Spencer, Lubos Thoma
1996	J	`jnl`	Asymptotically Optimal Covering Designs. J. Comb. Theory A Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer
1996	J	`jnl`	Sudden Emergence of a Giant J. Comb. Theory B Boris G. Pittel, Joel Spencer, Nicholas C. Wormald
1995	J	`jnl`	Asymptotic Packing via a Branching Process. Random Struct. Algorithms Joel Spencer
1995	J	`jnl`	Coloring Random and Semi-Random k-Colorable Graphs. J. Algorithms Avrim Blum, Joel Spencer
1995	J	`jnl`	Covering with Latin Transversals. Discret. Appl. Math. Noga Alon, Joel Spencer, Prasad Tetali
1995	—	`conf`	Smoothness laws for random ordered graphs. Logic and Random Structures Ravi Bopu Boppana, Joel Spencer
1994	J	`jnl`	Can You Feel the Double Jump? Random Struct. Algorithms Saharon Shelah, Joel Spencer
1994	J	`jnl`	From Erdös to algorithms. Discret. Math. Joel Spencer
1994	J	`jnl`	Random Sparse Unary Predicates. Random Struct. Algorithms Saharon Shelah, Joel Spencer
1994	J	`jnl`	Randomization, Derandomization and Antirandomization: Three Games. Theor. Comput. Sci. Joel Spencer
1993	J	`jnl`	Clique coverings of the edges of a random graph. Comb. Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West
1993	J	`jnl`	Zero-One Laws with Variable Probability. J. Symb. Log. Joel Spencer
1992	J	`jnl`	Probabilistic Construction of Proportional Graphs. Random Struct. Algorithms Svante Janson, Joel Spencer
1992	—	`book`	The Probabilistic Method Noga Alon, Joel Spencer
1992	A*	`conf`	The Probabilistic Method. SODA Joel Spencer
1992	J	`jnl`	Three Thresholds for a Liar. Comb. Probab. Comput. Joel Spencer, Peter Winkler
1992	J	`jnl`	Ulam's Searching Game with a Fixed Number of Lies. Theor. Comput. Sci. Joel Spencer
1991	J	`jnl`	Lopsided Lovász Local Lemma and Latin transversals. Discret. Appl. Math. Paul Erdös, Joel Spencer
1991	J	`jnl`	Threshold spectra via the Ehrenfeucht game. Discret. Appl. Math. Joel Spencer
1990	J	`jnl`	Countable Sparse Random Graphs. Random Struct. Algorithms Joel Spencer
1990	J	`jnl`	Extremal subgraphs of random graphs. J. Graph Theory László Babai, Miklós Simonovits, Joel Spencer
1990	J	`jnl`	Infinite spectra in the first order theory of graphs. Comb. Joel Spencer
1989	J	`jnl`	Coloring the projective plane. Discret. Math. Joel Spencer
1988	J	`jnl`	Cutting a graph into two dissimilar halves. J. Graph Theory Paul Erdös, Mark Goldberg, János Pach, Joel Spencer
1988	J	`jnl`	Explicit codes with low covering radius. IEEE Trans. Inf. Theory János Pach, Joel Spencer
1988	C	`conf`	The design of a resilient network concentrator. ICCC Joel Spencer
1988	J	`jnl`	Tournament Ranking with Expected Profit in Polynomial Time. SIAM J. Discret. Math. Svatopluk Poljak, Vojtech Rödl, Joel Spencer
1987	J	`jnl`	Sharp concentration of the chromatic number on random graphs G Comb. Eli Shamir, Joel Spencer
1987	A*	`conf`	Threshold Spectra for Random Graphs STOC Saharon Shelah, Joel Spencer
1986	J	`jnl`	Balancing vectors in the max norm. Comb. Joel Spencer
1986	J	`jnl`	Discrepancy of Set-systems and Matrices. Eur. J. Comb. László Lovász, Joel Spencer, Katalin Vesztergombi
1986	J	`jnl`	On a method for random graphs. Discret. Math. Zbigniew Palka, Andrzej Rucinski, Joel Spencer
1985	J	`jnl`	Probabilistic methods. Graphs Comb. Joel Spencer
1984	J	`jnl`	Integral approximation sequences. Math. Program. József Beck, Joel Spencer
1984	J	`jnl`	Unit Distances. J. Comb. Theory A József Beck, Joel Spencer
1983	J	`jnl`	Balancing matrices with line shifts. Comb. József Beck, Joel Spencer
1983	J	`jnl`	Canonical Configurations. J. Comb. Theory A Joel Spencer
1983	J	`jnl`	Ramsey theory and Ramsey theoreticians. J. Graph Theory Joel Spencer
1983	J	`jnl`	What's not inside a Cayley graph. Comb. Joel Spencer
1982	J	`jnl`	Extremal Uncrowded Hypergraphs. J. Comb. Theory A Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi
1981	J	`jnl`	Balancing Unit Vectors. J. Comb. Theory A Joel Spencer
1981	J	`jnl`	Coloring n-Sets Red and Blue. J. Comb. Theory A Joel Spencer
1981	J	`jnl`	Discrete Ham Sandwich Theorems. Eur. J. Comb. Joel Spencer
1981	J	`jnl`	Extremal problems, partition theorems, symmetric hypergraphs. Comb. Joel Spencer
1981	J	`jnl`	Suresums. Comb. Joel Spencer
1980	J	`jnl`	Coping with Errors in Binary Search Procedures. J. Comput. Syst. Sci. Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
1979	J	`jnl`	All Finite Configurations are Almost Ramsey. J. Comb. Theory A Joel Spencer
1978	A*	`conf`	Coping with Errors in Binary Search Procedures (Preliminary Report) STOC Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
1978	J	`jnl`	Edge disjoint placement of graphs. J. Comb. Theory B Norbert Sauer, Joel Spencer
1977	J	`jnl`	Asymptotic lower bounds for Ramsey functions. Discret. Math. Joel Spencer
1977	J	`jnl`	Balancing games. J. Comb. Theory B Joel Spencer
1975	J	`jnl`	Optimal Doubling in Backgammon. Oper. Res. Emmett B. Keeler, Joel Spencer
1975	J	`jnl`	Ramsey's Theorem - A New Lower Bound. J. Comb. Theory A Joel Spencer
1975	J	`jnl`	Restricted Ramsey Configurations. J. Comb. Theory A Joel Spencer
1974	J	`jnl`	Puncture Sets. J. Comb. Theory A Joel Spencer
1973	J	`jnl`	Euclidean Ramsey Theorems I. J. Comb. Theory A Paul Erdös, Ronald L. Graham, Peter Montgomery, Bruce Lee Rothschild, Joel Spencer, Ernst G. Straus
1972	J	`jnl`	Turán's theorem for k-graphs. Discret. Math. Joel Spencer