Highly symmetric expanders
From MaRDI portal
Publication:700158
DOI10.1006/ffta.2001.0341zbMath1004.94042OpenAlexW2125127090MaRDI QIDQ700158
Publication date: 30 September 2002
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4eb57e0ba72931b1fb4d5d1e00371b9ab3c1cd5a
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Sorting in \(c \log n\) parallel steps
- A unified theory of interconnection network structure
- Ramanujan graphs
- Eigenvalues and expanders
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- The complexity of testing whether a graph is a superconcentrator
- Asymptotically optimal switching circuits
- Explicit constructions of linear-sized superconcentrators
- Graph-theoretic properties in computational complexity
- A note on time-space tradeoffs for computing continuous functions
- Pseudorandomness for network algorithms
- Time-Space trade-offs for some algebraic problems
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- Explicit Concentrators from Generalized N-Gons
- Hard examples for resolution
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Superconcentrators
- Space bounds for a game on graphs
- Random Cayley graphs and expanders
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs
This page was built for publication: Highly symmetric expanders
