Pages that link to "Item:Q3782808"
From MaRDI portal
The following pages link to Better expanders and superconcentrators (Q3782808):
Displaying 19 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Matching nuts and bolts faster (Q671403) (← links)
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators (Q800384) (← links)
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends (Q967371) (← links)
- On using deterministic functions to reduce randomness in probabilistic algorithms (Q1094137) (← links)
- Expanders obtained from affine transformations (Q1098859) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- A geometric condition for incidence-matrix nullvectors (Q1123895) (← links)
- Effect of connectivity in an associative memory model (Q1309388) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)
- Multi-processor scheduling and expanders (Q1336770) (← links)
- Natural bounded concentrators (Q1842573) (← links)
- Cutoff for random lifts of weighted graphs (Q2119212) (← links)
- Generating sets for the multiplicative groups of algebras over finite fields and expander graphs (Q2409015) (← links)
- Minimal selectors and fault tolerant networks (Q3057156) (← links)
- Matching nuts and bolts faster (Q6487988) (← links)
