research
∙
11/01/2022
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs
We investigated the computational power of a single mobile agent in an n...
share
research
∙
09/05/2022
Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices
We investigate the computational power of the deterministic single-agent...
research
∙
08/24/2022
Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time
The f-fault-toleratant connectivity labeling (f-FTC labeling) is a schem...
research
∙
05/30/2022
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
We consider global problems, i.e. problems that take at least diameter t...
research
∙
05/20/2021
Fully Adaptive Self-Stabilizing Transformer for LCL Problems
The first generic self-stabilizing transformer for local problems in a c...
research
∙
05/08/2021
Fast Neighborhood Rendezvous
In the rendezvous problem, two computing entities (called agents) locate...
research
∙
04/25/2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
For a graph G=(V,E), finding a set of disjoint edges that do not share a...
research
∙
05/20/2020
Time-optimal Loosely-stabilizing Leader Election in Population Protocols
We consider the leader election problem in population protocol models. I...
research
∙
09/18/2019
Message Reduction in the Local Model is a Free Lunch
A new spanner construction algorithm is presented, working under the LOC...
research
∙
08/30/2019
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model
This paper considers the triangle finding problem in the CONGEST model o...
research
∙
08/26/2019
Low-Congestion Shortcut and Graph Parameters
The concept of low-congestion shortcuts is initiated by Ghaffari and Hae...
research
∙
06/06/2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
The All-Pairs Shortest Path problem (APSP) is one of the most central pr...
research
∙
12/29/2018