The probabilistic method

Authors:
Joel Spencer
Affiliations:
-
Venue:
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Year:
1992

Citing 2
Cited 8

Balancing vectors in the max norm

Combinatorica
Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986

Simulating (logcn)-wise independence in NC

Journal of the ACM (JACM)
On the Fourier spectrum of monotone functions

Journal of the ACM (JACM)
Three theorems regarding testing graph properties

Random Structures & Algorithms
Note: 2-connected graphs with small 2-connected dominating sets

Discrete Mathematics
A Model for Random Random-Walks on Finite Groups

Combinatorics, Probability and Computing
A new average case analysis for completion time scheduling

Journal of the ACM (JACM)
Finding a vector orthogonal to roughly half a collection of vectors

Journal of Complexity
Time series representation: a random shifting perspective

WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of randomness is now an accepted tool in Theoretical Computer Science but not everyone is aware of the underpinnings of this methodology in Combinatorics - particularly, in what is now called the probabilistic Method as developed primarily by Paul Erdo&huml;s over the past half century. Here I will explore a particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets. A central point will be the evolution of these problems from the purely existential proofs of Erdo&huml;s to the algorithmic aspects of much interest to this audience.