Joel Rybicki

Follow

Generating author description...

All published works
Action Title Year Authors
+ Majority Consensus Thresholds in Competitive Lotka-Volterra Populations 2024 Matthias Függer
Thomas Nowak
Joel Rybicki
+ PDF Chat Majority consensus thresholds in competitive Lotka--Volterra populations 2024 Matthias Függer
Thomas Nowak
Joel Rybicki
+ Wait-free approximate agreement on graphs 2023 Dan Alistarh
Faith Ellen
Joel Rybicki
+ PDF Chat Sinkless Orientation Made Simple 2023 Alkida Balliu
Janne H. Korhonen
Fabian Kühn
Henrik Lievonen
Dennis Olivetti
Shreyas Pai
Ami Paz
Joel Rybicki
Stefan Schmid
Jan Studený
+ Near-Optimal Leader Election in Population Protocols on Graphs 2022 Dan Alistarh
Joel Rybicki
Sasha Voitovych
+ Near-Optimal Leader Election in Population Protocols on Graphs 2022 Dan Alistarh
Joel Rybicki
Sasha Voitovych
+ Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model 2021 Janne F. J. Korhonen
Ami Paz
Joel Rybicki
Stefan Schmid
Jukka Suomela
+ Sinkless orientation is hard also in the supported LOCAL model. 2021 Janne H. Korhonen
Ami Paz
Joel Rybicki
Stefan Schmid
Jukka Suomela
+ PDF Chat Efficient Load-Balancing through Distributed Token Dropping 2021 Sebastian Brandt
Barbara Keller
Joel Rybicki
Jukka Suomela
Jara Uitto
+ PDF Chat Input-Dynamic Distributed Algorithms for Communication Networks 2021 Klaus-Tycho Foerster
Janne H. Korhonen
Ami Paz
Joel Rybicki
Stefan Schmid
+ PDF Chat Input-Dynamic Distributed Algorithms for Communication Networks 2021 Klaus-Tycho Foerster
Janne H. Korhonen
Ami Paz
Joel Rybicki
Stefan Schmid
+ PDF Chat Input-Dynamic Distributed Algorithms for Communication Networks 2021 Klaus-Tycho Foerster
Janne H. Korhonen
Ami Paz
Joel Rybicki
Stefan Schmid
+ Locality in Online Algorithms. 2021 Maciej Pacut
Mahmoud Parham
Joel Rybicki
Stefan Schmid
Jukka Suomela
Aleksandr Tereshchenko
+ Local Mending 2021 Alkida Balliu
Juho Hirvonen
Darya Melnyk
Dennis Olivetti
Joel Rybicki
Jukka Suomela
+ Fast Graphical Population Protocols 2021 Dan Alistarh
Rati Gelashvili
Joel Rybicki
+ Reaching Agreement in Competitive Microbial Systems 2021 Victoria Andaur
Janna Burman
Matthias Függer
Manish Kushwaha
Bilal Manssouri
Thomas Nowak
Joel Rybicki
+ Wait-free approximate agreement on graphs 2021 Dan Alistarh
Faith Ellen
Joel Rybicki
+ PDF Chat Wait-Free Approximate Agreement on Graphs 2021 Dan Alistarh
Faith Ellen
Joel Rybicki
+ Sinkless Orientation Made Simple 2021 Alkida Balliu
Janne H. Korhonen
Fabian Kühn
Henrik Lievonen
Dennis Olivetti
Shreyas Pai
Ami Paz
Joel Rybicki
Stefan Schmid
Jan Studený
+ Temporal Locality in Online Algorithms 2021 Maciej Pacut
Mahmoud Parham
Joel Rybicki
Stefan Schmid
Jukka Suomela
Aleksandr Tereshchenko
+ Local Mending 2021 Alkida Balliu
Juho Hirvonen
Darya Melnyk
Dennis Olivetti
Joel Rybicki
Jukka Suomela
+ Efficient Load-Balancing through Distributed Token Dropping 2020 Sebastian Brandt
Barbara Keller
Joel Rybicki
Jukka Suomela
Jara Uitto
+ PDF Chat Byzantine Approximate Agreement on Graphs 2019 Thomas Nowak
Joel Rybicki
+ PDF Chat Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus 2019 Christoph Lenzen
Joel Rybicki
+ Brief Announcement: Does Preprocessing Help under Congestion? 2019 Klaus-Tycho Foerster
Janne H. Korhonen
Joel Rybicki
Stefan Schmid
+ Byzantine Approximate Agreement on Graphs 2019 Thomas Nowak
Joel Rybicki
+ PDF Chat Model of bacterial toxin-dependent pathogenesis explains infective dose 2018 Joel Rybicki
Éva Kisdi
Jani Anttila
+ Large Cuts with Local Algorithms on Triangle-Free Graphs 2017 Juho Hirvonen
Joel Rybicki
Stefan Schmid
Jukka Suomela
+ Deterministic subgraph detection in broadcast CONGEST 2017 Janne H. Korhonen
Joel Rybicki
+ Deterministic Subgraph Detection in Broadcast CONGEST. 2017 Janne H. Korhonen
Joel Rybicki
+ PDF Chat Efficient Counting with Optimal Resilience 2017 Christoph Lenzen
Joel Rybicki
Jukka Suomela
+ Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus 2017 Christoph Lenzen
Joel Rybicki
+ LCL problems on grids 2017 Sebastian Brandt
Juho Hirvonen
Janne H. Korhonen
Tuomo Lempiäinen
Patric R. J. Östergård
Christopher Purcell
Joel Rybicki
Jukka Suomela
Przemysław Uznański
+ Near-Optimal Self-Stabilising Counting and Firing Squads 2016 Christoph Lenzen
Joel Rybicki
+ PDF Chat A lower bound for the distributed Lovász local lemma 2016 Sebastian Brandt
Orr Fischer
Juho Hirvonen
Barbara Keller
Tuomo Lempiäinen
Joel Rybicki
Jukka Suomela
Jara Uitto
+ PDF Chat Near-Optimal Self-stabilising Counting and Firing Squads 2016 Christoph Lenzen
Joel Rybicki
+ Near-Optimal Self-Stabilising Counting and Firing Squads 2016 Christoph Lenzen
Joel Rybicki
+ A Lower Bound for the Distributed Lov\'asz Local Lemma 2015 Sebastian Brandt
Orr Fischer
Juho Hirvonen
Barbara Keller
Tuomo Lempiäinen
Joel Rybicki
Jukka Suomela
Jara Uitto
+ Synchronous counting and computational algorithm design 2015 Danny Dolev
Keijo Heljanko
Matti J„ärvisalo
Janne H. Korhonen
Christoph Lenzen
Joel Rybicki
Jukka Suomela
Siert Wieringa
+ PDF Chat Towards Optimal Synchronous Counting 2015 Christoph Lenzen
Joel Rybicki
Jukka Suomela
+ Towards Optimal Synchronous Counting 2015 Christoph Lenzen
Joel Rybicki
Jukka Suomela
+ Exact bounds for distributed graph colouring 2015 Joel Rybicki
Jukka Suomela
+ PDF Chat Exact Bounds for Distributed Graph Colouring 2015 Joel Rybicki
Jukka Suomela
+ PDF Chat Efficient Counting with Optimal Resilience 2015 Christoph Lenzen
Joel Rybicki
+ Towards Optimal Synchronous Counting 2015 Christoph Lenzen
Joel Rybicki
Jukka Suomela
+ Exact bounds for distributed graph colouring 2015 Joel Rybicki
Jukka Suomela
+ A Lower Bound for the Distributed Lovász Local Lemma 2015 Sebastian Brandt
Orr Fischer
Juho Hirvonen
Barbara Keller
Tuomo Lempiäinen
Joel Rybicki
Jukka Suomela
Jara Uitto
+ Large Cuts with Local Algorithms on Triangle-Free Graphs 2014 Juho Hirvonen
Joel Rybicki
Stefan Schmid
Jukka Suomela
+ Large Cuts with Local Algorithms on Triangle-Free Graphs 2014 Juho Hirvonen
Joel Rybicki
Stefan Schmid
Jukka Suomela
+ PDF Chat Synchronous Counting and Computational Algorithm Design 2013 Danny Dolev
Janne H. Korhonen
Christoph Lenzen
Joel Rybicki
Jukka Suomela
+ Local algorithms in (weakly) coloured graphs 2010 Matti Åstrand
Valentin Polishchuk
Joel Rybicki
Jukka Suomela
Jara Uitto
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ What Can be Computed Locally? 1995 Moni Naor
Larry Stockmeyer
8
+ Synchronous counting and computational algorithm design 2015 Danny Dolev
Keijo Heljanko
Matti J„ärvisalo
Janne H. Korhonen
Christoph Lenzen
Joel Rybicki
Jukka Suomela
Siert Wieringa
7
+ PDF Chat On the Power of Preprocessing in Decentralized Network Optimization 2019 Klaus-Tycho Foerster
Juho Hirvonen
Stefan Schmid
Jukka Suomela
6
+ Asymptotically optimal algorithms for approximate agreement 1990 Alan Fekete
5
+ PDF Chat Synchronous Counting and Computational Algorithm Design 2013 Danny Dolev
Janne H. Korhonen
Christoph Lenzen
Joel Rybicki
Jukka Suomela
5
+ PDF Chat Towards Optimal Synchronous Counting 2015 Christoph Lenzen
Joel Rybicki
Jukka Suomela
5
+ On local convexity in graphs 1987 Martin Farber
Robert E. Jamison
4
+ PDF Chat An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model 2016 Yi‐Jun Chang
Tsvi Kopelowitz
Seth Pettie
4
+ PDF Chat A lower bound for the distributed Lovász local lemma 2016 Sebastian Brandt
Orr Fischer
Juho Hirvonen
Barbara Keller
Tuomo Lempiäinen
Joel Rybicki
Jukka Suomela
Jara Uitto
4
+ Exact bounds for distributed graph colouring 2015 Joel Rybicki
Jukka Suomela
4
+ PDF Chat Efficient Counting with Optimal Resilience 2017 Christoph Lenzen
Joel Rybicki
Jukka Suomela
4
+ PDF Chat Near-Optimal Self-stabilising Counting and Firing Squads 2016 Christoph Lenzen
Joel Rybicki
4
+ PDF Chat New classes of distributed time complexity 2018 Alkida Balliu
Juho Hirvonen
Janne H. Korhonen
Tuomo Lempiäinen
Dennis Olivetti
Jukka Suomela
3
+ PDF Chat Lower Bounds for Maximal Matchings and Maximal Independent Sets 2019 Alkida Balliu
Sebastian Brandt
Juho Hirvonen
Dennis Olivetti
Mikaël Rabie
Jukka Suomela
3
+ On diameters and radii of bridged graphs 1989 Martin Farber
3
+ Exact stochastic simulation of coupled chemical reactions 1977 Daniel T. Gillespie
3
+ A Polytopal Generalization of Sperner's Lemma 2002 Jesús A. De Loera
Elisha Peterson
Francis Edward Su
3
+ PDF Chat A Time Hierarchy Theorem for the LOCAL Model 2019 Yi‐Jun Chang
Seth Pettie
3
+ PDF Chat Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks 2016 Amir Abboud
Keren Censor-Hillel
Seri Khoury
3
+ PDF Chat An Automatic Speedup Theorem for Distributed Problems 2019 Sebastian Brandt
3
+ PDF Chat Time-Varying Graphs and Dynamic Networks 2011 Arnaud Casteigts
Paola Flocchini
Walter Quattrociocchi
Nicola Santoro
3
+ PDF Chat Convergence Speed of Binary Interval Consensus 2012 Moez Draief
Milan Vojnović
3
+ PDF Chat Efficient Counting with Optimal Resilience 2015 Christoph Lenzen
Joel Rybicki
2
+ Dynamic Algorithms for the Massively Parallel Computation Model 2019 Giuseppe F. Italiano
Silvio Lattanzi
Vahab Mirrokni
Nikos Parotsidis
2
+ PDF Chat Fast Approximate Shortest Paths in the Congested Clique 2019 Keren Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
2
+ Distributed Degree Splitting, Edge Coloring, and Orientations 2017 Mohsen Ghaffari
Hsin-Hao Su
2
+ Extremal Graph Theory 1978 Béla Bollobás
2
+ PDF Chat Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization 2016 Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
2
+ Time-Space Trade-offs in Population Protocols 2017 Dan Alistarh
James Aspnes
David Eisenstat
Rati Gelashvili
Ronald L. Rivest
2
+ Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks 2003 Ariel Daliot
Danny Dolev
H. Parnas
2
+ PDF Chat A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching 2019 Aaron Bernstein
Sebastian Forster
Monika Henzinger
2
+ PDF Chat Improved distributed steiner forest construction 2014 Christoph Lenzen
Boaz Patt-Shamir
2
+ Parallel Batch-Dynamic Graph Connectivity 2019 Umut A. Acar
Daniel Anderson
Guy E. Blelloch
Laxman Dhulipala
2
+ PDF Chat The Distributed Complexity of Locally Checkable Problems on Paths is Decidable 2019 Alkida Balliu
Sebastian Brandt
Yi‐Jun Chang
Dennis Olivetti
Mikaël Rabie
Jukka Suomela
2
+ PDF Chat Stable leader election in population protocols requires linear time 2016 David Doty
David Soloveichik
2
+ PDF Chat Determining majority in networks with local interactions and very small local memory 2016 George B. Mertzios
Sotiris Nikoletseas
Christoforos Raptopoulos
Paul G. Spirakis
2
+ Introduction to Algorithms 1991 V. J. Rayward‐Smith
Thomas H. Cormen
Charles E. Leiserson
Ronald L. Rivest
2
+ PDF Chat Optimal Dynamic Distributed MIS 2016 Keren Censor-Hillel
Elad Haramaty
Zohar Karnin
2
+ A note on bipartite subgraphs of triangle‐free graphs 1992 James B. Shearer
2
+ PDF Chat Exact Bounds for Distributed Graph Colouring 2015 Joel Rybicki
Jukka Suomela
2
+ PDF Chat Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture 2015 Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
Thatchaphol Saranurak
2
+ PDF Chat Simple Deterministic Algorithms for Fully Dynamic Maximal Matching 2015 Ofer Neiman
Shay Solomon
2
+ Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits 2017 Lucas Boczkowski
Amos Korman
Emanuele Natale
2
+ PDF Chat Time-varying graphs and dynamic networks 2012 Arnaud Casteigts
Paola Flocchini
Walter Quattrociocchi
Nicola Santoro
2
+ Deterministic subgraph detection in broadcast CONGEST 2017 Janne H. Korhonen
Joel Rybicki
2
+ PDF Chat Distributed computability in Byzantine asynchronous systems 2014 Hammurabi Mendes
Christine Tasson
Maurice Herlihy
2
+ On a Problem of Formal Logic 1930 Frank Plumpton Ramsey
2
+ PDF Chat The computational power of population protocols 2007 Dana Angluin
James Aspnes
David Eisenstat
Eric Ruppert
2
+ PDF Chat Lower bounds for local approximation 2013 Mika Göös
Juho Hirvonen
Jukka Suomela
2
+ Improved bounds and parallel algorithms for the Lovasz Local Lemma. 2015 Bernhard Haeupler
David G. Harris
2