The probabilistic method

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 Erdö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 Erdös to the algorithmic aspects of much interest to this audience.

Original languageEnglish (US)
Title of host publicationProceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992
PublisherAssociation for Computing Machinery
Pages41-47
Number of pages7
VolumePart F129721
ISBN (Electronic)089791466X
StatePublished - Sep 1 1992
Event3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992 - Orlando, United States
Duration: Jan 27 1992Jan 29 1992

Other

Other3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992
CountryUnited States
CityOrlando
Period1/27/921/29/92

Fingerprint

Probabilistic Methods
Coloring
Computer science
Combinatorics
Randomness
Set of points
Colouring
Computer Science
Methodology
Family

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Spencer, J. (1992). The probabilistic method. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992 (Vol. Part F129721, pp. 41-47). Association for Computing Machinery.

The probabilistic method. / Spencer, Joel.

Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Vol. Part F129721 Association for Computing Machinery, 1992. p. 41-47.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Spencer, J 1992, The probabilistic method. in Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. vol. Part F129721, Association for Computing Machinery, pp. 41-47, 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992, Orlando, United States, 1/27/92.
Spencer J. The probabilistic method. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Vol. Part F129721. Association for Computing Machinery. 1992. p. 41-47
Spencer, Joel. / The probabilistic method. Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Vol. Part F129721 Association for Computing Machinery, 1992. pp. 41-47
@inproceedings{f12779ec80f64ef4b18cffd7e8740e4e,
title = "The probabilistic method",
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 Erd{\"o}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 Erd{\"o}s to the algorithmic aspects of much interest to this audience.",
author = "Joel Spencer",
year = "1992",
month = "9",
day = "1",
language = "English (US)",
volume = "Part F129721",
pages = "41--47",
booktitle = "Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - The probabilistic method

AU - Spencer, Joel

PY - 1992/9/1

Y1 - 1992/9/1

N2 - 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 Erdö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 Erdös to the algorithmic aspects of much interest to this audience.

AB - 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 Erdö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 Erdös to the algorithmic aspects of much interest to this audience.

UR - http://www.scopus.com/inward/record.url?scp=0039963923&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039963923&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0039963923

VL - Part F129721

SP - 41

EP - 47

BT - Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992

PB - Association for Computing Machinery

ER -