Journal of the ACM (JACM)
Combinatorica
Expanders, randomness, or time versus space
Proc. of the conference on Structure in complexity theory
A Unified theory of interconnection network structure
Theoretical Computer Science
Sorting in c log n parallel steps
Combinatorica
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Existence and Construction of Edge-Disjoint Pathson Expander Graphs
SIAM Journal on Computing
Linear-time encodable and decodable error-correcting codes
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Asymptotically tight bounds on time-space trade-offs in a pebble game
Journal of the ACM (JACM)
Time-space tradeoffs for some algebraic problems
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Non-existence of one-dimensional expanding graphs
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
A note on time-space tradeoffs for computing continuous functions
Information Processing Letters
Graph-theoretic properties in computational complexity
Journal of Computer and System Sciences
Random Cayley graphs and expanders
Random Structures & Algorithms
| Hi-index | 0.00 |
Expander graphs are relevant to theoretical computer science in addition to the construction of high-performance switching networks. In communication network applications, a high degree of symmetry in the underlying topology is often advantageous, as it may reduce the complexity of designing and analyzing switching and routing algorithms. We give explicit constructions of expander graphs that are highly symmetric. In particular, we construct infinite families of Ramanujan graphs with large guarantees on the orders of their automorphism groups. Although nonlinear, our expander graphs are within a constant factor of the size of the smallest graphs exhibiting the same expansion properties. This work generalizes and extends in several directions a previous explicit construction of expander graphs based on finite projective spaces due to Alon.