Spencer, Joel H.Overview
Publication Timeline
Most widely held works by
Joel H Spencer
The probabilistic method
by Noga Alon
(
Book
)
52 editions published between 1990 and 2008 in English and held by 1,239 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
)
17 editions published between 1980 and 2013 in English and Undetermined and held by 951 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
)
29 editions published between 1987 and 1994 in English and Undetermined and held by 618 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
Paul Erdös: the art of counting. Selected writings
by Paul Erdős
(
Book
)
6 editions published in 1973 in English and German and held by 493 WorldCat member libraries worldwide
Probabilistic methods in combinatorics
by Paul Erdős
(
Book
)
14 editions published in 1974 in 3 languages and held by 477 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
The strange logic of random graphs
by Joel H Spencer
(
Book
)
11 editions published between 2001 and 2010 in English and held by 358 WorldCat member libraries worldwide "The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zeroone law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures
Ecole d'été de probabilités de SaintFlour XXI, 1991
by Donald A Dawson
(
Book
)
10 editions published in 1993 in 3 languages and held by 292 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
by George Paul Csicsery
(
Visual
)
1 edition published in 2004 in English and held by 183 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
)
6 editions published between 1970 and 1972 in English and held by 73 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)
Asymptopia
by Joel H Spencer
(
Book
)
3 editions published in 2014 in English and held by 53 WorldCat member libraries worldwide
Uniformity theorems in missile duels
by Joel H Spencer
(
Book
)
2 editions published in 1971 in English and held by 49 WorldCat member libraries worldwide
Minimal scrambling sets of simple orders
by Joel H Spencer
(
Book
)
3 editions published in 1971 in English and held by 37 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
)
4 editions published in 1971 in English and held by 32 WorldCat member libraries worldwide
Ecole d'Eté de Probabilités de SaintFlour XXI  1991
(
)
1 edition published in 1993 in English and held by 28 WorldCat member libraries worldwide
Notes on combinatorial mathematics: transitive subtournaments
by Joel H Spencer
(
Book
)
3 editions published in 1969 in English and held by 28 WorldCat member libraries worldwide
A very large number indeed
by Joel H Spencer
(
Book
)
2 editions published in 1970 in English and held by 27 WorldCat member libraries worldwide
A characterization of clique graphs
by Fred S Roberts
(
Book
)
2 editions published in 1969 in English and held by 27 WorldCat member libraries worldwide
Proper raising points in a generalization of backgammon
by Emmett B Keeler
(
Book
)
2 editions published in 1969 in English and held by 25 WorldCat member libraries worldwide
A disaster using approximations
by Joel H Spencer
(
Book
)
2 editions published in 1969 in English and held by 24 WorldCat member libraries worldwide
2n21,382,107,400,956,509,849 is never a prime
by Joel H Spencer
(
Book
)
2 editions published in 1969 in English and held by 24 WorldCat member libraries worldwide more
fewer
Audience Level
Related Identities
Associated Subjects
Antimissile missiles Armed ForcesProcurement Asymptotic expansions Backgammon Combinatorial analysis Combinatorial enumeration problems Combinatorial probabilities Computer science Distribution (Probability theory) Erdős, Paul, Gambling Games of strategy (Mathematics) Graph theory Hoffman, Paul, Hungary Information theory Logic, Symbolic and mathematical Markov processes Mathematicians Mathematics MathematicsPhilosophy Nuclear warfareMathematical models Numbers, Divisibility of Numerical analysis Probabilities Ramsey numbersAsymptotic theory Ramsey theory Random graphs Set theory Stochastic processes Tournaments (Graph theory) Weapons systemsEvaluation

Alternative Names
Spencer, J. 1946
Spencer, Joel.
Spencer, Joel 1946
Spencer, Joel H.
Spenser, Dž.
Spenser, Dž 1946
Languages
Covers
