Joel Rybicki

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 43

Top Venues

Aalto University, Helsinki, Finland (PHD)

Education History

Aalto University, Helsinki, Finland

PHD

Publications

Matthias Függer, Thomas Nowak, Joel Rybicki
Majority Consensus Thresholds in Competitive Lotka-Volterra Populations. PODC (2024)
Matthias Függer, Thomas Nowak, Joel Rybicki
Majority consensus thresholds in competitive Lotka-Volterra populations. CoRR (2024)
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
Sinkless Orientation Made Simple. SOSA (2023)
Dan Alistarh, Faith Ellen, Joel Rybicki
Wait-free approximate agreement on graphs. Theor. Comput. Sci. 948 (2023)
Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko
Brief Announcement: Temporal Locality in Online Algorithms. DISC (2022)
Dan Alistarh, Joel Rybicki, Sasha Voitovych
Near-Optimal Leader Election in Population Protocols on Graphs. CoRR (2022)
Alkida Balliu, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, Jukka Suomela
Local Mending. SIROCCO (2022)
Dan Alistarh, Joel Rybicki, Sasha Voitovych
Near-Optimal Leader Election in Population Protocols on Graphs. PODC (2022)
Dan Alistarh, Faith Ellen, Joel Rybicki
Wait-free approximate agreement on graphs. CoRR (2021)
Alkida Balliu, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, Jukka Suomela
Local Mending. CoRR (2021)
Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. DISC (2021)
Dan Alistarh, Rati Gelashvili, Joel Rybicki
Brief Announcement: Fast Graphical Population Protocols. DISC (2021)
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto
Efficient Load-Balancing through Distributed Token Dropping. SPAA (2021)
Dan Alistarh, Rati Gelashvili, Joel Rybicki
Fast Graphical Population Protocols. OPODIS (2021)
Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko
Locality in Online Algorithms. CoRR (2021)
Victoria Andaur, Janna Burman, Matthias Függer, Manish Kushwaha, Bilal Manssouri, Thomas Nowak, Joel Rybicki
Reaching Agreement in Competitive Microbial Systems. CoRR (2021)
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
Input-Dynamic Distributed Algorithms for Communication Networks. Proc. ACM Meas. Anal. Comput. Syst. 5 (1) (2021)
Dan Alistarh, Rati Gelashvili, Joel Rybicki
Fast Graphical Population Protocols. CoRR (2021)
Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela
Sinkless orientation is hard also in the supported LOCAL model. CoRR (2021)
Dan Alistarh, Faith Ellen, Joel Rybicki
Wait-Free Approximate Agreement on Graphs. SIROCCO (2021)
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
Input-Dynamic Distributed Algorithms for Communication Networks. SIGMETRICS (Abstracts) (2021)
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
Input-dynamic distributed graph algorithms for congested networks. CoRR (2020)
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto
Efficient Load-Balancing through Distributed Token Dropping. CoRR (2020)
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. DISC (2020)
Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid
Does Preprocessing Help under Congestion? PODC (2019)
Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid
Brief Announcement: Does Preprocessing Help under Congestion? CoRR (2019)
Thomas Nowak, Joel Rybicki
Byzantine Approximate Agreement on Graphs. DISC (2019)
Thomas Nowak, Joel Rybicki
Byzantine Approximate Agreement on Graphs. CoRR (2019)
Christoph Lenzen, Joel Rybicki
Near-optimal self-stabilising counting and firing squads. Distributed Comput. 32 (4) (2019)
Christoph Lenzen, Joel Rybicki
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus. J. ACM 66 (5) (2019)
Janne H. Korhonen, Joel Rybicki
Deterministic Subgraph Detection in Broadcast CONGEST. OPODIS (2017)
Janne H. Korhonen, Joel Rybicki
Deterministic subgraph detection in broadcast CONGEST. CoRR (2017)
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Efficient Counting with Optimal Resilience. SIAM J. Comput. 46 (4) (2017)
Christoph Lenzen, Joel Rybicki
Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. DISC (2017)
Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela
Large Cuts with Local Algorithms on Triangle-Free Graphs. Electron. J. Comb. 24 (4) (2017)
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
LCL Problems on Grids. PODC (2017)
Christoph Lenzen, Joel Rybicki
Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. CoRR (2017)
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
LCL problems on grids. CoRR (2017)
Christoph Lenzen, Joel Rybicki
Near-Optimal Self-Stabilising Counting and Firing Squads. CoRR (2016)
Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, Siert Wieringa
Synchronous counting and computational algorithm design. J. Comput. Syst. Sci. 82 (2) (2016)
Christoph Lenzen, Joel Rybicki
Near-Optimal Self-stabilising Counting and Firing Squads. SSS (2016)
Henning Hasemann, Juho Hirvonen, Joel Rybicki, Jukka Suomela
Deterministic local algorithms, unique identifiers, and fractional graph colouring. Theor. Comput. Sci. 610 (2016)
Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto
A lower bound for the distributed Lovász local lemma. STOC (2016)
Christoph Lenzen, Joel Rybicki
Efficient Counting with Optimal Resilience. DISC (2015)
Joel Rybicki, Jukka Suomela
Exact bounds for distributed graph colouring. CoRR (2015)
Joel Rybicki, Jukka Suomela
Exact Bounds for Distributed Graph Colouring. SIROCCO (2015)
Christoph Lenzen, Joel Rybicki
Efficient counting with optimal resilience. CoRR (2015)
Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto
A Lower Bound for the Distributed Lovász Local Lemma. CoRR (2015)
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Towards Optimal Synchronous Counting. PODC (2015)
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Towards Optimal Synchronous Counting. CoRR (2015)
Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela
Large Cuts with Local Algorithms on Triangle-Free Graphs. CoRR (2014)
Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela
Synchronous Counting and Computational Algorithm Design CoRR (2013)
Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela
Synchronous Counting and Computational Algorithm Design. SSS (2013)
Henning Hasemann, Juho Hirvonen, Joel Rybicki, Jukka Suomela
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring. SIROCCO (2012)
Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto
Local algorithms in (weakly) coloured graphs CoRR (2010)
Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto
A Local 2-Approximation Algorithm for the Vertex Cover Problem. DISC (2009)

Joel Rybicki.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joel Rybicki