On sums of independent random variables with unbounded variance, and estimating the average degree in a graph

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 594-603

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Inequalities; Shortest paths

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

INEQUALITY; RANDOM VARIABLES; SAMPLING ALGORITHMS;

GRAPH THEORY;

EID: 4544351991     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007443     Document Type: Conference Paper

References (5)

1. N. Alon and J. Spencer. The Probabilistic Method. Wiley-Interscience, 2000.
2. N. Devanur, R. Lipton, N. Vishnoi. "Who's the weakest link?". Second Symposium on Stochastic Algorithms, Foundations and Applications, SAGA 2003.
3. L. Dubins and L. Savage. Inequalities for Stochastic Processes. (How to gamble if you must.) Dover Publications, New York, 1976.
4. O Goldreich and D. Ron. "On estimating the average degree of a graph". Electronic Colloguim on Computational Complexity (ECCC), TR04-13, 2004.
5. A. Siegel. "Median bounds and their application". Journal of Algorithms, 38(1), 184-236, 2001.