Alistarh, D.-A., Ellen, F., &; Rybicki, J. (2023). Wait-free approximate agreement on graphs. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2023.113733 
LibreCat: https://research-explorer.ista.ac.at/record/12566
DOI: 10.1016/j.tcs.2023.113733
WoS: 000934262700001

Alistarh, D.-A., Gelashvili, R., &; Rybicki, J. (2022). Fast graphical population protocols. In Q. Bramas, V. Gramoli, &; A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2021.14 
LibreCat: https://research-explorer.ista.ac.at/record/11184
DOI: 10.4230/LIPIcs.OPODIS.2021.14
arXiv: 2102.08808

Pacut, M., Parham, M., Rybicki, J., Schmid, S., Suomela, J., &; Tereshchenko, A. (2022). Brief announcement: Temporal locality in online algorithms. In 36th International Symposium on Distributed Computing (Vol. 246). Augusta, GA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2022.52 
LibreCat: https://research-explorer.ista.ac.at/record/12182
DOI: 10.4230/LIPIcs.DISC.2022.52

Alistarh, D.-A., Rybicki, J., &; Voitovych, S. (2022). Near-optimal leader election in population protocols on graphs. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 246–256). Salerno, Italy: Association for Computing Machinery.https://doi.org/10.1145/3519270.3538435 
LibreCat: https://research-explorer.ista.ac.at/record/11844
DOI: 10.1145/3519270.3538435
arXiv: 2205.12597

Balliu, A., Hirvonen, J., Melnyk, D., Olivetti, D., Rybicki, J., &; Suomela, J. (2022). Local mending. In M. Parter (Ed.), International Colloquium on Structural Information and Communication Complexity (Vol. 13298, pp. 1–20). Paderborn, Germany: Springer Nature.https://doi.org/10.1007/978-3-031-09993-9_1 
LibreCat: https://research-explorer.ista.ac.at/record/11707
DOI: 10.1007/978-3-031-09993-9_1
WoS: 000876977400001
arXiv: 2102.08703

Alistarh, D.-A., Gelashvili, R., &; Rybicki, J. (2021). Brief announcement: Fast graphical population protocols. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.43 
LibreCat: https://research-explorer.ista.ac.at/record/10218
DOI: 10.4230/LIPIcs.DISC.2021.43
arXiv: 2102.08808

Korhonen, J., Paz, A., Rybicki, J., Schmid, S., &; Suomela, J. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.58 
LibreCat: https://research-explorer.ista.ac.at/record/10219
DOI: 10.4230/LIPIcs.DISC.2021.58
arXiv: 2108.02655

Alistarh, D.-A., Ellen, F., &; Rybicki, J. (2021). Wait-free approximate agreement on graphs. In Structural Information and Communication Complexity (Vol. 12810, pp. 87–105). Wrocaw, Poland: Springer Nature.https://doi.org/10.1007/978-3-030-79527-6_6 
LibreCat: https://research-explorer.ista.ac.at/record/9823
DOI: 10.1007/978-3-030-79527-6_6
arXiv: 2103.08949

Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems (pp. 71–72). Virtual, Online: Association for Computing Machinery.https://doi.org/10.1145/3410220.3453923 
LibreCat: https://research-explorer.ista.ac.at/record/10854
DOI: 10.1145/3410220.3453923
arXiv: 2005.07637

Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery.https://doi.org/10.1145/3447384 
LibreCat: https://research-explorer.ista.ac.at/record/10855
DOI: 10.1145/3447384
arXiv: 2005.07637

Brandt, S., Keller, B., Rybicki, J., Suomela, J., &; Uitto, J. (2021). Efficient load-balancing through distributed token dropping. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 129–139).https://doi.org/10.1145/3409964.3461785__Virtual Event, United States.https://doi.org/10.1145/3409964.3461785 
LibreCat: https://research-explorer.ista.ac.at/record/9678
DOI: 10.1145/3409964.3461785
arXiv: 2005.07761

Rybicki, J., Abrego, N., &; Ovaskainen, O. (2020). Habitat fragmentation and species diversity in competitive communities. Ecology Letters. Wiley.https://doi.org/10.1111/ele.13450 
LibreCat: https://research-explorer.ista.ac.at/record/7224
DOI: 10.1111/ele.13450
WoS: 000503625200001

Brandt, S., Keller, B., Rybicki, J., Suomela, J., &; Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In 34th International Symposium on Distributed Computing (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2020.40 
LibreCat: https://research-explorer.ista.ac.at/record/15074
DOI: 10.4230/LIPIcs.DISC.2020.40
arXiv: 2005.07761

Nowak, T., &; Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.DISC.2019.29 
LibreCat: https://research-explorer.ista.ac.at/record/6931
DOI: 10.4230/LIPICS.DISC.2019.29
arXiv: 1908.02743

Ovaskainen, O., Rybicki, J., &; Abrego, N. (2019). What can observational data reveal about metacommunity processes? Ecography. Wiley.https://doi.org/10.1111/ecog.04444 
LibreCat: https://research-explorer.ista.ac.at/record/6936
DOI: 10.1111/ecog.04444
WoS: 000486348700001

Lenzen, C., &; Rybicki, J. (2019). Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. ACM.https://doi.org/10.1145/3339471 
LibreCat: https://research-explorer.ista.ac.at/record/6972
DOI: 10.1145/3339471
WoS: 000496514100001
arXiv: 1705.06173

Foerster, K.-T., Korhonen, J., Rybicki, J., &; Schmid, S. (2019). Does preprocessing help under congestion? In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 259–261). Toronto, ON, Canada: ACM.https://doi.org/10.1145/3293611.3331581 
LibreCat: https://research-explorer.ista.ac.at/record/6935
DOI: 10.1145/3293611.3331581
WoS: 000570442000037
arXiv: 1905.03012

Rybicki, J., Kisdi, E., &; Anttila, J. (2018). Model of bacterial toxin-dependent pathogenesis explains infective dose. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1721061115 
LibreCat: https://research-explorer.ista.ac.at/record/43
DOI: 10.1073/pnas.1721061115
WoS: 000447491300057

Lenzen, C., &; Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. Distributed Computing. Springer.https://doi.org/10.1007/s00446-018-0342-6 
LibreCat: https://research-explorer.ista.ac.at/record/76
DOI: 10.1007/s00446-018-0342-6
WoS: 000475627800005

Brandt, S., Hirvonen, J., Korhonen, J. H., Lempiäinen, T., Östergård, P. R. J., Purcell, C.,https://doi.org/10.1145/3087801.3087833__Uznaski, P. (2017). LCL problems on grids (pp. 101–110). Presented at the PODC: Principles of Distributed Computing, Washington, DC, United States: ACM Press.https://doi.org/10.1145/3087801.3087833 
LibreCat: https://research-explorer.ista.ac.at/record/6932
DOI: 10.1145/3087801.3087833