Author:
Barak Boaz,Rao Anup,Shaltiel Ronen,Wigderson Avi
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error;SIAM Journal on Computing;2023-11-14
2. The Hardest Explicit Construction;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
3. Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11
4. Quasi chain rule for min-entropy;Information Processing Letters;2018-06
5. Improved non-malleable extractors, non-malleable codes and independent source extractors;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19