Joel Rybicki

According to our database, Joel Rybicki authored at least 36 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Space-efficient population protocols for exact majority in general graphs.

Joel Rybicki, Jakob Solnerzik, Olivier Stietel, Robin Vacus

CoRR, August, 2025

2024

Majority Consensus Thresholds in Competitive Lotka-Volterra Populations.

Matthias Függer, Thomas Nowak, Joel Rybicki

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

Sinkless Orientation Made Simple.

Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

Brief Announcement: Temporal Locality in Online Algorithms.

Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Local Mending.

Alkida Balliu, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, Jukka Suomela

Proceedings of the Structural Information and Communication Complexity, 2022

Near-Optimal Leader Election in Population Protocols on Graphs.

Dan Alistarh, Joel Rybicki, Sasha Voitovych

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Sinkless orientation is hard also in the supported LOCAL model.

Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela

CoRR, 2021

Reaching Agreement in Competitive Microbial Systems.

Victoria Andaur, Janna Burman, Matthias Függer, Manish Kushwaha, Bilal Manssouri, Thomas Nowak, Joel Rybicki

CoRR, 2021

Locality in Online Algorithms.

Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko

CoRR, 2021

Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.

Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Brief Announcement: Fast Graphical Population Protocols.

Dan Alistarh, Rati Gelashvili, Joel Rybicki

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Efficient Load-Balancing through Distributed Token Dropping.

Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Wait-Free Approximate Agreement on Graphs.

Dan Alistarh, Faith Ellen, Joel Rybicki

Proceedings of the Structural Information and Communication Complexity, 2021

Input-Dynamic Distributed Algorithms for Communication Networks.

Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid

Proceedings of the SIGMETRICS '21: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2021

Fast Graphical Population Protocols.

Dan Alistarh, Rati Gelashvili, Joel Rybicki

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020

Input-dynamic distributed graph algorithms for congested networks.

Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid

CoRR, 2020

Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping.

Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto

Proceedings of the 34th International Symposium on Distributed Computing, 2020

2019

Brief Announcement: Does Preprocessing Help under Congestion?

Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid

CoRR, 2019

Byzantine Approximate Agreement on Graphs.

Thomas Nowak, Joel Rybicki

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Does Preprocessing Help under Congestion?

Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2017

Efficient Counting with Optimal Resilience.

Christoph Lenzen, Joel Rybicki, Jukka Suomela

SIAM J. Comput., 2017

Large Cuts with Local Algorithms on Triangle-Free Graphs.

Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela

Electron. J. Comb., 2017

Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus.

Christoph Lenzen, Joel Rybicki

Proceedings of the 31st International Symposium on Distributed Computing, 2017

LCL Problems on Grids.

Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Deterministic Subgraph Detection in Broadcast CONGEST.

Janne H. Korhonen, Joel Rybicki

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016

Counting, clocking, and colouring - Fault-tolerant distributed coordination ; Laskureita, kellotusta ja väritystä: Vikasietoinen hajautettu koordinointi.

Joel Rybicki

PhD thesis, 2016

Synchronous counting and computational algorithm design.

Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, Siert Wieringa

J. Comput. Syst. Sci., 2016

A lower bound for the distributed Lovász local lemma.

Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Near-Optimal Self-stabilising Counting and Firing Squads.

Christoph Lenzen, Joel Rybicki

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

2015

Efficient Counting with Optimal Resilience.

Christoph Lenzen, Joel Rybicki

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Exact Bounds for Distributed Graph Colouring.

Joel Rybicki, Jukka Suomela

Proceedings of the Structural Information and Communication Complexity, 2015

Towards Optimal Synchronous Counting.

Christoph Lenzen, Joel Rybicki, Jukka Suomela

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2013

Synchronous Counting and Computational Algorithm Design.

Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

2012

Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring.

Henning Hasemann, Juho Hirvonen, Joel Rybicki, Jukka Suomela

Proceedings of the Structural Information and Communication Complexity, 2012

2010

Local algorithms in (weakly) coloured graphs

Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto

CoRR, 2010

2009

A Local 2-Approximation Algorithm for the Vertex Cover Problem.

Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto

Proceedings of the Distributed Computing, 23rd International Symposium, 2009