Joel Rybicki

Alistarh Group

20 Publications

Mark all

[20]
2023 | Journal Article | IST-REx-ID: 12566 | OA
D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” Theoretical Computer Science, vol. 948, no. 2. Elsevier, 2023.
[Published Version] View | Files available | DOI | WoS
 
[19]
2022 | Conference Paper | IST-REx-ID: 11184 | OA
D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Fast graphical population protocols,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217.
[Published Version] View | Files available | DOI | arXiv
 
[18]
2022 | Conference Paper | IST-REx-ID: 12182 | OA
M. Pacut, M. Parham, J. Rybicki, S. Schmid, J. Suomela, and A. Tereshchenko, “Brief announcement: Temporal locality in online algorithms,” in 36th International Symposium on Distributed Computing, Augusta, GA, United States, 2022, vol. 246.
[Published Version] View | Files available | DOI
 
[17]
2022 | Conference Paper | IST-REx-ID: 11844 | OA
D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2022, pp. 246–256.
[Published Version] View | Files available | DOI | arXiv
 
[16]
2022 | Conference Paper | IST-REx-ID: 11707 | OA
A. Balliu, J. Hirvonen, D. Melnyk, D. Olivetti, J. Rybicki, and J. Suomela, “Local mending,” in International Colloquium on Structural Information and Communication Complexity, Paderborn, Germany, 2022, vol. 13298, pp. 1–20.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[15]
2021 | Conference Paper | IST-REx-ID: 10218 | OA
D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Brief announcement: Fast graphical population protocols,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI | arXiv
 
[14]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI | arXiv
 
[13]
2021 | Conference Paper | IST-REx-ID: 9823 | OA
D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 87–105.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2021 | Conference Paper | IST-REx-ID: 10854 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual, Online, 2021, pp. 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2021 | Journal Article | IST-REx-ID: 10855 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2021 | Conference Paper | IST-REx-ID: 9678 | OA
S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2021, pp. 129–139.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[9]
2020 | Journal Article | IST-REx-ID: 7224 | OA
J. Rybicki, N. Abrego, and O. Ovaskainen, “Habitat fragmentation and species diversity in competitive communities,” Ecology Letters, vol. 23, no. 3. Wiley, pp. 506–517, 2020.
[Published Version] View | Files available | DOI | WoS
 
[8]
2020 | Conference Paper | IST-REx-ID: 15074 | OA
S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in 34th International Symposium on Distributed Computing, Virtual, 2020, vol. 179.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2019 | Conference Paper | IST-REx-ID: 6931 | OA
T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2019 | Journal Article | IST-REx-ID: 6936 | OA
O. Ovaskainen, J. Rybicki, and N. Abrego, “What can observational data reveal about metacommunity processes?,” Ecography, vol. 42, no. 11. Wiley, pp. 1877–1886, 2019.
[Published Version] View | Files available | DOI | WoS
 
[5]
2019 | Journal Article | IST-REx-ID: 6972 | OA
C. Lenzen and J. Rybicki, “Self-stabilising Byzantine clock synchronisation is almost as easy as consensus,” Journal of the ACM, vol. 66, no. 5. ACM, 2019.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing help under congestion?,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 2019, pp. 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2018 | Journal Article | IST-REx-ID: 43 | OA
J. Rybicki, E. Kisdi, and J. Anttila, “Model of bacterial toxin-dependent pathogenesis explains infective dose,” PNAS, vol. 115, no. 42. National Academy of Sciences, pp. 10690–10695, 2018.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2018 | Journal Article | IST-REx-ID: 76 | OA
C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018.
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 6932
S. Brandt et al., “LCL problems on grids,” presented at the PODC: Principles of Distributed Computing, Washington, DC, United States, 2017, pp. 101–110.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed

20 Publications

Mark all

[20]
2023 | Journal Article | IST-REx-ID: 12566 | OA
D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” Theoretical Computer Science, vol. 948, no. 2. Elsevier, 2023.
[Published Version] View | Files available | DOI | WoS
 
[19]
2022 | Conference Paper | IST-REx-ID: 11184 | OA
D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Fast graphical population protocols,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217.
[Published Version] View | Files available | DOI | arXiv
 
[18]
2022 | Conference Paper | IST-REx-ID: 12182 | OA
M. Pacut, M. Parham, J. Rybicki, S. Schmid, J. Suomela, and A. Tereshchenko, “Brief announcement: Temporal locality in online algorithms,” in 36th International Symposium on Distributed Computing, Augusta, GA, United States, 2022, vol. 246.
[Published Version] View | Files available | DOI
 
[17]
2022 | Conference Paper | IST-REx-ID: 11844 | OA
D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2022, pp. 246–256.
[Published Version] View | Files available | DOI | arXiv
 
[16]
2022 | Conference Paper | IST-REx-ID: 11707 | OA
A. Balliu, J. Hirvonen, D. Melnyk, D. Olivetti, J. Rybicki, and J. Suomela, “Local mending,” in International Colloquium on Structural Information and Communication Complexity, Paderborn, Germany, 2022, vol. 13298, pp. 1–20.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[15]
2021 | Conference Paper | IST-REx-ID: 10218 | OA
D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Brief announcement: Fast graphical population protocols,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI | arXiv
 
[14]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI | arXiv
 
[13]
2021 | Conference Paper | IST-REx-ID: 9823 | OA
D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 87–105.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2021 | Conference Paper | IST-REx-ID: 10854 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual, Online, 2021, pp. 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2021 | Journal Article | IST-REx-ID: 10855 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2021 | Conference Paper | IST-REx-ID: 9678 | OA
S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2021, pp. 129–139.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[9]
2020 | Journal Article | IST-REx-ID: 7224 | OA
J. Rybicki, N. Abrego, and O. Ovaskainen, “Habitat fragmentation and species diversity in competitive communities,” Ecology Letters, vol. 23, no. 3. Wiley, pp. 506–517, 2020.
[Published Version] View | Files available | DOI | WoS
 
[8]
2020 | Conference Paper | IST-REx-ID: 15074 | OA
S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in 34th International Symposium on Distributed Computing, Virtual, 2020, vol. 179.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2019 | Conference Paper | IST-REx-ID: 6931 | OA
T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2019 | Journal Article | IST-REx-ID: 6936 | OA
O. Ovaskainen, J. Rybicki, and N. Abrego, “What can observational data reveal about metacommunity processes?,” Ecography, vol. 42, no. 11. Wiley, pp. 1877–1886, 2019.
[Published Version] View | Files available | DOI | WoS
 
[5]
2019 | Journal Article | IST-REx-ID: 6972 | OA
C. Lenzen and J. Rybicki, “Self-stabilising Byzantine clock synchronisation is almost as easy as consensus,” Journal of the ACM, vol. 66, no. 5. ACM, 2019.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing help under congestion?,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 2019, pp. 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2018 | Journal Article | IST-REx-ID: 43 | OA
J. Rybicki, E. Kisdi, and J. Anttila, “Model of bacterial toxin-dependent pathogenesis explains infective dose,” PNAS, vol. 115, no. 42. National Academy of Sciences, pp. 10690–10695, 2018.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2018 | Journal Article | IST-REx-ID: 76 | OA
C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018.
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 6932
S. Brandt et al., “LCL problems on grids,” presented at the PODC: Principles of Distributed Computing, Washington, DC, United States, 2017, pp. 101–110.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed