Joel Rybicki

Alistarh Group

20 Publications

Mark all

[20]
2023 | Journal Article | IST-REx-ID: 12566 | OA
Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” Theoretical Computer Science, vol. 948, no. 2, 113733, Elsevier, 2023, doi:10.1016/j.tcs.2023.113733.
[Published Version] View | Files available | DOI | WoS
 
[19]
2022 | Conference Paper | IST-REx-ID: 11184 | OA
Alistarh, Dan-Adrian, et al. “Fast Graphical Population Protocols.” 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas et al., vol. 217, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.OPODIS.2021.14.
[Published Version] View | Files available | DOI | arXiv
 
[18]
2022 | Conference Paper | IST-REx-ID: 12182 | OA
Pacut, Maciej, et al. “Brief Announcement: Temporal Locality in Online Algorithms.” 36th International Symposium on Distributed Computing, vol. 246, 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.DISC.2022.52.
[Published Version] View | Files available | DOI
 
[17]
2022 | Conference Paper | IST-REx-ID: 11844 | OA
Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–56, doi:10.1145/3519270.3538435.
[Published Version] View | Files available | DOI | arXiv
 
[16]
2022 | Conference Paper | IST-REx-ID: 11707 | OA
Balliu, Alkida, et al. “Local Mending.” International Colloquium on Structural Information and Communication Complexity, edited by Merav Parter, vol. 13298, Springer Nature, 2022, pp. 1–20, doi: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, Dan-Adrian, et al. “Brief Announcement: Fast Graphical Population Protocols.” 35th International Symposium on Distributed Computing, vol. 209, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.43.
[Published Version] View | Files available | DOI | arXiv
 
[14]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen, Janne, et al. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” 35th International Symposium on Distributed Computing, vol. 209, 58, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.58.
[Published Version] View | Files available | DOI | arXiv
 
[13]
2021 | Conference Paper | IST-REx-ID: 9823 | OA
Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 87–105, doi: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, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72, doi:10.1145/3410220.3453923.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2021 | Journal Article | IST-REx-ID: 10855 | OA
Foerster, Klaus-Tycho, et al. “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, 2021, pp. 1–33, doi:10.1145/3447384.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2021 | Conference Paper | IST-REx-ID: 9678 | OA
Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–39, doi:10.1145/3409964.3461785.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[9]
2020 | Journal Article | IST-REx-ID: 7224 | OA
Rybicki, Joel, et al. “Habitat Fragmentation and Species Diversity in Competitive Communities.” Ecology Letters, vol. 23, no. 3, Wiley, 2020, pp. 506–17, doi:10.1111/ele.13450.
[Published Version] View | Files available | DOI | WoS
 
[8]
2020 | Conference Paper | IST-REx-ID: 15074 | OA
Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” 34th International Symposium on Distributed Computing, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.DISC.2020.40.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2019 | Conference Paper | IST-REx-ID: 6931 | OA
Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2019 | Journal Article | IST-REx-ID: 6936 | OA
Ovaskainen, Otso, et al. “What Can Observational Data Reveal about Metacommunity Processes?” Ecography, vol. 42, no. 11, Wiley, 2019, pp. 1877–86, doi:10.1111/ecog.04444.
[Published Version] View | Files available | DOI | WoS
 
[5]
2019 | Journal Article | IST-REx-ID: 6972 | OA
Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–61, doi:10.1145/3293611.3331581.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2018 | Journal Article | IST-REx-ID: 43 | OA
Rybicki, Joel, et al. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.” PNAS, vol. 115, no. 42, National Academy of Sciences, 2018, pp. 10690–95, doi:10.1073/pnas.1721061115.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2018 | Journal Article | IST-REx-ID: 76 | OA
Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6.
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 6932
Brandt, Sebastian, et al. LCL Problems on Grids. ACM Press, 2017, pp. 101–10, doi:10.1145/3087801.3087833.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: MLA

    Export / Embed

20 Publications

Mark all

[20]
2023 | Journal Article | IST-REx-ID: 12566 | OA
Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” Theoretical Computer Science, vol. 948, no. 2, 113733, Elsevier, 2023, doi:10.1016/j.tcs.2023.113733.
[Published Version] View | Files available | DOI | WoS
 
[19]
2022 | Conference Paper | IST-REx-ID: 11184 | OA
Alistarh, Dan-Adrian, et al. “Fast Graphical Population Protocols.” 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas et al., vol. 217, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.OPODIS.2021.14.
[Published Version] View | Files available | DOI | arXiv
 
[18]
2022 | Conference Paper | IST-REx-ID: 12182 | OA
Pacut, Maciej, et al. “Brief Announcement: Temporal Locality in Online Algorithms.” 36th International Symposium on Distributed Computing, vol. 246, 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.DISC.2022.52.
[Published Version] View | Files available | DOI
 
[17]
2022 | Conference Paper | IST-REx-ID: 11844 | OA
Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–56, doi:10.1145/3519270.3538435.
[Published Version] View | Files available | DOI | arXiv
 
[16]
2022 | Conference Paper | IST-REx-ID: 11707 | OA
Balliu, Alkida, et al. “Local Mending.” International Colloquium on Structural Information and Communication Complexity, edited by Merav Parter, vol. 13298, Springer Nature, 2022, pp. 1–20, doi: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, Dan-Adrian, et al. “Brief Announcement: Fast Graphical Population Protocols.” 35th International Symposium on Distributed Computing, vol. 209, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.43.
[Published Version] View | Files available | DOI | arXiv
 
[14]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen, Janne, et al. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” 35th International Symposium on Distributed Computing, vol. 209, 58, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.58.
[Published Version] View | Files available | DOI | arXiv
 
[13]
2021 | Conference Paper | IST-REx-ID: 9823 | OA
Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 87–105, doi: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, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72, doi:10.1145/3410220.3453923.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2021 | Journal Article | IST-REx-ID: 10855 | OA
Foerster, Klaus-Tycho, et al. “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, 2021, pp. 1–33, doi:10.1145/3447384.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2021 | Conference Paper | IST-REx-ID: 9678 | OA
Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–39, doi:10.1145/3409964.3461785.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[9]
2020 | Journal Article | IST-REx-ID: 7224 | OA
Rybicki, Joel, et al. “Habitat Fragmentation and Species Diversity in Competitive Communities.” Ecology Letters, vol. 23, no. 3, Wiley, 2020, pp. 506–17, doi:10.1111/ele.13450.
[Published Version] View | Files available | DOI | WoS
 
[8]
2020 | Conference Paper | IST-REx-ID: 15074 | OA
Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” 34th International Symposium on Distributed Computing, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.DISC.2020.40.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2019 | Conference Paper | IST-REx-ID: 6931 | OA
Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2019 | Journal Article | IST-REx-ID: 6936 | OA
Ovaskainen, Otso, et al. “What Can Observational Data Reveal about Metacommunity Processes?” Ecography, vol. 42, no. 11, Wiley, 2019, pp. 1877–86, doi:10.1111/ecog.04444.
[Published Version] View | Files available | DOI | WoS
 
[5]
2019 | Journal Article | IST-REx-ID: 6972 | OA
Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–61, doi:10.1145/3293611.3331581.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2018 | Journal Article | IST-REx-ID: 43 | OA
Rybicki, Joel, et al. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.” PNAS, vol. 115, no. 42, National Academy of Sciences, 2018, pp. 10690–95, doi:10.1073/pnas.1721061115.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2018 | Journal Article | IST-REx-ID: 76 | OA
Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6.
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 6932
Brandt, Sebastian, et al. LCL Problems on Grids. ACM Press, 2017, pp. 101–10, doi:10.1145/3087801.3087833.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: MLA

    Export / Embed