1. Alistarh, D., Aspnes, J., Ellen, F., Gelashvili, R., Zhu, L.: Why extension-based proofs fail. CoRR abs/1811.01421 http://arxiv.org/abs/1811.01421 (2018). To appear in STOC 2019
2. Attiya, H., Castañeda, A., Herlihy, M., Paz, A.: Bounds on the step and namespace complexity of renaming. SIAM J. Comput. 48(1), 1–32 (2019). https://doi.org/10.1137/16M1081439
3. Balliu, A., Brandt, S., Hirvonen, J., Olivetti, D., Rabie, M., Suomela, J.: Lower bounds for maximal matchings and maximal independent sets. CoRR abs/1901.02441 http://arxiv.org/abs/1901.02441 (2019)
4. Barenboim, L., Elkin, M., Goldenberg, U.: Locally-iterative distributed ( $$\delta + 1$$ )-coloring below szegedy-vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (PODC), pp. 437–446 (2018). https://dl.acm.org/citation.cfm?id=3212769
5. Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. In: 53rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 321–330 (2012). https://doi.org/10.1109/FOCS.2012.60