Joel Rybicki - Citegraph

Author Info

Name	Affiliation	Papers
JOEL RYBICKI	Helsinki Institute for Information Technology, University of Helsinki, Finland	23
Collaborators	Citations	PageRank
31	78	9.69
Referers	Referees	References
101	266	226

Search Limit

100266

Publications (23 rows)

Collaborators (31 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Efficient Load-Balancing through Distributed Token Dropping	0	0.34	2021
Input-Dynamic Distributed Algorithms for Communication Networks	0	0.34	2021
Brief Announcement - Fast Graphical Population Protocols.	0	0.34	2021
Input-Dynamic Distributed Algorithms for Communication Networks	1	0.35	2021
Brief Announcement - Sinkless Orientation Is Hard Also in the Supported LOCAL Model.	0	0.34	2021
Wait-free approximate agreement on graphs	0	0.34	2021
Brief Announcement - Efficient Load-Balancing Through Distributed Token Dropping.	0	0.34	2020
Byzantine Approximate Agreement on Graphs.	0	0.34	2019
Does Preprocessing Help under Congestion?	0	0.34	2019
Brief Announcement: Does Preprocessing Help under Congestion?	0	0.34	2019
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus	1	0.36	2019
LCL problems on grids.	4	0.41	2017
Deterministic subgraph detection in broadcast CONGEST.	3	0.38	2017
A Lower Bound for the Distributed Lovász Local Lemma.	22	0.78	2016
Near-Optimal Self-Stabilising Counting and Firing Squads.	1	0.36	2016
Towards Optimal Synchronous Counting.	4	0.41	2015
Exact bounds for distributed graph colouring.	3	0.41	2015
Efficient counting with optimal resilience	0	0.34	2015
Large Cuts with Local Algorithms on Triangle-Free Graphs.	6	0.45	2014
Synchronous Counting and Computational Algorithm Design	1	0.37	2013
Deterministic local algorithms, unique identifiers, and fractional graph colouring	6	0.60	2012
Local algorithms in (weakly) coloured graphs	6	0.69	2010
A local 2-approximation algorithm for the vertex cover problem	20	0.75	2009