Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.”https://doi.org/10.1016/j.tcs.2023.113733__Theoretical Computer Science. Elsevier, 2023.https://doi.org/10.1016/j.tcs.2023.113733 .

Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Fast Graphical Population Protocols.”https://doi.org/10.4230/LIPIcs.OPODIS.2021.14__In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.OPODIS.2021.14 .

Pacut, Maciej, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, and Aleksandr Tereshchenko. “Brief Announcement: Temporal Locality in Online Algorithms.”https://doi.org/10.4230/LIPIcs.DISC.2022.52__In 36th International Symposium on Distributed Computing, Vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.DISC.2022.52 .

Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.”https://doi.org/10.1145/3519270.3538435__In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 246–56. Association for Computing Machinery, 2022.https://doi.org/10.1145/3519270.3538435 .

Balliu, Alkida, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, and Jukka Suomela. “Local Mending.”https://doi.org/10.1007/978-3-031-09993-9_1__In International Colloquium on Structural Information and Communication Complexity, edited by Merav Parter, 13298:1–20. LNCS. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-09993-9_1 .

Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Brief Announcement: Fast Graphical Population Protocols.”https://doi.org/10.4230/LIPIcs.DISC.2021.43__In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.DISC.2021.43 .

Korhonen, Janne, Ami Paz, Joel Rybicki, Stefan Schmid, and Jukka Suomela. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.”https://doi.org/10.4230/LIPIcs.DISC.2021.58__In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.DISC.2021.58 .

Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.”https://doi.org/10.1007/978-3-030-79527-6_6__In Structural Information and Communication Complexity, 12810:87–105. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-79527-6_6 .

Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.”https://doi.org/10.1145/3410220.3453923__In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 71–72. Association for Computing Machinery, 2021.https://doi.org/10.1145/3410220.3453923 .

Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.”https://doi.org/10.1145/3447384__Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery, 2021.https://doi.org/10.1145/3447384 .

Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Efficient Load-Balancing through Distributed Token Dropping.”https://doi.org/10.1145/3409964.3461785__In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 129–39, 2021.https://doi.org/10.1145/3409964.3461785 .

Rybicki, Joel, Nerea Abrego, and Otso Ovaskainen. “Habitat Fragmentation and Species Diversity in Competitive Communities.”https://doi.org/10.1111/ele.13450__Ecology Letters. Wiley, 2020.https://doi.org/10.1111/ele.13450 .

Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.”https://doi.org/10.4230/LIPIcs.DISC.2020.40__In 34th International Symposium on Distributed Computing, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.DISC.2020.40 .

Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”https://doi.org/10.4230/LIPICS.DISC.2019.29__In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.DISC.2019.29 .

Ovaskainen, Otso, Joel Rybicki, and Nerea Abrego. “What Can Observational Data Reveal about Metacommunity Processes?”https://doi.org/10.1111/ecog.04444__Ecography. Wiley, 2019.https://doi.org/10.1111/ecog.04444 .

Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.”https://doi.org/10.1145/3339471__Journal of the ACM. ACM, 2019.https://doi.org/10.1145/3339471 .

Foerster, Klaus-Tycho, Janne Korhonen, Joel Rybicki, and Stefan Schmid. “Does Preprocessing Help under Congestion?”https://doi.org/10.1145/3293611.3331581__In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 259–61. ACM, 2019.https://doi.org/10.1145/3293611.3331581 .

Rybicki, Joel, Eva Kisdi, and Jani Anttila. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.”https://doi.org/10.1073/pnas.1721061115__PNAS. National Academy of Sciences, 2018.https://doi.org/10.1073/pnas.1721061115 .

Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.”https://doi.org/10.1007/s00446-018-0342-6__Distributed Computing. Springer, 2018.https://doi.org/10.1007/s00446-018-0342-6 .

Brandt, Sebastian, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R.J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, and Przemysaw Uznaski. “LCL Problems on Grids,”https://doi.org/10.1145/3087801.3087833__101–10. ACM Press, 2017.https://doi.org/10.1145/3087801.3087833 .