Joel Spencer

Q: What Schools Are Affiliated With Joel Spencer

Joel Spencer is affiliated with the following schools: University of California, Los Angeles, Massachusetts Institute of Technology, New York University, Harvard University

Joel Spencer's AcademicInfluence.com Rankings

Joel Spencer

Mathematics

#313

World Rank

#666

Historical Rank

#150

USA Rank

Measure Theory

#382

World Rank

#562

Historical Rank

#163

USA Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Joel Spencer Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Joel Spencer is an American mathematician. He is a combinatorialist who has worked on probabilistic methods in combinatorics and on Ramsey theory. He received his doctorate from Harvard University in 1970, under the supervision of Andrew Gleason. He is currently a professor at the Courant Institute of Mathematical Sciences of New York University. Spencer's work was heavily influenced by Paul Erdős, with whom he coauthored many papers .

(See a Problem?)

Joel Spencer's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Probabilistic Method (1992) (6348)
The degree sequence of a scale‐free random graph process (2001) (814)
Ramsey Theory (1990) (713)
The Probabilistic Method: Alon/Probabilistic Method (2004) (624)
Probabilistic Methods in Combinatorics (1974) (503)
Ten lectures on the probabilistic method (1987) (491)
Explosive Percolation in Random Networks (2009) (471)
The Probabilistic Method: Alon/Probabilistic (2008) (420)
Sudden Emergence of a Giantk-Core in a Random Graph (1996) (408)
The Strange Logic of Random Graphs (2001) (319)
Six standard deviations suffice (1985) (294)
The Probabilistic Method, Second Edition (2000) (276)
Asymptotic lower bounds for Ramsey functions (1977) (252)
Families of k-independent sets (1973) (234)
Ecole D'Ete De Probabilites De Saint-Flour Xxi-1991 (1993) (225)
Zero-one laws for sparse random graphs (1988) (212)
Finite Model Theory and Its Applications (2007) (202)
Asymptotic behavior of the chromatic index for hypergraphs (1989) (196)
Unit distances in the Euclidean plane (1984) (195)
Coping with Errors in Binary Search Procedures (1980) (193)
Edge disjoint placement of graphs (1978) (187)
Sharp concentration of the chromatic number on random graphsGn, p (1987) (169)
Lopsided Lovász Local Lemma and Latin transversals (1991) (167)
Coloring Random and Semi-Random k-Colorable Graphs (1995) (166)
Ramsey's Theorem - A New Lower Bound (1975) (165)
Discrepancy of Set-systems and Matrices (1986) (131)
Euclidean Ramsey Theorems I (1973) (111)
Minimal scrambling sets of simple orders (1972) (107)
Birth control for giants (2007) (106)
Simulating a Random Walk with Constant Error (2004) (104)
EVOLUTION OF THE n-CUBE (1979) (100)
The Birth of the Infinite Cluster:¶Finite-Size Scaling in Percolation (2001) (100)
Random subgraphs of finite graphs: I. The scaling window under the triangle condition (2004) (99)
Nearly perfect matchings in regular simple hypergraphs (1997) (99)
Balancing vectors in the max norm (1986) (99)
The Probabilistic Method, Third Edition (2008) (99)
Ulam's Searching Game with a Fixed Number of Lies (1992) (94)
Random subgraphs of finite graphs : II. The lace expansion and the triangle condition (2004) (94)
Extremal Uncrowded Hypergraphs (1982) (90)
The Elementary Proof of the Prime Number Theorem (2009) (90)
Wiley‐Interscience Series in Discrete Mathematics and Optimization (2004) (89)
A Characterization of Clique Graphs. (1971) (88)
Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series) (2005) (83)
Counting extensions (1990) (81)
How to make a graph bipartite (1987) (78)
Discrepancy in arithmetic progressions (1996) (77)
Ramsey theorems for multiple copies of graphs (1975) (74)
Turán's theorem for k-graphs (1972) (74)
Intersection Theorems for Systems of Sets (1977) (73)
Connectivity Transitions in Networks with Super-Linear Preferential Attachment (2005) (72)
Disks, balls, and walls: analysis of a combinatorial game (1989) (70)
On the (non)universality of the one-time pad (2002) (67)
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube (2004) (66)
Three Thresholds for a Liar (1992) (64)
Ten Lectures on the Probabilistic Method: Second Edition (1994) (62)
Threshold functions for extension statements (1990) (61)
ENUMERATING GRAPHS AND BROWNIAN MOTION (1997) (58)
Optimal ranking of tournaments (1971) (58)
Balancing games (1977) (57)
Minimal completely separating systems (1970) (56)
Maximal consistent families of triples (1968) (54)
A useful elementary correlation inequality (1989) (53)
On graphs which contain all sparse graphs (1982) (51)
Probabilistic methods (1985) (50)
Asymptotic Packing via a Branching Process (1995) (49)
The number of semigroups of order n (1976) (48)
Imbalances in k-colorations (1971) (48)
Guess a number - with lying (1984) (48)
Uniform boundedness of critical crossing probabilities implies hyperscaling (1999) (47)
Deterministic random walks on the integers (2006) (46)
The Probablistic Method (2000) (44)
Coloring n-Sets Red and Blue (1981) (43)
Deterministic random walks on regular trees (2007) (43)
A Dynamic View (2001) (42)
On the decomposition of graphs into complete bipartite subgraphs (1983) (42)
Strong Independence of Graphcopy Functions (1979) (42)
Threshold spectra via the Ehrenfeucht game (1991) (41)
New Bounds on Crossing Numbers (1999) (40)
Integral approximation sequences (1984) (39)
On the mean distance between points of a graph (1988) (38)
Cutting a graph into two dissimilar halves (1988) (36)
Three hundred million points suffice (1988) (36)
Ramsey’s theorem for spaces (1979) (35)
Strong independence of graph copy functions (1978) (34)
Phase transitions for modified Erdős–Rényi processes (2010) (33)
An Asymptotic Isoperimetric Inequality (1998) (33)
Minimization of ±1 matrices under line shifts (1971) (31)
Randomization, Derandomization and Antirandomization: Three Games (1994) (31)
Paul Erdös : the art of counting : selected writings (1973) (30)
Counting connected graphs asymptotically (2005) (30)
How complex are random graphs in first order logic? (2004) (29)
Restricted Ramsey Configurations (1975) (28)
Euclidean Ramsey theorems III: Infinite and finite sets (1973) (28)
Extremal subgraphs of random graphs (1990) (26)
Deterministic Discrepancy Minimization (2011) (25)
Dynamics of Stochastic Neuronal Networks and the Connections to Random Graph Theory (2010) (25)
Queuing with future information (2012) (25)
Asymptotically Optimal Covering Designs (1995) (25)
Crossing numbers of random graphs (2002) (24)
Optimally ranking unrankable tournaments (1980) (23)
New Bounds on Crossing Numbers (2000) (23)
Tournament Ranking with Expected Profit in Polynomial Time (1988) (23)
The Elementary Proof of the Prime (2009) (23)
Infinite spectra in the first order theory of graphs (1990) (23)
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution (2005) (22)
On the Length of a Random Minimum Spanning Tree (2012) (22)
The Bohman‐Frieze process near criticality (2011) (22)
Optimal Doubling in Backgammon (1975) (21)
A deception game (1973) (21)
Nine lectures on random graphs (1993) (21)
Succinct definitions in the first order theory of graphs (2004) (20)
Random regular tournaments (1974) (20)
Queueing with future information (2014) (20)
When does the zero-one law hold? (1991) (20)
Clique coverings of the edges of a random graph (1993) (20)
Balancing Families of Sets (1978) (19)
On small graphs with forced monochromatic triangles (1971) (19)
On‐line balancing of random inputs (2019) (19)
The Liar Game Over an Arbitrary Channel (2005) (19)
The Two-Batch Liar Game over an Arbitrary Channel (2005) (18)
A Scaling Result for Explosive Processes (2004) (18)
Asymptotically good coverings (1985) (17)
Nonconstructive methods in discrete mathematics (1978) (16)
Set systems with no union of cardinality 0 modulom (1991) (16)
Ascending waves (1989) (16)
The discrepancy of permutation families (1997) (16)
Zero-one laws with variable probability (1993) (15)
Covering with Latin Transversals (1995) (14)
Deterministic Random Walks (2006) (14)
Random dyadic tilings of the unit square (2002) (13)
Gaps in Difference Sets, and the Graph of Nearly Equal Distances (1990) (13)
Balancing matrices with line shifts (1983) (13)
Packing random rectangles (1999) (13)
Random Sparse Unary Predicates (1994) (13)
Explicit codes with low covering radius (1988) (13)
A Generalized Rota Conjecture for Partitions (1974) (12)
Unit Distances (1984) (12)
Short theorems with long proofs (1983) (12)
On the Size of Induced Acyclic Subgraphs in Random Digraphs (2008) (12)
Pulse processes on signed digraphs: a tool for analyzing energy demand (1972) (12)
Large numbers and unprovable theorems (1983) (11)
Well-distributed 2-colorings of integers relative to long arithmetic progressions (1984) (11)
Eighty Years of Ramsey R (3, k )…and Counting! (2011) (11)
The halflie problem (2003) (11)
A Halfliar's game (2004) (10)
Ramsey theory and Ramsey theoreticians (1983) (10)
A problem in covering progressions (1994) (10)
The biplanar crossing number of the random graph (2004) (10)
On extremal density theorems for linear forms (1977) (9)
Discrepancy Games (2005) (9)
Coping with errors in binary search procedures (Preliminary Report) (1978) (9)
Threshold spectra for random graphs (1987) (9)
Smoothness laws for random ordered graphs (1995) (8)
Probabilistic Construction of Proportional Graphs (1992) (8)
Can You Feel the Double Jump? (1994) (8)
A Remark on Coloring Integers (1972) (8)
First-Order Definability of Trees and Sparse Random Graphs (2005) (8)
Sequences with small discrepancy relative to n events (1982) (7)
On the limit values of probabilities for the first order properties of graphs (1997) (7)
Random unary predicates: Almost sure theories and countable models (1998) (7)
First Order Probabilities For Galton-Watson Trees (2015) (7)
Four Squares with Few Squares (1996) (7)
Avoiding defeat in a balls-in-bins process with feedback (2005) (7)
Counting dyadic equipartitions of the unit square (2002) (7)
The second largest component in the supercritical 2D Hamming graph (2008) (7)
Counting magic squares (1980) (7)
Robin Moser makes Lovász Local Lemma Algorithmic ! Notes of (2009) (7)
Complexity and effective prediction (2006) (7)
Synchrony and asynchrony in neural networks (2010) (7)
Bounded quantifier depth spectra for random graphs (2016) (6)
Graph Distance and Euclidean Distance on the Grid (1990) (6)
Countable Sparse Random Graphs (1990) (6)
Nonconvergence in the theory of random orders (1990) (6)
Branching Processes with Negative Offspring Distributions (2003) (6)
Intentionally complemented distributive lattices (1966) (6)
New Results on the Distribution of Distances Determined By Separated Point Sets (2001) (6)
Monochromatic sumsets (1989) (6)
Random subgraphs of finite graphs. Part III: The phase transition for the n-cube (2003) (6)
Galton-Watson Probability Contraction (2015) (6)
Decomposable graphs and definitions with no quantifier alternation (2007) (5)
On a method for random graphs (1986) (5)
SIDON SETS WITH SMALL GAPS (1995) (5)
Puncture Sets (1974) (5)
Shelah Saharon. Primitive recursive bounds for van der Waerden numbers. Journal of the American Mathematical Society , vol. 1 (1988), pp. 683–697. (1990) (5)
Coloring the projective plane (1989) (4)
Discrete Ham Sandwich Theorems (1981) (4)
.1 Results (4)
The complexity of random ordered structures (2008) (4)
The Tenacity of Zero-One Laws (2000) (4)
Using GIS to determine travel times to hospitals (1993) (4)
On cliques in graphs (1971) (4)
Social Media: Online Versus Traditional Universities and Developing Communities? (2017) (4)
The Basic Method (2004) (4)
A general Ramsey product theorem (1979) (4)
A Tribute to Paul Erdős: The probabilistic lens: Sperner, Turan and Bregman revisited (1990) (3)
Second order logic on random rooted trees (2017) (3)
Factorizing the Complete Graph into Factors with Large Star Number (1975) (3)
From Erdös to algorithms (1994) (3)
A Note on Triangle-Free Graphs (1996) (3)
Canonical Configurations (1983) (3)
Modern probabilistic methods in combinatorics (1995) (3)
Extremal problems, partition theorems, symmetric hypergraphs (1981) (3)
The Second Moment (2004) (3)
NOTES ON COMBINATORIAL MATHEMATICS: TRANSITIVE SUBTOURNAMENTS, (1969) (2)
Real time asymtotic packing (1997) (2)
Sparse random graphs: A continuum of complete theories (1991) (2)
Ultrahigh Moments for a Brownian Excursion (2000) (2)
The Erdős Existence Argument (2013) (2)
Maximal asymmetry of graphs (1976) (2)
Directed graphs as unions of partial orders. (1971) (2)
A Useful Elementary Correlation Inequality, II (1998) (2)
Probalistic methods in combinatorial math (1974) (2)
The probalistic method (2000) (2)
Extremal subgraphs for two graphs (1985) (2)
Ups and Downs of First Order Sentences on Random Graphs (2000) (2)
SHOULD WE UNDO THE FLAT ORGANIZATION: ACCOMMODATING NEEDY MILLENNIAL GENERATION WORKERS (2015) (2)
Subgraphs of large minimal degree (1992) (2)
Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science (1995) (2)
Appendix A: Bounding of Large Deviations (2004) (2)
The Main Theorem (2001) (1)
The Erdos-Hanani conjecture via Talagrand's inequality (1994) (1)
Six Sigmas Suffice (1989) (1)
Random Sparse Bit Strings at the Threshold of Adjacency (1998) (1)
A Ball-Distribution Problem and the Branching Process (1999) (1)
All Finite Configurations are Almost Ramsey (1979) (1)
Organizations' Use of LinkedIn: Small Businesses Outpace Nonprofits and Large Corporations (2011) (1)
Review: Béla Bollobás, Extremal graph theory (1980) (1)
Existential monadic second order logic on random rooted trees (2019) (1)
Penetrating grass seed (1990) (1)
A Call for Studying Reorganizations at the Micro-Level (2007) (1)
Uniformly Distributed Distances – a Geometric Application of Janson's Inequality (1996) (1)
Geometric discrepancy theory (1999) (1)
Linearity of Expectation (2004) (1)
Heat Diffusion with Frozen Boundary (2015) (1)
Logic and random structures (2007) (1)
Combinatorics by Coin Flipping (1986) (1)
REPORTS Explosive Percolation in Random Networks (2009) (1)
High Technology Product Success: The Critical Mass Dependency (2010) (1)
On the spectra of first-order language properties for random graphs (2015) (1)
The Local Lemma (2004) (1)
Junks of Central China: The Spencer Collection of Models at Texas A&M University (2000) (1)
Quasirandom Multitype Graphs (2010) (1)
What’s not inside a Cayley graph (1983) (1)
Balancing Unit Vectors (1981) (1)
Real time asymptotic packing (1996) (1)
Proper Raising Points in a Generalization of Backgammon (1969) (1)
Two Starting Examples (2001) (1)
Moving with the times : machinery & implements (2016) (0)
Notes on combinatorics : the distribution of coset leaders in a certain code (1970) (0)
Proceedings of the ninth international conference on on Random structures and algorithms (1996) (0)
Hands-free farming experiment : machinery & implements (2017) (0)
Windrower legacy : machinery & implements (2016) (0)
Foton makes a comeback (2017) (0)
A cut above the rest : machinery & implements (2016) (0)
Should a Price Change Be Handled as a New Product Introduction? The Hidden Costs (Considerations) of Implementing a Price Change (2005) (0)
John Deere's huge four-track : machinery & implements (2015) (0)
BOUNDS FOR RAMSEY (2001) (0)
More high-tech vegetable gear : machinery & implements (2016) (0)
Structural elucidation of salinomycin and narasin co-metabolites by LC-ESI-M'S POT.n' (2003) (0)
Ten Years! (1984) (0)
Mathematical Games Randomization , derandomization and antirandomization : three games (2001) (0)
Taking on the world : machinery & implements (2016) (0)
Valtra and Pöttinger - part 1 : machinery & implements (2016) (0)
Big Oh, little oh and all that (2014) (0)
Economics (1982) (0)
On a conjecture of Erdös and Hajnal (1973) (0)
Stirling’s formula (2014) (0)
Definitions with no quantifier alternation (2004) (0)
Claas at Agritechnica : machinery & implements (2016) (0)
Another award for Valtra (2017) (0)
Modern Erdos Magic (2017) (0)
The Vaaljapie is 70! : machinery & implements (2016) (0)
A Calculated Model of LinkedIn Feature Usage Across Organizational Types: Large, Small, and Non-profits (2012) (0)
Proppian random walks in Z (2011) (0)
Polaris power! : machinery & implements (2016) (0)
The Janson Inequality (2001) (0)
4. Large Deviations and Nonprobabilistic Algorithms (1994) (0)
Tractor of the year 2017 : machinery & implements (2017) (0)
Mechanised sugarcane production : machinery & implements (2015) (0)
Jupidex & Mascor at the Royal Show : machinery & implements (2016) (0)
The next big step? : machinery & implements (2017) (0)
A family affair : machinery & implements (2016) (0)
Random graphs and the probabilistic method (2022) (0)
Getting the most out of that expensive equipment : machinery & implements (2016) (0)
New Holland acquires Kongskilde : machinery & implements (2016) (0)
The big baler : machinery & implements (2016) (0)
The Premos 5000 : like no other : machinery & implements (2016) (0)
The art of counting (1973) (0)
Functions that Never Agree (1986) (0)
A tractor for the price of a quad bike : machinery & implements (2016) (0)
Eighty years of R (3, k)...and counting! (2011) (0)
Krone claims the crown : machinery & implements (2016) (0)
Extremal Subgraphs of Random Graphs L k l 6 Babai (2006) (0)
New machinery at Nampo : machinery & implements (2016) (0)
7. Random Graphs II (1994) (0)
Double-up and win! : machinery & implements (2017) (0)
Looking ahead to the Royal Show (2017) (0)
Heavyweight takes on Africa (2017) (0)
Online Universities: Who Is Creating Virtual Communities? (2016) (0)
Modern probalistic methods in combinatorics (1995) (0)
For vegetable farmers : machinery & implements (2016) (0)
On Group Testing with a Bounded Number of Defectives (2008) (0)
Africa, Asia, and Latin America (1984) (0)
Four Roads to the Ramsey Function (1985) (0)
Packing Ferrers Shapes (1998) (0)
New Holland tractors at NAMPO : machinery & implements (2016) (0)
From integrals to sums (2014) (0)
Monsanto gets top planters : machinery & implements (2016) (0)
The requirements of livestock feeds (1971) (0)
The ox wagon resurrected : machinery & implements (2016) (0)
In the field with KZN Agriserve (2017) (0)
2. The Deletion Method and Other Refinements (1994) (0)
6. Chaos from Order (1994) (0)
Erdős Magic (2002) (0)
The Combinatorics of Rooted Graphs (2001) (0)
The Poisson paradigm and random graphs (1992) (0)
The Erdös–Rényi Phase Transition (2010) (0)
About the Spencer (2010) (0)
RANDOM GRAPHS BY (2006) (0)
Really Big Numbers (2014) (0)
Ten lectures on the probalistic model (1987) (0)
Three Final Examples (2001) (0)
Very Sparse Graphs (2001) (0)
Rough Notes on Bansal ’ s Algorithm (2010) (0)
9. Discrepancy II (1994) (0)
Uniform Boundedness of Crossing Probabilities Implies Hyperscaling (2016) (0)
The new Aperion : machinery & implements (2016) (0)
Proceedings of the workshop on Randomized algorithms and computation (1997) (0)
A DISASTER USING APPROXIMATIONS (1969) (0)
Deterministic Discrepancy Minimization (2012) (0)
Martingales and Tight Concentration (2004) (0)
Integration in Asymptopia (2014) (0)
Two Dissimilar Halves Paul Erdós (1988) (0)
Codes, Games and Entropy (2004) (0)
11. The Janson Inequalities (1994) (0)
5. Discrepancy I (1994) (0)
Book Review: Extremal graph theory (1980) (0)
Fairness in Scheduling On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. In (1995) (0)
Average-Case Analysis of Retangle Packings (2000) (0)
Random graphs, sets and tournaments (2002) (0)
Near Rational Powers of n (2001) (0)
Note on vertex-partitions of infinite graphs (1990) (0)
The Poisson Paradigm (2004) (0)
(2 TO THE nth POWER) - 21,382,107,400,956,509,849 IS NEVER A PRIME (1969) (0)
Packing Random (2000) (0)
C O ] 1 4 Fe b 20 06 Deterministic Random Walks on the Integers ∗ (2014) (0)
New results on the distribution of distances determined by a point set (2002) (0)
Graph Property Testing (2010) (0)
Suresums (1981) (0)
The maturation of the probalistic method (2008) (0)
An infinity of primes (2014) (0)
Computing with Faulty Inputs (Dagstuhl Seminar 9522) (2021) (0)
J. E. Spencer Replies...1 (1962) (0)
A Very Large Number Indeed (1970) (0)
For small-scale growers : machinery & implements (2016) (0)
Phase transitions for random structures and algorithms (2010) (0)
86 Years of Ramsey R(3,k) (and counting!) (2017) (0)
Mechanising pecan production : machinery & implements (2016) (0)
Sales Force Adoption and Usage of LinkedIn (2015) (0)
When six is better than four (2018) (0)
3. Random Graphs I (1994) (0)
Class Lexion milestone : machinery & implements (2016) (0)
Baling at 32t/hour! (2017) (0)
Probability and Computing : Randomized Algorithms and Probabilistic Analysis (2021) (0)
New harvesting solutions : machinery & implements (2016) (0)
Is this the tractor of the future? : machinery & implements (2016) (0)
Conference in Honor of the 70th Birthday of Endre Szemerédi (2010) (0)
Dezzi - made in SA, for Africa : machinery & implements (2016) (0)
ATVs : on-farm travel made easy : machinery & implements (2016) (0)
8. The Lovász Local Lemma (1994) (0)
AFRICA, ASIA, AND LATIN AMERICA (1983) (0)
The design of a resilient network concentrator (1988) (0)
Tractors at Nampo : machinery & implements (2016) (0)
Supplementary feed in dry times (2017) (0)
Meet the MultiTasker : machinery & implements (2016) (0)
Drainage to maximise yield : machinery & implements (2015) (0)
Feasibility Study for Spencer Inc. (2003) (0)
Air seeders at a budget price : machinery & implements (2016) (0)
A Hal#iar's game (2004) (0)
A bird's eye view : machinery & implements (2016) (0)
Nampo equipment preview (2017) (0)
175 years of Case IH : machinery & implements (2017) (0)
D S ] 1 6 M ar 2 01 9 On-Line Balancing of Random Inputs (2019) (0)
NAMPO 2016 equipment preview (2016) (0)
The Maturation of the Probabilistic Method (2008) (0)
Asymptotics of binomial coefficients \binom{} (2014) (0)
Pulse Processes on Signed Digraphs (1972) (0)
Case IH at Agritechnica : machinery & implements (2016) (0)
Preferential attachment when stable (2018) (0)
Vermeer comes to Africa (2017) (0)
McCormick in the spotlight : machinery & implements (2016) (0)
Seen in sunny Eston : machinery & implements (2016) (0)
Down memory lane : machinery & implements (2015) (0)

This paper list is powered by the following services:

Other Resources About Joel Spencer

en.wikipedia.org

What Schools Are Affiliated With Joel Spencer?

Joel Spencer is affiliated with the following schools: