Superconcentrators
From MaRDI portal
Publication:4134003
Cited in
(42)- Size-space tradeoffs for oblivious computations
- Lower bounds in algebraic computational complexity
- On using deterministic functions to reduce randomness in probabilistic algorithms
- Expanders obtained from affine transformations
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Eigenvalues and expanders
- Pebbling with an auxiliary pushdown
- The complexity of testing whether a graph is a superconcentrator
- Superconcentrators of depth 2
- Explicit constructions of linear-sized superconcentrators
- Size bounds for superconcentrators
- Invariant and geometric aspects of algebraic complexity theory. I
- Three-regular path pairable graphs
- A note on a construction of Margulis
- Time-space trade-offs in a pebble game
- Extracting randomness: A survey and new constructions
- Multi-processor scheduling and expanders
- Recursive construction for 3-regular expanders
- Finite fields and Ramanujan graphs
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Lower bounds for matrix factorization
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization
- OptORAMa: optimal oblivious RAM
- Rounds versus time for the two person pebble game
- On the spectral distribution of large weighted random regular graphs
- Complexity of linear circuits and geometry
- Uniformly Exhaustive Submeasures and Nearly Additive Set Functions
- Explicit Concentrators from Generalized N-Gons
- Expanders and Diffusers
- Diameters and Eigenvalues
- Construction of expanders and superconcentrators using Kolmogorov complexity
- Lower bounds for matrix factorization
- Rounds versus time for the two person pebble game (extended abstract)
- Approximate modularity revisited
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- OptORAMa: Optimal oblivious RAM
- Min-rank conjecture for log-depth circuits
- Highly symmetric expanders
- A new connection between node and edge depth robust graphs
- Real -conjecture for sum-of-squares: a unified approach to lower bound and derandomization
- Smaller superconcentrators of density 28
- Entropy of operators or why matrix multiplication is hard for depth-two circuits
This page was built for publication: Superconcentrators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4134003)
