Spencer, Joel H.
Overview
Works:  131 works in 383 publications in 7 languages and 5,903 library holdings 

Genres:  Conference papers and proceedings Documentary films Biography Biographical films Nonfiction films Film adaptations Textbooks 
Roles:  Author, Editor, Director, Instrumentalist, Conductor, Contributor, Other, Performer 
Classifications:  QA164, 511.6 
Publication Timeline
.
Most widely held works by
Joel H Spencer
The probabilistic method by
Noga Alon(
Book
)
61 editions published between 1990 and 2016 in English and held by 1,127 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
61 editions published between 1990 and 2016 in English and held by 1,127 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
)
27 editions published between 1980 and 2013 in English and Undetermined and held by 1,012 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
27 editions published between 1980 and 2013 in English and Undetermined and held by 1,012 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
Ten lectures on the probabilistic method by
Joel H Spencer(
Book
)
36 editions published between 1987 and 1994 in 3 languages and held by 599 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
36 editions published between 1987 and 1994 in 3 languages and held by 599 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
Probabilistic methods in combinatorics by
Paul Erdős(
Book
)
25 editions published between 1974 and 1976 in 4 languages and held by 519 WorldCat member libraries worldwide
Two examples. Notation. Binomial distribution. The property B. Ramsey's theorems. Van der waerden's theorem. Quasiramsey theorems. A Quasi van der waerden theorem. Tournaments. Regular tournaments. Chromatic number. Zarankiewiecz's problem and bipartite ramsey theorems. Packing, covering and turan's theorem. Asymmetric graphs. The imbalance problems.The evolution of random graphs. The kitchen sink
25 editions published between 1974 and 1976 in 4 languages and held by 519 WorldCat member libraries worldwide
Two examples. Notation. Binomial distribution. The property B. Ramsey's theorems. Van der waerden's theorem. Quasiramsey theorems. A Quasi van der waerden theorem. Tournaments. Regular tournaments. Chromatic number. Zarankiewiecz's problem and bipartite ramsey theorems. Packing, covering and turan's theorem. Asymmetric graphs. The imbalance problems.The evolution of random graphs. The kitchen sink
Paul Erdös: the art of counting. Selected writings by
Paul Erdős(
Book
)
2 editions published in 1973 in English and held by 463 WorldCat member libraries worldwide
2 editions published in 1973 in English and held by 463 WorldCat member libraries worldwide
The strange logic of random graphs by
Joel H Spencer(
Book
)
15 editions published between 2001 and 2010 in English and held by 362 WorldCat member libraries worldwide
The book will be of interest to graduate students and researchers in discrete mathematics."Jacket
15 editions published between 2001 and 2010 in English and held by 362 WorldCat member libraries worldwide
The book will be of interest to graduate students and researchers in discrete mathematics."Jacket
Ecole d'été de probabilités de SaintFlour XXI, 1991 by
Donald A Dawson(
Book
)
14 editions published in 1993 in 4 languages and held by 227 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
14 editions published in 1993 in 4 languages and held by 227 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
N is a number : a portrait of Paul Erdős(
Visual
)
1 edition published in 2004 in English and held by 199 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland, and the United States over a period of four years presenting mathematician Paul Erdős'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 199 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland, and the United States over a period of four years presenting mathematician Paul Erdős's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
Asymptopia by
Joel H Spencer(
Book
)
11 editions published in 2014 in English and held by 198 WorldCat member libraries worldwide
11 editions published in 2014 in English and held by 198 WorldCat member libraries worldwide
Random regular tournaments by
Joel H Spencer(
Book
)
7 editions published between 1969 and 1972 in English and held by 75 WorldCat member libraries worldwide
The author uses the notation of J.W. Moon. Unless otherwise stated all tournaments shall be labeled. The author sometimes represents a tournament T by a set of ordered pairs (i, j) where this represents that i beat j. The game between i and j with winner undetermined is represented by (set (i, j)). T may also be represented by its tournament matrix. A common motif in the theory of tournaments is the probabilistic method. In the paper it is shown how to prove properties of a random element of the class of regular tournaments. (Author)
7 editions published between 1969 and 1972 in English and held by 75 WorldCat member libraries worldwide
The author uses the notation of J.W. Moon. Unless otherwise stated all tournaments shall be labeled. The author sometimes represents a tournament T by a set of ordered pairs (i, j) where this represents that i beat j. The game between i and j with winner undetermined is represented by (set (i, j)). T may also be represented by its tournament matrix. A common motif in the theory of tournaments is the probabilistic method. In the paper it is shown 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
)
13 editions published in 1973 in English and German and held by 55 WorldCat member libraries worldwide
13 editions published in 1973 in English and German and held by 55 WorldCat member libraries worldwide
Uniformity theorems in missile duels by
Joel H Spencer(
Book
)
4 editions published between 1971 and 1973 in English and held by 52 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
4 editions published between 1971 and 1973 in English and held by 52 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 39 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 39 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 35 WorldCat member libraries worldwide
6 editions published between 1969 and 1971 in English and held by 35 WorldCat member libraries worldwide
A very large number indeed by
Joel H Spencer(
Book
)
4 editions published between 1969 and 1970 in English and held by 31 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 31 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)
A characterization of clique graphs by
Fred S Roberts(
Book
)
5 editions published in 1969 in English and held by 30 WorldCat member libraries worldwide
A graphtheoretic discussion following up a recent paper in which Hamelink obtains an interesting sufficient condition for a graph to be a clique graph. In the present study related conditions are given that are necessary as well as sufficient. As an application of the result, it is shown that Hamelink's condition is also necessary in certain special cases and that here it can be greatly simplified. As another application, certain theorems are derived that are useful in practice in reducing the question of whether certain smaller or simpler graphs are clique graphs. Next, the clique graph results are related to some work of Fulkerson and Gross on interval graphs and the consecutive 1's property. Finally, there are some remarks, motivated by the clique graph results, on graphs with no independent cut sets
5 editions published in 1969 in English and held by 30 WorldCat member libraries worldwide
A graphtheoretic discussion following up a recent paper in which Hamelink obtains an interesting sufficient condition for a graph to be a clique graph. In the present study related conditions are given that are necessary as well as sufficient. As an application of the result, it is shown that Hamelink's condition is also necessary in certain special cases and that here it can be greatly simplified. As another application, certain theorems are derived that are useful in practice in reducing the question of whether certain smaller or simpler graphs are clique graphs. Next, the clique graph results are related to some work of Fulkerson and Gross on interval graphs and the consecutive 1's property. Finally, there are some remarks, motivated by the clique graph results, on graphs with no independent cut sets
Notes on combinatorial mathematics: transitive subtournaments by
Joel H Spencer(
Book
)
4 editions published in 1969 in English and held by 30 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)
4 editions published in 1969 in English and held by 30 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)
Ecole d'Eté de Probabilités de SaintFlour XXI  1991(
)
1 edition published in 1993 in English and held by 29 WorldCat member libraries worldwide
1 edition published in 1993 in English and held by 29 WorldCat member libraries worldwide
A disaster using approximations by
Joel H Spencer(
Book
)
5 editions published in 1969 in English and held by 28 WorldCat member libraries worldwide
The author gives an example of the error resulting from truncating a series too soon
5 editions published in 1969 in English and held by 28 WorldCat member libraries worldwide
The author gives an example of the error resulting from truncating a series too soon
Discrete probability and algorithms by
D. J Aldous(
)
2 editions published in 1995 in English and held by 0 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 0 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
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Erdős, Paul 19131996 Author
 Alon, Noga Author
 Graham, Ronald L. 1935 Author
 Rothschild, Bruce L. 1941
 Dawson, Donald A. (Donald Andrew) 1937 Other Author
 Hennequin, P. L. (Paul Louis) 1930 Other Editor
 Maisonneuve, Bernard Other
 John Wiley & Sons Publisher
 Florescu, Laura
 Cassels, J. W. S. (John William Scott)
Useful Links
Associated Subjects
Algorithms Antimissile missiles Approximation theory 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 Numerical analysis Probabilities Ramsey numbersAsymptotic theory Ramsey theory Random graphs Set theory Statistics Stochastic processes Tournaments (Graph theory) Weapons systemsEvaluation
Alternative Names
Joel H. Spencer USamerikanischer Mathematiker und Informatiker
Joel Spencer Amerikaans wiskundige
Joel Spencer amerikansk matematikar
Joel Spencer amerikansk matematiker
Spencer, J. 1946
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
Covers