1. Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev. 2013. Parallel algorithms for geometric graph problems. Proceedings of the forty-sixth annual ACM symposium on Theory of computing (2013). https://api.semanticscholar.org/CorpusID:316401
2. Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. 2019. Lower Bounds for Maximal Matchings and Maximal Independent Sets. 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (2019), 481--497. https://api.semanticscholar.org/CorpusID:57721262
3. Distributed ∆-coloring plays hide-and-seek
4. Distributed Lower Bounds for Ruling Sets
5. The Locality of Distributed Symmetry Breaking