Author:
Ben-Aroya Avraham,Ta-Shma Amnon
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Analyzing Ta-Shma’s Code via the Expander Mixing Lemma;IEEE Transactions on Information Theory;2024-02
2. Paradigms for Unconditional Pseudorandom Generators;Foundations and Trends® in Theoretical Computer Science;2024
3. Random Walks on Rotating Expanders;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Expander random walks: a Fourier-analytic approach;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. Explicit Near-Ramanujan Graphs of Every Degree;SIAM Journal on Computing;2021-02-23