SCOPUS 정보 검색 플랫폼

Volumn 28, Issue 1, 1995, Pages 1-11

Robust algorithms for packet routing in a mesh

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040941723 PISSN: 00255661 EISSN: 14330490 Source Type: Journal
DOI: 10.1007/BF01294592 Document Type: Article

Times cited : (4)

References (9)

1
- 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-509
- Chernoff, H.¹

2
- 84936118569
- J. Hastad, F. T. Leighton, and M. Newman. Reconfiguring a hypercube in the presence of faults. Proc. 19th Annual Symposium on Theory of Computing, pages 274–294, 1987.

3
- 84936132278
- J. Hastad, F. T. Leighton, and M. Newman. Fast computation using faulty hypercubes. Proc. 21st Annual Symposium on Theory of Computing, pages 251–263, 1989.

4
- 84936125408
- C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. D. Thomborson, and A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors. Proc. 31st Annual Symposium on Foundations of Computer Science, pages 285–296, 1990.

5
- 0022936652
- A survey of algorithms for integrating wafer-scale systolic arrays
- Elsevier, Amsterdam
- (1986) Wafer Scale Integration , pp. 177-195
- Leighton, F.T.¹ Leiserson, C.E.²

6
- 84936151554
- F. T. Leighton and B. Maggs. Expanders might be practical: Fast algorithms for routing around faults in multibutterflies. Proc. 30th Annual Symposium on Foundations of Computer Science, pages 384–389, 1989.

7
- 0017483558
- Sorting on a mesh-connected parallel computer
- (1977) Comm. ACM , vol.20 , pp. 263-271
- Thompson, C.D.¹ Kung, H.T.²

8
- 84936103393
- E. Upfal. An O(log N) deterministic packet routing scheme. Proc. 21st ACM Annual Symposium on Theory of Computing, pages 241–250, 1989.

9
- 84936102171
- L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. Proc. 13th Annual ACM Symposium on Theory of Computing, pages 263–277, 1981.

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