Affiliation:
1. Massachusetts Institute of Technology, USA
Funder
Google Faculty Research Award
NSF (National Science Foundation)
IBM Fellowship
European Research Council (ERC)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Symmetric Exponential Time Requires Near-Maximum Circuit Size;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Beating Brute Force for Compression Problems;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. Paradigms for Unconditional Pseudorandom Generators;Foundations and Trends® in Theoretical Computer Science;2024
5. A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06