default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoel Rybicki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Matthias Függer
, Thomas Nowak, Joel Rybicki:
Majority Consensus Thresholds in Competitive Lotka-Volterra Populations. PODC 2024: 76-86- [i23]Matthias Függer, Thomas Nowak, Joel Rybicki:
Majority consensus thresholds in competitive Lotka-Volterra populations. CoRR abs/2405.03568 (2024) - 2023
- [j8]Dan Alistarh, Faith Ellen, Joel Rybicki:
Wait-free approximate agreement on graphs. Theor. Comput. Sci. 948: 113733 (2023) - [c24]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: 175-191 - 2022
- [c23]Dan Alistarh, Joel Rybicki, Sasha Voitovych:
Near-Optimal Leader Election in Population Protocols on Graphs. PODC 2022: 246-256 - [c22]Alkida Balliu, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, Jukka Suomela:
Local Mending. SIROCCO 2022: 1-20 - [c21]Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko:
Brief Announcement: Temporal Locality in Online Algorithms. DISC 2022: 52:1-52:3 - [i22]Dan Alistarh, Joel Rybicki, Sasha Voitovych:
Near-Optimal Leader Election in Population Protocols on Graphs. CoRR abs/2205.12597 (2022) - 2021
- [j7]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): 06:1-06:33 (2021) - [c20]Dan Alistarh, Rati Gelashvili, Joel Rybicki:
Fast Graphical Population Protocols. OPODIS 2021: 14:1-14:18 - [c19]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid:
Input-Dynamic Distributed Algorithms for Communication Networks. SIGMETRICS (Abstracts) 2021: 71-72 - [c18]Dan Alistarh, Faith Ellen, Joel Rybicki:
Wait-Free Approximate Agreement on Graphs. SIROCCO 2021: 87-105 - [c17]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Efficient Load-Balancing through Distributed Token Dropping. SPAA 2021: 129-139 - [c16]Dan Alistarh, Rati Gelashvili, Joel Rybicki:
Brief Announcement: Fast Graphical Population Protocols. DISC 2021: 43:1-43:4 - [c15]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: 58:1-58:4 - [i21]Alkida Balliu, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, Jukka Suomela:
Local Mending. CoRR abs/2102.08703 (2021) - [i20]Dan Alistarh, Rati Gelashvili, Joel Rybicki:
Fast Graphical Population Protocols. CoRR abs/2102.08808 (2021) - [i19]Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko:
Locality in Online Algorithms. CoRR abs/2102.09413 (2021) - [i18]Victoria Andaur, Janna Burman, Matthias Függer, Manish Kushwaha, Bilal Manssouri, Thomas Nowak, Joel Rybicki:
Reaching Agreement in Competitive Microbial Systems. CoRR abs/2103.07450 (2021) - [i17]Dan Alistarh, Faith Ellen, Joel Rybicki:
Wait-free approximate agreement on graphs. CoRR abs/2103.08949 (2021) - [i16]Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Sinkless orientation is hard also in the supported LOCAL model. CoRR abs/2108.02655 (2021) - 2020
- [c14]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. DISC 2020: 40:1-40:3 - [i15]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid:
Input-dynamic distributed graph algorithms for congested networks. CoRR abs/2005.07637 (2020) - [i14]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Efficient Load-Balancing through Distributed Token Dropping. CoRR abs/2005.07761 (2020)
2010 – 2019
- 2019
- [j6]Christoph Lenzen, Joel Rybicki:
Near-optimal self-stabilising counting and firing squads. Distributed Comput. 32(4): 339-360 (2019) - [j5]Christoph Lenzen, Joel Rybicki:
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus. J. ACM 66(5): 32:1-32:56 (2019) - [c13]Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid:
Does Preprocessing Help under Congestion? PODC 2019: 259-261 - [c12]Thomas Nowak, Joel Rybicki:
Byzantine Approximate Agreement on Graphs. DISC 2019: 29:1-29:17 - [i13]Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid:
Brief Announcement: Does Preprocessing Help under Congestion? CoRR abs/1905.03012 (2019) - [i12]Thomas Nowak, Joel Rybicki:
Byzantine Approximate Agreement on Graphs. CoRR abs/1908.02743 (2019) - 2017
- [j4]Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Large Cuts with Local Algorithms on Triangle-Free Graphs. Electron. J. Comb. 24(4): 4 (2017) - [j3]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Efficient Counting with Optimal Resilience. SIAM J. Comput. 46(4): 1473-1500 (2017) - [c11]Janne H. Korhonen, Joel Rybicki:
Deterministic Subgraph Detection in Broadcast CONGEST. OPODIS 2017: 4:1-4:16 - [c10]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: 101-110 - [c9]Christoph Lenzen, Joel Rybicki:
Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. DISC 2017: 32:1-32:15 - [i11]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 abs/1702.05456 (2017) - [i10]Christoph Lenzen, Joel Rybicki:
Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. CoRR abs/1705.06173 (2017) - [i9]Janne H. Korhonen, Joel Rybicki:
Deterministic subgraph detection in broadcast CONGEST. CoRR abs/1705.10195 (2017) - 2016
- [b1]Joel Rybicki:
Counting, clocking, and colouring - Fault-tolerant distributed coordination ; Laskureita, kellotusta ja väritystä: Vikasietoinen hajautettu koordinointi. Aalto University, Helsinki, Finland, 2016 - [j2]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): 310-332 (2016) - [j1]Henning Hasemann, Juho Hirvonen, Joel Rybicki, Jukka Suomela:
Deterministic local algorithms, unique identifiers, and fractional graph colouring. Theor. Comput. Sci. 610: 204-217 (2016) - [c8]Christoph Lenzen, Joel Rybicki:
Near-Optimal Self-stabilising Counting and Firing Squads. SSS 2016: 263-280 - [c7]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: 479-488 - [i8]Christoph Lenzen, Joel Rybicki:
Near-Optimal Self-Stabilising Counting and Firing Squads. CoRR abs/1608.00214 (2016) - 2015
- [c6]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Towards Optimal Synchronous Counting. PODC 2015: 441-450 - [c5]Joel Rybicki, Jukka Suomela:
Exact Bounds for Distributed Graph Colouring. SIROCCO 2015: 46-60 - [c4]Christoph Lenzen, Joel Rybicki:
Efficient Counting with Optimal Resilience. DISC 2015: 16-30 - [i7]Joel Rybicki, Jukka Suomela:
Exact bounds for distributed graph colouring. CoRR abs/1502.04963 (2015) - [i6]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Towards Optimal Synchronous Counting. CoRR abs/1503.06702 (2015) - [i5]Christoph Lenzen, Joel Rybicki:
Efficient counting with optimal resilience. CoRR abs/1508.02535 (2015) - [i4]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 abs/1511.00900 (2015) - 2014
- [i3]Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Large Cuts with Local Algorithms on Triangle-Free Graphs. CoRR abs/1402.2543 (2014) - 2013
- [c3]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Synchronous Counting and Computational Algorithm Design. SSS 2013: 237-250 - [i2]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Synchronous Counting and Computational Algorithm Design. CoRR abs/1304.5719 (2013) - 2012
- [c2]Henning Hasemann, Juho Hirvonen, Joel Rybicki, Jukka Suomela:
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring. SIROCCO 2012: 48-60 - 2010
- [i1]Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto:
Local algorithms in (weakly) coloured graphs. CoRR abs/1002.0125 (2010)
2000 – 2009
- 2009
- [c1]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: 191-205
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
