Author:
Alon Noga,Nisan Noam,Raz Ran,Weinstein Omri
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Rounds vs Communication Tradeoffs for Maximal Independent Sets;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. On the hardness of dominant strategy mechanism design;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
4. Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions;SIAM Journal on Computing;2022-04-07
5. Combinatorial Auctions Do Need Modest Interaction;ACM Transactions on Economics and Computation;2020-04-21