SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Combinatorics Probability and Computing

Volumn 9, Issue 5, 2000, Pages 421-424

The Clairvoyant Demon Has a Hard Task

(1) Gács, Peter a

a BOSTON UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034549367 PISSN: 09635483 EISSN: None Source Type: Journal
DOI: 10.1017/S0963548300004405 Document Type: Article

Times cited : (16)

References (3)

1
- 85037454936
- Dependent percolation in two dimensions
- Balister, P. N., Bollobás, B. and Stacey, A. N. (2000) Dependent percolation in two dimensions. Random Struct. Algorithms 16 415-435.
- (2000) Random Struct. Algorithms , vol.16 , pp. 415-435
- Balister, P.N.¹ Bollobás, B.² Stacey, A.N.³

2
- 0001305184
- Collisions among random walks on a graph
- Coppersmith, D., Tetali, P. and Winkler, P. (1993) Collisions among random walks on a graph. SIAM J. Discrete Math. 6 363-374.
- (1993) SIAM J. Discrete Math. , vol.6 , pp. 363-374
- Coppersmith, D.¹ Tetali, P.² Winkler, P.³

3
- 0442287465
- Dependent percolation and colliding random walks
- Winkler, P. (2000) Dependent percolation and colliding random walks. Probab. Rel. Fields 117 495-513.
- (2000) Probab. Rel. Fields , vol.117 , pp. 495-513
- Winkler, P.¹

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