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

메뉴 건너뛰기

Mathematical Systems Theory

Volumn 24, Issue 1, 1991, Pages 223-232

Tight bounds for oblivious routing in the hypercube

(3) Kaklamanis, Christos a Krizanc, Danny b Tsantilas, Thanasis a

a HARVARD UNIVERSITY (United States)

b UNIVERSITY OF ROCHESTER (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002712504 PISSN: 00255661 EISSN: 14330490 Source Type: Journal
DOI: 10.1007/BF02090400 Document Type: Article

Times cited : (36)

References (17)

1
- 84935926847
- B. Aiello and T. Leighton, Coding Theory, Hypercube Embeddings, and Fault Tolerance, in Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 125–136.

2
- 84935966639
- R. Aleliunas, Randomized Parallel Communication, in Proc. ACM Symposium on Principles of Distributed Computing, 1982, pp. 60–72.

3
- 0002098184
- Décomposition de la somme cartésienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
- (1982) Discrete Math. , vol.38 , pp. 7-16
- Aubert, J.¹ Schneider, B.²

4
- 0022012899
- Routing, Merging and Sorting on Parallel Models of Computation
- (1985) J. Comput. System Sci. , vol.30 , pp. 130-145
- Borodin, A.¹ Hopcroft, J.²

5
- 0004295472
- Kluwer, Boston
- (1990) Decompositions of Graphs
- Bosák, J.¹

6
- 84935989857
- D. Krizanc, Oblivious Routing with Limited Buffer Capacity, J. Comput. System Sci. (to appear).

7
- 84935941439
- D. Krizanc, D. Peleg, and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, in Proc. 20th ACM Symposium on Theory of Computing, 1988, pp. 93–102.

8
- 0025229304
- An Optimal Time Bound for Oblivious Routing
- (1990) Algorithmica , vol.5 , pp. 243-250
- Parberry, I.¹

9
- 0024641589
- Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance
- (1989) J. Assoc. Comput. Mach. , vol.36 , pp. 335-348
- Rabin, M.O.¹

10
- 84935977556
- Optimal Routing Algorithms for Mesh-Connected Processor Arrays, Algorithmica (to appear)
- Lecture Notes in Computer Science, 319, Springer-Verlag, Berlin
- (1988) Preliminary version in Proc. AWOC '88 , pp. 411-422
- Rajasekaran, S.¹ Tsantilas²

11
- 84951611861
- Über drei kombinatorische Probleme am n-dimensionalen Würfel und Würfelgitter
- (1955) Abh. Math. Semi. Univ. Hamburg , vol.20 , pp. 10-19
- Ringel, G.¹

12
- 0004090058
- Computer Science Press, Rockville, MD
- (1984) Computational Aspects of VLSI
- Ullman, J.¹

13
- 0021465184
- Efficient Schemes for Parallel Communication
- (1984) J. Assoc. Comput. Mach. , vol.31 , pp. 507-517
- Upfal, E.¹

14
- 0000415121
- A Scheme for Fast Parallel Communication
- (1982) SIAM Journal on Computing , vol.11 , pp. 350-361
- Valiant, L.G.¹

15
- 0002655387
- General Purpose Parallel Architectures
- J., van Leeuwan, Elsevier, Amsterdam, MIT Press, Cambridge, MA
- (1990) Handbook of Theoretical Computer Science , pp. 943-971
- Valiant, L.G.¹

16
- 84935948376
- L. G. Valiant and G. J. Brebner, Universal Schemes for Parallel Communication, in Proc. 13th ACM Symposium on Theorry of Computing, 1981, pp. 263–277.

17
- 53149116248
- University of Waterloo, Waterloo, Ontario
- (1986) Hamming Geometry
- Wiedemann, D.H.¹

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