Joel Rybicki

Alistarh Group

20 Publications

Mark all

[20]
2023 | Journal Article | IST-REx-ID: 12566 | OA
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
[Published Version] View | Files available | DOI | WoS
 
[19]
2022 | Conference Paper | IST-REx-ID: 11184 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[18]
2022 | Conference Paper | IST-REx-ID: 12182 | OA
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
[Published Version] View | Files available | DOI
 
[17]
2022 | Conference Paper | IST-REx-ID: 11844 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[16]
2022 | Conference Paper | IST-REx-ID: 11707 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[15]
2021 | Conference Paper | IST-REx-ID: 10218 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[14]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[13]
2021 | Conference Paper | IST-REx-ID: 9823 | OA
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). Wrocław, Poland: Springer Nature. https://doi.org/10.1007/978-3-030-79527-6_6
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2021 | Conference Paper | IST-REx-ID: 10854 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2021 | Journal Article | IST-REx-ID: 10855 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2021 | Conference Paper | IST-REx-ID: 9678 | OA
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). Virtual Event, United States. https://doi.org/10.1145/3409964.3461785
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[9]
2020 | Journal Article | IST-REx-ID: 7224 | OA
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
[Published Version] View | Files available | DOI | WoS
 
[8]
2020 | Conference Paper | IST-REx-ID: 15074 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[7]
2019 | Conference Paper | IST-REx-ID: 6931 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[6]
2019 | Journal Article | IST-REx-ID: 6936 | OA
Ovaskainen, O., Rybicki, J., & Abrego, N. (2019). What can observational data reveal about metacommunity processes? Ecography. Wiley. https://doi.org/10.1111/ecog.04444
[Published Version] View | Files available | DOI | WoS
 
[5]
2019 | Journal Article | IST-REx-ID: 6972 | OA
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
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2018 | Journal Article | IST-REx-ID: 43 | OA
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
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2018 | Journal Article | IST-REx-ID: 76 | OA
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
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 6932
Brandt, S., Hirvonen, J., Korhonen, J. H., Lempiäinen, T., Östergård, P. R. J., Purcell, C., … Uznański, 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
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed

20 Publications

Mark all

[20]
2023 | Journal Article | IST-REx-ID: 12566 | OA
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
[Published Version] View | Files available | DOI | WoS
 
[19]
2022 | Conference Paper | IST-REx-ID: 11184 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[18]
2022 | Conference Paper | IST-REx-ID: 12182 | OA
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
[Published Version] View | Files available | DOI
 
[17]
2022 | Conference Paper | IST-REx-ID: 11844 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[16]
2022 | Conference Paper | IST-REx-ID: 11707 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[15]
2021 | Conference Paper | IST-REx-ID: 10218 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[14]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[13]
2021 | Conference Paper | IST-REx-ID: 9823 | OA
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). Wrocław, Poland: Springer Nature. https://doi.org/10.1007/978-3-030-79527-6_6
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2021 | Conference Paper | IST-REx-ID: 10854 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2021 | Journal Article | IST-REx-ID: 10855 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2021 | Conference Paper | IST-REx-ID: 9678 | OA
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). Virtual Event, United States. https://doi.org/10.1145/3409964.3461785
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[9]
2020 | Journal Article | IST-REx-ID: 7224 | OA
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
[Published Version] View | Files available | DOI | WoS
 
[8]
2020 | Conference Paper | IST-REx-ID: 15074 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[7]
2019 | Conference Paper | IST-REx-ID: 6931 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
[6]
2019 | Journal Article | IST-REx-ID: 6936 | OA
Ovaskainen, O., Rybicki, J., & Abrego, N. (2019). What can observational data reveal about metacommunity processes? Ecography. Wiley. https://doi.org/10.1111/ecog.04444
[Published Version] View | Files available | DOI | WoS
 
[5]
2019 | Journal Article | IST-REx-ID: 6972 | OA
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
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2018 | Journal Article | IST-REx-ID: 43 | OA
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
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2018 | Journal Article | IST-REx-ID: 76 | OA
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
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 6932
Brandt, S., Hirvonen, J., Korhonen, J. H., Lempiäinen, T., Östergård, P. R. J., Purcell, C., … Uznański, 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
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed