Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. N. Alon: Eigenvalues and expanders, Combinatorica 6 (1986), 83–96.
2. N. Alon and F. R. K. Chung: Explicit construction of linear sized tolerant networks, Discrete Math. 72 (1988), 15–19; (Proc. of the First Japan Conference on Graph Theory and Applications, Hakone, Japan, 1986.)
3. N. Alon, S. Ganguly and N. Srivastava: High-girth near-Ramanujan graphs with localized eigenvectors, Israel J. Math., to appear, arXiv:1908.03694, 2019.
4. R. C. Baker, G. Harman and J. Pintz: The difference between consecutive primes II., Proc. London Math. Soc. 83 (2001), 532–562.
5. A. Ben-Aroya and A. Ta-Shma: A combinatorial construction of almost Ramanujan graphs using the zig-zag product, SIAM Journal on Computing 40 (2011), 267–290.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantum-like states on complex synchronized networks;Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences;2024-08
2. Strong blocking sets and minimal codes from expander graphs;Transactions of the American Mathematical Society;2024-06-11
3. Analyzing Ta-Shma’s Code via the Expander Mixing Lemma;IEEE Transactions on Information Theory;2024-02
4. Paradigms for Unconditional Pseudorandom Generators;Foundations and Trends® in Theoretical Computer Science;2024
5. Explicit orthogonal and unitary designs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06