Spencer, Joel H.
Overview
Works:  151 works in 403 publications in 6 languages and 6,191 library holdings 

Genres:  Biography Documentary films Biographical films Conference papers and proceedings Nonfiction films Film adaptations Textbooks 
Roles:  Author, Editor, Director, Instrumentalist, Conductor, Performer, Contributor, Other 
Publication Timeline
.
Most widely held works by
Joel H Spencer
The probabilistic method by
Noga Alon(
Book
)
59 editions published between 1990 and 2016 in English and held by 1,199 WorldCat member libraries worldwide
The probabalistic method, allows us to prove the existence of combinatorial structure with certain properties by constructing an appropriate probability space and showing that a chosen element has the desired properties with positive probability
59 editions published between 1990 and 2016 in English and held by 1,199 WorldCat member libraries worldwide
The probabalistic method, allows us to prove the existence of combinatorial structure with certain properties by constructing an appropriate probability space and showing that a chosen element has the desired properties with positive probability
Ramsey theory by
Ronald L Graham(
Book
)
29 editions published between 1980 and 2013 in English and Undetermined and held by 1,018 WorldCat member libraries worldwide
"Discrete mathematics, the study of finite structures, is one of the fastestgrowing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the everincreasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms."Book cover
29 editions published between 1980 and 2013 in English and Undetermined and held by 1,018 WorldCat member libraries worldwide
"Discrete mathematics, the study of finite structures, is one of the fastestgrowing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the everincreasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms."Book cover
Probabilistic methods in combinatorics by
Paul Erdős(
Book
)
17 editions published in 1974 in 3 languages and held by 495 WorldCat member libraries worldwide
17 editions published in 1974 in 3 languages and held by 495 WorldCat member libraries worldwide
Paul Erdös: the art of counting. Selected writings by
Paul Erdős(
Book
)
2 editions published in 1973 in English and held by 457 WorldCat member libraries worldwide
2 editions published in 1973 in English and held by 457 WorldCat member libraries worldwide
The strange logic of random graphs by
Joel H Spencer(
Book
)
17 editions published between 2001 and 2010 in English and held by 444 WorldCat member libraries worldwide
The book will be of interest to graduate students and researchers in discrete mathematics."Jacket
17 editions published between 2001 and 2010 in English and held by 444 WorldCat member libraries worldwide
The book will be of interest to graduate students and researchers in discrete mathematics."Jacket
The probabilistic method by
Noga Alon(
Book
)
5 editions published between 1992 and 2015 in English and held by 379 WorldCat member libraries worldwide
5 editions published between 1992 and 2015 in English and held by 379 WorldCat member libraries worldwide
Ten lectures on the probabilistic method by
Joel H Spencer(
Book
)
19 editions published between 1987 and 1994 in English and Spanish and held by 333 WorldCat member libraries worldwide
This update of the 1987 title of the same name is an examination of what is currently known about the probabilistic method, written by one of its principal developers. Based on the notes from Spencer's 1986 series of ten lectures, this new edition contains an additional lecture: The Janson inequalities. These inequalities allow accurate approximation of extremely small probabilities. A new algorithmic approach to the Lovasz Local Lemma, attributed to Jozsef Beck, has been added to Lecture 8, as well. Throughout the monograph, Spencer retains the informal style of his original lecture notes and emphasizes the methodology, shunning the more technical "best possible" results in favor of clearer exposition. The book is not encyclopedicit contains only those examples that clearly display the methodology. The probabilistic method is a powerful tool in graph theory, combinatorics, and theoretical computer science. It allows one to prove the existence of objects with certain properties (e.g., colorings) by showing that an appropriately defined random object has positive probability of having those properties
19 editions published between 1987 and 1994 in English and Spanish and held by 333 WorldCat member libraries worldwide
This update of the 1987 title of the same name is an examination of what is currently known about the probabilistic method, written by one of its principal developers. Based on the notes from Spencer's 1986 series of ten lectures, this new edition contains an additional lecture: The Janson inequalities. These inequalities allow accurate approximation of extremely small probabilities. A new algorithmic approach to the Lovasz Local Lemma, attributed to Jozsef Beck, has been added to Lecture 8, as well. Throughout the monograph, Spencer retains the informal style of his original lecture notes and emphasizes the methodology, shunning the more technical "best possible" results in favor of clearer exposition. The book is not encyclopedicit contains only those examples that clearly display the methodology. The probabilistic method is a powerful tool in graph theory, combinatorics, and theoretical computer science. It allows one to prove the existence of objects with certain properties (e.g., colorings) by showing that an appropriately defined random object has positive probability of having those properties
Ten lectures on the probabilistic method by
Joel H Spencer(
Book
)
10 editions published between 1987 and 1990 in English and held by 303 WorldCat member libraries worldwide
10 editions published between 1987 and 1990 in English and held by 303 WorldCat member libraries worldwide
Ecole d'été de probabilités de SaintFlour XXI, 1991 by
Donald A Dawson(
Book
)
17 editions published between 1993 and 2006 in 3 languages and held by 277 WorldCat member libraries worldwide
CONTENTS: D.D. Dawson: Measurevalued Markov Processes. B. Maisonneuve: Processus de Markov: Naissance, Retournement, Regeneration. J. Spencer: Nine lectures on Random Graphs
17 editions published between 1993 and 2006 in 3 languages and held by 277 WorldCat member libraries worldwide
CONTENTS: D.D. Dawson: Measurevalued Markov Processes. B. Maisonneuve: Processus de Markov: Naissance, Retournement, Regeneration. J. Spencer: Nine lectures on Random Graphs
Asymptopia by
Joel H Spencer(
Book
)
13 editions published between 2014 and 2017 in English and held by 254 WorldCat member libraries worldwide
"Asymptotics in one form or another are part of the landscape for every mathematician. The objective of this book is to present the ideas of how to approach asymptotic problems that arise in discrete mathematics, analysis of algorithms, and number theory. A broad range of topics is covered, including distribution of prime integers, Erdős Magic, random graphs, Ramsey numbers, and asymptotic geometry."Provided by publisher
13 editions published between 2014 and 2017 in English and held by 254 WorldCat member libraries worldwide
"Asymptotics in one form or another are part of the landscape for every mathematician. The objective of this book is to present the ideas of how to approach asymptotic problems that arise in discrete mathematics, analysis of algorithms, and number theory. A broad range of topics is covered, including distribution of prime integers, Erdős Magic, random graphs, Ramsey numbers, and asymptotic geometry."Provided by publisher
N is a number : a portrait of Paul Erdős by
George Paul Csicsery(
Visual
)
1 edition published in 2004 in English and held by 201 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland and the United States over a period of four years presenting mathematician Paul Erdos's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
1 edition published in 2004 in English and held by 201 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland and the United States over a period of four years presenting mathematician Paul Erdos's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
Random regular tournaments by
Joel H Spencer(
Book
)
8 editions published between 1969 and 1972 in English and held by 79 WorldCat member libraries worldwide
A common motif in the theory of tournaments is the probabilistic method. The paper shows how to prove properties of a random element of the class of regular tournaments. (Author)
8 editions published between 1969 and 1972 in English and held by 79 WorldCat member libraries worldwide
A common motif in the theory of tournaments is the probabilistic method. The paper shows how to prove properties of a random element of the class of regular tournaments. (Author)
The art of counting : selected writings by
Paul Erdős(
Book
)
12 editions published in 1973 in English and German and held by 59 WorldCat member libraries worldwide
12 editions published in 1973 in English and German and held by 59 WorldCat member libraries worldwide
Pulse processes on signed digraphs : a tool for analyzing energy demand by
Thomas A Brown(
Book
)
5 editions published between 1972 and 1974 in English and held by 57 WorldCat member libraries worldwide
5 editions published between 1972 and 1974 in English and held by 57 WorldCat member libraries worldwide
Discrete probability and algorithms by
D. J Aldous(
)
2 editions published in 1995 in English and held by 56 WorldCat member libraries worldwide
Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field. Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance
2 editions published in 1995 in English and held by 56 WorldCat member libraries worldwide
Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field. Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance
Uniformity theorems in missile duels by
Joel H Spencer(
Book
)
3 editions published in 1971 in English and held by 53 WorldCat member libraries worldwide
A theorem dealing with the purchase of defensive weapon systems is proven. The purchaser's objective is assumed to be the achievement of an assumed destruction criterion at minimal cost. It is shown that under certain circumstances it is optimal to purchase a uniform defensive system. The applicability of the mathematical theorem to the real world is then studied. A second theorem gives a simple procedure for finding an attacker's optimal firing rule under very general circumstances. An example illustrates the problems in choosing a defensive weapon system
3 editions published in 1971 in English and held by 53 WorldCat member libraries worldwide
A theorem dealing with the purchase of defensive weapon systems is proven. The purchaser's objective is assumed to be the achievement of an assumed destruction criterion at minimal cost. It is shown that under certain circumstances it is optimal to purchase a uniform defensive system. The applicability of the mathematical theorem to the real world is then studied. A second theorem gives a simple procedure for finding an attacker's optimal firing rule under very general circumstances. An example illustrates the problems in choosing a defensive weapon system
Minimal scrambling sets of simple orders by
Joel H Spencer(
Book
)
4 editions published between 1969 and 1971 in English and held by 41 WorldCat member libraries worldwide
Let 2 <or = k <n be fixed integers, a family F of simple orders on an n element set is said to be ksuitable if of every k elements in the n set, each one is the largest of the k in some simple order in F. Bounds are found on the minimal size of such an F.F is said to be k starsuitable if for every k elements in the nset each permutation of the k elements is realized in some simple order in F. Again bounds are found on the minimal size of such an F. (Author)
4 editions published between 1969 and 1971 in English and held by 41 WorldCat member libraries worldwide
Let 2 <or = k <n be fixed integers, a family F of simple orders on an n element set is said to be ksuitable if of every k elements in the n set, each one is the largest of the k in some simple order in F. Bounds are found on the minimal size of such an F.F is said to be k starsuitable if for every k elements in the nset each permutation of the k elements is realized in some simple order in F. Again bounds are found on the minimal size of such an F. (Author)
Turan's theorem for kgraphs by
Joel H Spencer(
Book
)
6 editions published between 1969 and 1971 in English and held by 39 WorldCat member libraries worldwide
Denote by T(n, k, b)T for Turanthe smallest q such that there exists a kgraph with n vertices, q edges, and with no independent set of size b. The calculation for k = 2 is Turan's theorem. An improved lower bound on T is given in this paper. The proof uses probabilistic methods. The revised version contains an additional lower bound on T. 6 pp. Ref. (Author)
6 editions published between 1969 and 1971 in English and held by 39 WorldCat member libraries worldwide
Denote by T(n, k, b)T for Turanthe smallest q such that there exists a kgraph with n vertices, q edges, and with no independent set of size b. The calculation for k = 2 is Turan's theorem. An improved lower bound on T is given in this paper. The proof uses probabilistic methods. The revised version contains an additional lower bound on T. 6 pp. Ref. (Author)
A very large number indeed by
Joel H Spencer(
Book
)
4 editions published between 1969 and 1970 in English and held by 33 WorldCat member libraries worldwide
The following problem is discussed: Describe, on a 3x5 card, as large an integer K as you can. The rules are necessarily vague: Rule 1: 'Normal' size writing. Rule 2: K must be well defined and there must be a well defined way of determining K. It is not necessary to prove that the definition of K has these properties on the card. This rule excludes 'K = 1 if Femats Last Theorem is True, otherwise K = minimal n> 2 such that (x to the nth power) + (y to the nth power) = (z to the nth power).' Rule 3: Logically paradoxical definitions are not allowed. This excludes 'K = 1 + the largest integer describable on a 3x5 card.' Rule 4: All reasonably standard mathematical conventions are allowable. (Author)
4 editions published between 1969 and 1970 in English and held by 33 WorldCat member libraries worldwide
The following problem is discussed: Describe, on a 3x5 card, as large an integer K as you can. The rules are necessarily vague: Rule 1: 'Normal' size writing. Rule 2: K must be well defined and there must be a well defined way of determining K. It is not necessary to prove that the definition of K has these properties on the card. This rule excludes 'K = 1 if Femats Last Theorem is True, otherwise K = minimal n> 2 such that (x to the nth power) + (y to the nth power) = (z to the nth power).' Rule 3: Logically paradoxical definitions are not allowed. This excludes 'K = 1 + the largest integer describable on a 3x5 card.' Rule 4: All reasonably standard mathematical conventions are allowable. (Author)
Notes on combinatorial mathematics: transitive subtournaments by
Joel H Spencer(
Book
)
5 editions published in 1969 in English and held by 33 WorldCat member libraries worldwide
The report describes a round robin tournament in which each player plays one game with every other player, and each game ends in a win for one of the players. In a tournament of this type with 15 players, it is shown that some 5 players will be involved in a transitive subtournament. That is, considering only the games that the 5 players play among themselves, the players can be ranked in such a way that no upsets occur. Although the same result has been obtained by other authors using different techniques, this proof is unique in that it involves close scrutiny of the subtournament of players that have lost to one individual player. Certain families of sets of players are studied that turn out to be Steiner triple systems on seven elements. This result disproves a conjecture of the Hungarian mathematicians P. Erdos and L. Moser. (Author)
5 editions published in 1969 in English and held by 33 WorldCat member libraries worldwide
The report describes a round robin tournament in which each player plays one game with every other player, and each game ends in a win for one of the players. In a tournament of this type with 15 players, it is shown that some 5 players will be involved in a transitive subtournament. That is, considering only the games that the 5 players play among themselves, the players can be ranked in such a way that no upsets occur. Although the same result has been obtained by other authors using different techniques, this proof is unique in that it involves close scrutiny of the subtournament of players that have lost to one individual player. Certain families of sets of players are studied that turn out to be Steiner triple systems on seven elements. This result disproves a conjecture of the Hungarian mathematicians P. Erdos and L. Moser. (Author)
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Antimissile missiles Armed ForcesProcurement Asymptotic expansions Combinatorial analysis Combinatorial enumeration problems Combinatorial probabilities Computer science Distribution (Probability theory) Erdős, Paul, Graph theory Hoffman, Paul, Hungary Information theory Logic, Symbolic and mathematical Markov processes Mathematical statistics Mathematicians Mathematics MathematicsPhilosophy Nuclear warfareMathematical models Power (Mechanics)Mathematical models Probabilities Ramsey, Frank Plumpton, Ramsey numbersAsymptotic theory Ramsey theory Random graphs Set theory Statistics Stochastic processes Tournaments (Graph theory) Weapons systemsEvaluation
Covers
Alternative Names
Joel H. Spencer USamerikanischer Mathematiker und Informatiker
Joel Spencer Amerikaans wiskundige
Joel Spencer amerikansk matematikar
Joel Spencer amerikansk matematiker
Joel Spencer matemático estadounidense
Joel Spencer matematico statunitense
Joel Spencer mathématicien américain
Spencer Goel
Spencer, J. 1946
Spencer, J. H.
Spencer, J. H. (Joel H.)
Spencer Joel
Spencer, Joel 1946
Spencer, Joel H.
Spencer, Joel Harold 1946
Spencer, Joel (Joel H.)
Spenser, Dž.
Spenser, Dž 1946
Спенсер Дж.
Спенсер Джоэл
جوئل اسپنسر ریاضیدان آمریکایی
ジョエル・スペンサー
Languages