메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1056-1065

A tight lower bound for parity in noisy communication networks

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL THEORY; DECISION THEORY; DECISION TREES; PUBLIC WORKS; SENSORS; TELECOMMUNICATION NETWORKS; TELEVISION BROADCASTING; TRANSMISSIONS;

EID: 57949111553     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (21)

References (9)
  • 1
    • 0033875114 scopus 로고    scopus 로고
    • Finding or in noisy broadcast network
    • January
    • U. Feige and J. Kilian. Finding or in noisy broadcast network. Information Processing Letters, 73(1-2):69-75, January 2000.
    • (2000) Information Processing Letters , vol.73 , Issue.1-2 , pp. 69-75
    • Feige, U.1    Kilian, J.2
  • 5
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • March
    • W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, March 1963.
    • (1963) Journal of the American Statistical Association , vol.58 , Issue.301 , pp. 13-30
    • Hoeffding, W.1


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