A new family of Cayley expanders (?)

DOI10.1145/1007352.1007423zbMath1192.68862OpenAlexW2022234468MaRDI QIDQ3580989

Eyal Rozenman, Aner Shalev, Avi Wigderson

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007423

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Related Items

Simple permutations mix even better ⋮ Expander graphs and their applications ⋮ Symmetric groups and expander graphs. ⋮ Symmetric LDPC codes and local testing ⋮ Nonembeddability theorems via Fourier analysis ⋮ Symmetric LDPC Codes and Local Testing ⋮ Symmetric groups and expanders

This page was built for publication: A new family of Cayley expanders (?)