1. A fast and simple randomized parallel algorithm for the maximal independent set problem
2. Baruch Awerbuch , Andrew V. Goldberg , Michael Luby , and Serge A. Plotkin . 1989. Network Decomposition and Locality in Distributed Computation . In Proc. 30th Symp. on Foundations of Computer Science (FOCS). 364--369 . https: //doi.org/10.1109/SFCS. 1989 .63504 10.1109/SFCS.1989.63504 Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, and Serge A. Plotkin. 1989. Network Decomposition and Locality in Distributed Computation. In Proc. 30th Symp. on Foundations of Computer Science (FOCS). 364--369. https: //doi.org/10.1109/SFCS.1989.63504
3. Lower Bounds for Maximal Matchings and Maximal Independent Sets
4. Alkida Balliu , Sebastian Brandt , Fabian Kuhn , and Dennis Olivetti . 2021. Distributed -Coloring Plays Hide-and-Seek. arXiv preprint arXiv:2110.00643 ( 2021 ). Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. 2021. Distributed -Coloring Plays Hide-and-Seek. arXiv preprint arXiv:2110.00643 (2021).
5. Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta