Better expanders and superconcentrators
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3864514
- scientific article; zbMATH DE number 3974994
- Tradeoffs in Depth-Two Superconcentrators
- Beyond the expanders
- New results on expanders
- Expanders and Diffusers
- Smaller superconcentrators of density 28
- Expanders with superquadratic growth
- Super-expanders and warped cones
- Relative expanders
Cited in
(25)- On using deterministic functions to reduce randomness in probabilistic algorithms
- Expanders obtained from affine transformations
- On embedding graphs in trees
- Eigenvalues and expanders
- A geometric condition for incidence-matrix nullvectors
- Effect of connectivity in an associative memory model
- Laplacian matrices of graphs: A survey
- On the relationship between the diameter and the size of a boundary of a directed graph
- Multi-processor scheduling and expanders
- Natural bounded concentrators
- Cutoff for random lifts of weighted graphs
- Note on ``Smaller explicit superconcentrators
- Generating sets for the multiplicative groups of algebras over finite fields and expander graphs
- Explicit bounded-degree unique-neighbor concentrators
- Minimal selectors and fault tolerant networks
- scientific article; zbMATH DE number 3864514 (Why is no real title available?)
- Expanders and Diffusers
- Diameters and Eigenvalues
- Pseudorandom generators for combinatorial checkerboards
- Construction of expanders and superconcentrators using Kolmogorov complexity
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Matching nuts and bolts faster
- Matching nuts and bolts faster
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends
This page was built for publication: Better expanders and superconcentrators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3782808)
