Joel Spencer  Home/Search
Context Related
| nyu.edu/cs/faculty/spencer...icmtalk.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: nyu.edu/cs/faculty/spenc...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Computer Science these questions take on an algorithmic tone, having proven the existence of a graph or other structure can it be constructed in polynomial time. A recent success of J. Beck allows the Lov'asz Local Lemma to be derandomized. Sometimes. We close with two forays into a land dubbed Asymptopia by David Aldous. There the asymptotic behavior of random objects are given by an infinite object, allowing powerful noncombinatorial tools to be used. 1 Chernoff, Azuma, Janson, Talagrand... (Update)
Context of citations to this paper: More
...large deviation methods like martingales and the Janson and Talagrand inequalities. The reader may consult the survey paper of Spencer [15] for further details. More recent applications can be found in [10] and [11] The main objective of the current paper is to provide a...
...referee. First we will describe an adaptation of Talagrand s inequality, convenient for combinatorial applications, as presented by Spencer in [14]. Let Q n i=1 i be a product probability space and let h R be a real valued random variable. We call h Lipschitz if jh(x) h(y)j...
Cited by: More
Tiny Families of Functions with Random Properties: A.. - Goldreich, Wigderson (2003) (Correct)
Approximating Probability Distributions Using Small Sample.. - Azar, Motwani, Naor (1995) (Correct)
On the Probability of Independent Sets in Random Graphs - Krivelevich, Sudakov, Vu.. (Correct)
Active bibliography (related documents): More All
0.6: Geometric Set Systems - Matousek (1998) (Correct)
0.6: Concentration Of Measure And Isoperimetric Inequalities In.. - Talagrand (1995) (Correct)
0.5: Discrepancy in Arithmetic Progressions - Matousek, Spencer (1996) (Correct)
Similar documents based on text: More All
0.3: Random Graphs, Sets and Tournaments - Spencer (Correct)
0.2: Nowhere-Zero Flows in Random Graphs - Sudakov (Correct)
0.2: List Coloring of Random and Pseudo-Random Graphs - Alon, Krivelevich, Sudakov (Correct)
Related documents from co-citation: More All
19: The Probabilistic Method (context) - Alon, Spencer - 1992
6: Random Graphs (context) - Bollob'as - 1985
5: Coloring the vertices of a graph in prescribed colors (context) - Vizing - 1976
BibTeX entry: (Update)
P. Erdos and J. Spencer, Probabilistic Methods in Combinatorics, Academic Press, 1974. http://citeseer.ist.psu.edu/spencer74probabilistic.html More
@misc{ erdos74probabilistic,
author = "P. Erdos and J. Spencer",
title = "Probabilistic Methods in Combinatorics",
text = "P. Erdos and J. Spencer, Probabilistic Methods in Combinatorics, Academic
Press, 1974.",
year = "1974",
url = "citeseer.ist.psu.edu/spencer74probabilistic.html" }
Citations (may not include all citations):957 The probabilistic method (context) - Alon, Spencer - 1993 ACM DBLP
283 Random Graphs (context) - Bollob'as - 1985 ACM
132 the evolution of random graphs (context) - Erdos, R'enyi - 1960
56 An algorithmic approach to the Lov'asz Local Lemma (context) - Beck - 1991
54 Problems and results on 3-chromatic hypergraphs and some rel.. (context) - Erdos, Lov'asz - 1975
44 A parallel algorithmic version of the local lemma (context) - Alon - 1991 ACM DBLP
34 Poisson approximation for large deviations (context) - Janson - 1990 DBLP
34 a packing and covering problem (context) - Rodl - 1985
21 An exponential bound for the probability of nonexistence of .. (context) - Janson, Luczak et al. - 1990
15 Some remarks on the theory of graphs (context) - Erdos - 1947
14 Roth's estimate on the discrepancy of integer sequences is n.. (context) - Beck - 1981
14 a limit theorem in combinatorial analysis (context) - Erdos, Hanani - 1963
13 Discrepancy in Arithmetic Progressions - Matousek, Spencer
12 Remark concerning integer sequences (context) - Roth - 1964
11 Six standard deviations suffice (context) - Spencer - 1985
9 The chromatic number of random graphs (context) - Bollob'as - 1988 DBLP
8 Integer-making Theorems (context) - Beck, Fiala - 1981
4 A new isoperimetric inequality for product measure and the t.. (context) - Talagrand - 1991
3 Tight upper bounds for the discrepancy of halfspaces (context) - Matousek - 1994
2 a combinatorial problem of Erdos (context) - Kleitman - 1966
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cs.nyu.edu/cs/faculty/spencer/papers/papers.html): More
Asymptotic Packing via A Branching Process - Spencer (1995) (Correct)
Nearly Perfect Matchings in Regular Simple Hypergraphs - Alon, Kim, Spencer (Correct)
Random Sparse Bit Strings at the Threshold of Adjacency.. - Spencer, al. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC