The following pages link to Joel Rybicki (Q896022):
Displaying 27 items.
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Deterministic local algorithms, unique identifiers, and fractional graph colouring (Q896700) (← links)
- Efficient counting with optimal resilience (Q1664123) (← links)
- Local mending (Q2097329) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Towards optimal synchronous counting (Q2796281) (← links)
- Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring (Q2913210) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
- A Local 2-Approximation Algorithm for the Vertex Cover Problem (Q3646226) (← links)
- (Q3811866) (← links)
- Does Preprocessing Help under Congestion? (Q5145217) (← links)
- Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus (Q5215461) (← links)
- Efficient Counting with Optimal Resilience (Q5359491) (← links)
- A lower bound for the distributed Lovász local lemma (Q5361853) (← links)
- LCL Problems on Grids (Q5368949) (← links)
- Near-optimal self-stabilising counting and firing squads (Q5918195) (← links)
- Wait-free approximate agreement on graphs (Q5918635) (← links)
- Near-optimal self-stabilising counting and firing squads (Q5919570) (← links)
- Wait-free approximate agreement on graphs (Q5925616) (← links)
- Brief Announcement: Fast Graphical Population Protocols (Q6083418) (← links)
- Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model (Q6083443) (← links)
- (Q6128573) (← links)
- Self-stabilising Byzantine clock synchronisation is almost as easy as consensus (Q6487505) (← links)
- Byzantine approximate agreement on graphs (Q6487546) (← links)
- Brief announcement: Efficient load-balancing through distributed token dropping (Q6535039) (← links)
- Sinkless orientation made simple (Q6539123) (← links)
