Joel Rybicki

Alistarh Group

20 Publications

Mark all

[20]
2023 | Published | Journal Article | IST-REx-ID: 12566 | OA
Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. Theoretical Computer Science. 2023;948(2). doi:10.1016/j.tcs.2023.113733
[Published Version] View | Files available | DOI | WoS
 
[19]
2022 | Published | Conference Paper | IST-REx-ID: 11184 | OA
Alistarh D-A, Gelashvili R, Rybicki J. Fast graphical population protocols. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.14
[Published Version] View | Files available | DOI | arXiv
 
[18]
2022 | Published | Conference Paper | IST-REx-ID: 11707 | OA
Balliu A, Hirvonen J, Melnyk D, Olivetti D, Rybicki J, Suomela J. Local mending. In: Parter M, ed. International Colloquium on Structural Information and Communication Complexity. Vol 13298. LNCS. Springer Nature; 2022:1-20. doi:10.1007/978-3-031-09993-9_1
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[17]
2022 | Published | Conference Paper | IST-REx-ID: 11844 | OA
Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2022:246-256. doi:10.1145/3519270.3538435
[Published Version] View | Files available | DOI | arXiv
 
[16]
2022 | Published | Conference Paper | IST-REx-ID: 12182 | OA
Pacut M, Parham M, Rybicki J, Schmid S, Suomela J, Tereshchenko A. Brief announcement: Temporal locality in online algorithms. In: 36th International Symposium on Distributed Computing. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.DISC.2022.52
[Published Version] View | Files available | DOI
 
[15]
2021 | Published | Conference Paper | IST-REx-ID: 9678 | OA
Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ; 2021:129-139. doi:10.1145/3409964.3461785
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[14]
2021 | Published | Conference Paper | IST-REx-ID: 9823 | OA
Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:87-105. doi:10.1007/978-3-030-79527-6_6
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[13]
2021 | Published | Conference Paper | IST-REx-ID: 10218 | OA
Alistarh D-A, Gelashvili R, Rybicki J. Brief announcement: Fast graphical population protocols. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.43
[Published Version] View | Files available | DOI | arXiv
 
[12]
2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.58
[Published Version] View | Files available | DOI | arXiv
 
[11]
2021 | Published | Conference Paper | IST-REx-ID: 10854 | OA
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[9]
2020 | Published | Journal Article | IST-REx-ID: 7224 | OA
Rybicki J, Abrego N, Ovaskainen O. Habitat fragmentation and species diversity in competitive communities. Ecology Letters. 2020;23(3):506-517. doi:10.1111/ele.13450
[Published Version] View | Files available | DOI | WoS
 
[8]
2020 | Published | Conference Paper | IST-REx-ID: 15074 | OA
Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: 34th International Symposium on Distributed Computing. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.DISC.2020.40
[Published Version] View | Files available | DOI | arXiv
 
[7]
2019 | Published | Conference Paper | IST-REx-ID: 6931 | OA
Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29
[Published Version] View | Files available | DOI | arXiv
 
[6]
2019 | Published | Conference Paper | IST-REx-ID: 6935 | OA
Foerster K-T, Korhonen J, Rybicki J, Schmid S. Does preprocessing help under congestion? In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. ACM; 2019:259-261. doi:10.1145/3293611.3331581
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[5]
2019 | Published | Journal Article | IST-REx-ID: 6936 | OA
Ovaskainen O, Rybicki J, Abrego N. What can observational data reveal about metacommunity processes? Ecography. 2019;42(11):1877-1886. doi:10.1111/ecog.04444
[Published Version] View | Files available | DOI | WoS
 
[4]
2019 | Published | Journal Article | IST-REx-ID: 6972 | OA
Lenzen C, Rybicki J. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 2019;66(5). doi:10.1145/3339471
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2018 | Published | Journal Article | IST-REx-ID: 43 | OA
Rybicki J, Kisdi E, Anttila J. Model of bacterial toxin-dependent pathogenesis explains infective dose. PNAS. 2018;115(42):10690-10695. doi:10.1073/pnas.1721061115
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2018 | Published | Journal Article | IST-REx-ID: 76 | OA
Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Published | Conference Paper | IST-REx-ID: 6932
Brandt S, Hirvonen J, Korhonen JH, et al. LCL problems on grids. In: ACM Press; 2017:101-110. doi:10.1145/3087801.3087833
View | DOI
 
Marked Publication(s)

Search

Filter Publications

  • 19 OA Fulltext(s)

Display / Sort

Export / Embed

Grants


20 Publications

Mark all

[20]
2023 | Published | Journal Article | IST-REx-ID: 12566 | OA
Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. Theoretical Computer Science. 2023;948(2). doi:10.1016/j.tcs.2023.113733
[Published Version] View | Files available | DOI | WoS
 
[19]
2022 | Published | Conference Paper | IST-REx-ID: 11184 | OA
Alistarh D-A, Gelashvili R, Rybicki J. Fast graphical population protocols. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.14
[Published Version] View | Files available | DOI | arXiv
 
[18]
2022 | Published | Conference Paper | IST-REx-ID: 11707 | OA
Balliu A, Hirvonen J, Melnyk D, Olivetti D, Rybicki J, Suomela J. Local mending. In: Parter M, ed. International Colloquium on Structural Information and Communication Complexity. Vol 13298. LNCS. Springer Nature; 2022:1-20. doi:10.1007/978-3-031-09993-9_1
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[17]
2022 | Published | Conference Paper | IST-REx-ID: 11844 | OA
Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2022:246-256. doi:10.1145/3519270.3538435
[Published Version] View | Files available | DOI | arXiv
 
[16]
2022 | Published | Conference Paper | IST-REx-ID: 12182 | OA
Pacut M, Parham M, Rybicki J, Schmid S, Suomela J, Tereshchenko A. Brief announcement: Temporal locality in online algorithms. In: 36th International Symposium on Distributed Computing. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.DISC.2022.52
[Published Version] View | Files available | DOI
 
[15]
2021 | Published | Conference Paper | IST-REx-ID: 9678 | OA
Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ; 2021:129-139. doi:10.1145/3409964.3461785
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[14]
2021 | Published | Conference Paper | IST-REx-ID: 9823 | OA
Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:87-105. doi:10.1007/978-3-030-79527-6_6
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[13]
2021 | Published | Conference Paper | IST-REx-ID: 10218 | OA
Alistarh D-A, Gelashvili R, Rybicki J. Brief announcement: Fast graphical population protocols. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.43
[Published Version] View | Files available | DOI | arXiv
 
[12]
2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.58
[Published Version] View | Files available | DOI | arXiv
 
[11]
2021 | Published | Conference Paper | IST-REx-ID: 10854 | OA
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[9]
2020 | Published | Journal Article | IST-REx-ID: 7224 | OA
Rybicki J, Abrego N, Ovaskainen O. Habitat fragmentation and species diversity in competitive communities. Ecology Letters. 2020;23(3):506-517. doi:10.1111/ele.13450
[Published Version] View | Files available | DOI | WoS
 
[8]
2020 | Published | Conference Paper | IST-REx-ID: 15074 | OA
Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: 34th International Symposium on Distributed Computing. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.DISC.2020.40
[Published Version] View | Files available | DOI | arXiv
 
[7]
2019 | Published | Conference Paper | IST-REx-ID: 6931 | OA
Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29
[Published Version] View | Files available | DOI | arXiv
 
[6]
2019 | Published | Conference Paper | IST-REx-ID: 6935 | OA
Foerster K-T, Korhonen J, Rybicki J, Schmid S. Does preprocessing help under congestion? In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. ACM; 2019:259-261. doi:10.1145/3293611.3331581
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[5]
2019 | Published | Journal Article | IST-REx-ID: 6936 | OA
Ovaskainen O, Rybicki J, Abrego N. What can observational data reveal about metacommunity processes? Ecography. 2019;42(11):1877-1886. doi:10.1111/ecog.04444
[Published Version] View | Files available | DOI | WoS
 
[4]
2019 | Published | Journal Article | IST-REx-ID: 6972 | OA
Lenzen C, Rybicki J. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 2019;66(5). doi:10.1145/3339471
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2018 | Published | Journal Article | IST-REx-ID: 43 | OA
Rybicki J, Kisdi E, Anttila J. Model of bacterial toxin-dependent pathogenesis explains infective dose. PNAS. 2018;115(42):10690-10695. doi:10.1073/pnas.1721061115
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2018 | Published | Journal Article | IST-REx-ID: 76 | OA
Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Published | Conference Paper | IST-REx-ID: 6932
Brandt S, Hirvonen J, Korhonen JH, et al. LCL problems on grids. In: ACM Press; 2017:101-110. doi:10.1145/3087801.3087833
View | DOI
 
Marked Publication(s)

Search

Filter Publications

  • 19 OA Fulltext(s)

Display / Sort

Export / Embed