Highly symmetric expanders

DOI10.1006/FFTA.2001.0341zbMATH Open1004.94042OpenAlexW2125127090MaRDI QIDQ700158FDOQ700158

San Ling, Yeow Meng Chee

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

Recommendations

• scientific article; zbMATH DE number 1465652
• Expander graphs in pure and applied mathematics
• Symmetric groups and expander graphs.
• Expander graphs and their applications
• Symmetric groups and expanders

zbMATH Keywords

expander graphssymmetric graphsRamanujan graphsswitching graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Eigenvalues and expanders
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ramanujan graphs
• Hard examples for resolution
• Explicit Concentrators from Generalized N-Gons
• Sorting in \(c \log n\) parallel steps
• Pseudorandomness for network algorithms
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Superconcentrators
• Title not available (Why is that?)
• Random Cayley graphs and expanders
• Explicit constructions of linear-sized superconcentrators
• Title not available (Why is that?)
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• A unified theory of interconnection network structure
• Time-space tradeoffs for computing functions, using connectivity properties of their circuits
• Graph-theoretic properties in computational complexity
• A note on time-space tradeoffs for computing continuous functions
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Space bounds for a game on graphs
• The complexity of testing whether a graph is a superconcentrator
• Asymptotically optimal switching circuits
• Time-Space trade-offs for some algebraic problems
• Title not available (Why is that?)
• Existence and Construction of Edge-Disjoint Paths on Expander Graphs
• Title not available (Why is that?)

Cited In (5)

• HIGH DIMENSIONAL EXPANDERS
• Limiting distributions of maximum likelihood estimators for unstable autoregressive moving-average time series with general autoregressive heteroscedastic errors
• Hypergraph expanders of all uniformities from Cayley graphs
• Symmetric groups and expander graphs.
• Expansion of product replacement graphs

This page was built for publication: Highly symmetric expanders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700158)