SCOPUS 정보 검색 플랫폼

Volumn 33, Issue 6, 1990, Pages 305-308

A guided tour of chernoff bounds

Author keywords

Bernoulli trials; Chernoff bounds; coin tossing; probabilistic analysis

Indexed keywords

MATHEMATICAL TECHNIQUES--ALGORITHMS;

BERNOULLI TRIALS; CHERNOFF BOUNDS; PROBABILISTIC ANALYSIS;

PROBABILITY;

EID: 0025383763 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/0020-0190(90)90214-I Document Type: Article

Times cited : (408)

References (7)

1
- 0018454769
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- (1979) J. Comput. System Sci. , vol.18 , pp. 155-193
- Angluin¹ Valiant²

2
- 0000182415
- A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
- (1952) The Annals of Mathematical Statistics , vol.23 , pp. 493-507
- Chernoff¹

4
- 0004288176
- Springer, New York
- (1987) Probabilistic Analysis of Algorithms
- Hofri¹

5
- 33746088254
- Probabilistic analysis of algorithms
- Univ. California, Berkeley
- (1988) Class Notes
- Karp¹

6
- 0000435276
- Probabilistic construction of deterministic algorithms: Approximating packing integer programs
- (1988) J. Comput. System Sci. , vol.37 , pp. 130-143
- Raghavan¹

7
- 85025263656
- Universal schemes for parallel communication
- (1979) Proc. 13th Ann. ACM Symp. on Theory of Computing , pp. 263-277
- Valiant¹ Brebner²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.