1. A fast and simple randomized parallel algorithm for the maximal independent set problem;Alon Noga;Journal of algorithms,1986
2. John Augustine , William K. Moses , Jr., and Gopal Pandurangan . 2022 . Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds . In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (PODC). 51--53 . John Augustine, William K. Moses, Jr., and Gopal Pandurangan. 2022. Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (PODC). 51--53.
3. Lower Bounds for Maximal Matchings and Maximal Independent Sets;Balliu Alkida;Journal of the ACM (JACM),2021
4. The Locality of Distributed Symmetry Breaking;Barenboim Leonid;Journal of the ACM (JACM),2016
5. Leonid Barenboim and Tzalik Maimon . 2021 . Deterministic Logarithmic Completeness in the Distributed Sleeping Model. In 35th International Symposium on Distributed Computing, DISC 2021. Leonid Barenboim and Tzalik Maimon. 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model. In 35th International Symposium on Distributed Computing, DISC 2021.