Author:
Braverman Mark,Rao Anup,Weinstein Omri,Yehudayoff Amir
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. XOR Lemmas for Communication via Marginal Information;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Near Optimal Memory-Regret Tradeoff for Online Learning;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. The Communication Complexity of Functions with Large Outputs;Structural Information and Communication Complexity;2023
5. Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract);2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10