Limitations on Explicit Constructions of Expanding Graphs
- 1 February 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (1) , 156-166
- https://doi.org/10.1137/0213011
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Asymptotically tight bounds on time-space trade-offs in a pebble gameJournal of the ACM, 1982
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking NetworksBell System Technical Journal, 1979
- Explicit constructions of linear size superconcentratorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A note on time-space tradeoffs for computing continuous functionsInformation Processing Letters, 1979
- Time-space trade-offs in a pebble gameActa Informatica, 1978
- SuperconcentratorsSIAM Journal on Computing, 1977
- Space bounds for a game on graphsTheory of Computing Systems, 1976
- Generalized multi‐stage connection networksNetworks, 1972
- On non‐blocking switching networksNetworks, 1971
- A Sorting ProblemJournal of the ACM, 1962