Joel Rybicki

Orcid: 0000-0002-6432-6646

According to our database1, Joel Rybicki authored at least 35 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Majority Consensus Thresholds in Competitive Lotka-Volterra Populations.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023
Wait-free approximate agreement on graphs.
Theor. Comput. Sci., February, 2023

Sinkless Orientation Made Simple.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022
Brief Announcement: Temporal Locality in Online Algorithms.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Local Mending.
Proceedings of the Structural Information and Communication Complexity, 2022

Near-Optimal Leader Election in Population Protocols on Graphs.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Input-Dynamic Distributed Algorithms for Communication Networks.
Proc. ACM Meas. Anal. Comput. Syst., 2021

Sinkless orientation is hard also in the supported LOCAL model.
CoRR, 2021

Reaching Agreement in Competitive Microbial Systems.
CoRR, 2021

Locality in Online Algorithms.
CoRR, 2021

Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Brief Announcement: Fast Graphical Population Protocols.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Efficient Load-Balancing through Distributed Token Dropping.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Fast Graphical Population Protocols.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020
Input-dynamic distributed graph algorithms for congested networks.
CoRR, 2020

Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

2019
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.
J. ACM, 2019

Near-optimal self-stabilising counting and firing squads.
Distributed Comput., 2019

Brief Announcement: Does Preprocessing Help under Congestion?
CoRR, 2019

Byzantine Approximate Agreement on Graphs.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Does Preprocessing Help under Congestion?
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2017
Efficient Counting with Optimal Resilience.
SIAM J. Comput., 2017

Large Cuts with Local Algorithms on Triangle-Free Graphs.
Electron. J. Comb., 2017

LCL Problems on Grids.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Deterministic Subgraph Detection in Broadcast CONGEST.
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.
PhD thesis, 2016

Deterministic local algorithms, unique identifiers, and fractional graph colouring.
Theor. Comput. Sci., 2016

Synchronous counting and computational algorithm design.
J. Comput. Syst. Sci., 2016

A lower bound for the distributed Lovász local lemma.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015
Efficient Counting with Optimal Resilience.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Exact Bounds for Distributed Graph Colouring.
Proceedings of the Structural Information and Communication Complexity, 2015

Towards Optimal Synchronous Counting.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2013
Synchronous Counting and Computational Algorithm Design.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

2010
Local algorithms in (weakly) coloured graphs
CoRR, 2010

2009
A Local 2-Approximation Algorithm for the Vertex Cover Problem.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009


  Loading...