Pages that link to "Item:Q1125612"
From MaRDI portal
The following pages link to Expanders that beat the eigenvalue bound: Explicit construction and applications (Q1125612):
Displaying 20 items.
- Rainbow paths (Q965956) (← links)
- Expanders, randomness, or time versus space (Q1107314) (← links)
- Optimal parallel selection has complexity O(log log N) (Q1118404) (← links)
- Recursive construction for 3-regular expanders (Q1343165) (← links)
- Constant time parallel sorting: An empirical view. (Q1401981) (← links)
- Local expanders (Q1653336) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- Explicit expanding expanders (Q2408170) (← links)
- Computation of best possible low degree expanders (Q2462391) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Interactive Communication, Diagnosis and Error Control in Networks (Q3637318) (← links)
- Multicast Routing and Design of Sparse Connectors (Q3637320) (← links)
- Halvers and expanders (Q4228443) (← links)
- From Expanders to Hitting Distributions and Simulation Theorems (Q5005099) (← links)
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
