Self-routing superconcentrators

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 355-361

  Pippenger, Nicholas ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

TIN; ALGORITHMS; CRITICAL PATH ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; FINITE AUTOMATA; GRAPH THEORY; PACKET SWITCHING;

DISJOINT PATHS; DISTRIBUTION ALGORITHMS; FAULT-TOLERANT; FINITE ALPHABET; FINITE NUMBER; NON-BLOCKING NETWORK; PACKET ROUTING; SELF-ROUTING;

COMPUTATION THEORY; COMPUTER SYSTEMS;

FAULT TOLERANT PACKET ROUTING NETWORKS; SELF ROUTING NONBLOCKING NETWORKS; SELF ROUTING SUPERCONCENTRATORS; TOKEN DISTRIBUTION ALGORITHMS;

EID: 0027224338     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167195     Document Type: Conference Paper

References (20)

1. N. Alon, "Eigenvalues and Expanders", Combinatories 6 (1986) 83-96.
2. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
3. M. Ajtai, J. Komlos and E. Szemeredi, "Sorting in clogn Parallel Steps", Combinatorica, 3 (1983) 1-19.
4. M. Ajtai, J. Komlos and E. Szemeredi, "An O(nlogn) Sorting Network", ACM Symp. on Theory of Computing, 15 (1983) 1-9.
5. S. Arora, T. Leighton and B. Maggs, "On-Line Algorithms for Path Selection in a Nonblocking Network", ACM Symp. on Theory of Computing, 22 (1990) 149-158.
6. S. Arora, T. Leighton and B. Maggs, "On-Line Algorithms for Path Selection in a Nonblocking Network", preprint, .
7. K. E. Batcher, "Sorting Networks and Their Applications", Proc. AFIPS Spring Joint Computer Conf, 32 (1968) 307-314.
8. O. Gabber and Z. Galil, "Explicit Constructions of Linear-Sized Superconcentrators", J. Comp. and Sys. Sci., 22 (1981) 407-420.
9. J. E. Hopcroft and R. M. Karp, "An n5/2 Algorithm for Maximal Matchngs in Bipartitte Graphs", SIAM J. Computing, 2 (1975) 225-231.
10. S. Jimbo and A. Maruoka, "Expanders Obtained from Affine Transformations", Combinatorica, 7 (1987) 343-355.
11. T. Leighton and B. Maggs, "Expanders Might Be Practical: Fast Algorithms for Routing around Faults on Multibutterflies", IEEE Symp. on Foundations of Computer Science, 30 (1989) 384-389.
12. A. Lubotzky, R. Phillips and P. Sarnak, "Ra- manujan Graphs", Combinatorica, 8 (1988) 261- 277.
13. G. A.Margulis, "Explicit Construction of Concentrators", Problems of Inform. Transm., 9 (1974) 71-80.
14. G. A. Margulis, "Explicit Group-Theoretical Constructions of Combinatorial Schemes and Their Application to the Design of Expanders and Concentrators", Problems of Inform. Transm., 24 (1988) 39-46.
15. D. Peleg and E. Upfal, "The Token Distribution Problem", SIAM J. Computing, 18 (1989)229- 243.
16. M. S. Pinsker, "On the Complexity of a Concentrator", Internat. Teletraffic Congr., 7 (1973) 3181-3184.
17. N. Pippenger, "Superconcentrators", SIAM J. Computing, 6 (1977) 298-304.
18. N. Pippenger, "On Networks of Noisy Gates", IEEE Symp. on Foundations of Computer Science, 26 (1985) 30-38.
19. E. Upfal, "An O(logN) Deterministic Packet- Routing Scheme", ACM Symp. on Theory of Computing, 21 (1989) 241-250.
20. L. G. Valiant, "Graph-Theoretic Properties in Computational Complexity", J. Comp. and Sys. Sci, 13 (1976) 278-285.