1. Kook Jin Ahn , Sudipto Guha , and Andrew McGregor . 2012 . Analyzing graph structure via linear measurements . In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms. SIAM, 459--467 . Kook Jin Ahn, Sudipto Guha, and Andrew McGregor. 2012. Analyzing graph structure via linear measurements. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms. SIAM, 459--467.
2. A trade-off between information and communication in broadcast protocols
3. Andrew Drucker , Fabian Kuhn , and Rotem Oshman . 2014 . On the power of the congested clique model . In ACM Symposium on Principles of Distributed Computing, PODC '14 , Paris, France, July 15--18 , 2014. 367--376. Andrew Drucker, Fabian Kuhn, and Rotem Oshman. 2014. On the power of the congested clique model. In ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15--18, 2014. 367--376.
4. Mohsen Ghaffari and Krzysztof Nowicki . 2018 . Congested Clique Algorithms for the Minimum Cut Problem. In PODC 2018. 357--366. Mohsen Ghaffari and Krzysztof Nowicki. 2018. Congested Clique Algorithms for the Minimum Cut Problem. In PODC 2018. 357--366.
5. Mohsen Ghaffari and Merav Parter . 2016 . MST in log-star rounds of congested clique . In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. 19--28 . Mohsen Ghaffari and Merav Parter. 2016. MST in log-star rounds of congested clique. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. 19--28.