Outputs (43)

Dispersion of Mobile Robots (2022)
Other

Stability Analysis of a Quantum Network with Max-Weight Scheduling (2021)
Other

Proximity Based Load Balancing Policies on Graphs: A Simulation Study (2020)
Other

Composition Games for Distributed Systems: the EU Grant games (2011)
Other

Intelligent Cyber-Physical Systems for Autonomous Transportation (2022)
Book

Software Defined Internet of Everything (2022)
Book

Internet of Energy for Smart Cities: Machine Learning Models and Techniques (2021)
Book

Optimal (degree+1)-Coloring in Congested Clique (2023)
Presentation / Conference Contribution

We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node u of degree d(u) is assigned a palette of d(u) + 1 colors, and the goal is to find a proper coloring using these color palettes. The (degree+1)-list co... Read More about Optimal (degree+1)-Coloring in Congested Clique.

Distributed MIS in O(log log n) Awake Complexity (2023)
Presentation / Conference Contribution

Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in distributed graph algorithms. Even after four decades of intensive research, the best known (randomized) MIS algorithms have O(log n) round complexity on genera... Read More about Distributed MIS in O(log log n) Awake Complexity.

An Almost Singularly Optimal Asynchronous Distributed MST Algorithm (2022)
Presentation / Conference Contribution

Efficient Deterministic Leader Election for Programmable Matter (2021)
Presentation / Conference Contribution

Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization (2023)
Presentation / Conference Contribution

In the study of radio networks, the tasks of broadcasting (propagating a message throughout the network) and leader election (having the network agree on a node to designate ‘leader’) are two of the most fundamental global problems, and have a long h... Read More about Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization.

Live Exploration with Mobile Robots in a Dynamic Ring, Revisited (2020)
Presentation / Conference Contribution

Deterministic Dispersion of Mobile Robots in Dynamic Rings (2018)
Presentation / Conference Contribution

Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring (2023)
Presentation / Conference Contribution

The Lovász Local Lemma is a classic result in probability theory that is often used to prove the existence of combinatorial objects via the probabilistic method. In its simplest form, it states that if we have n ‘bad events’, each of which occurs wit... Read More about Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring.

Edge Computing Based Resource Supplementation for Software Defined Vehicular Networks (2022)
Presentation / Conference Contribution

Sorting and Hypergraph Orientation under Uncertainty with Predictions (2023)
Presentation / Conference Contribution

Learning-augmented algorithms have been attracting increasing interest, but have only recently been considered in the setting of explorable uncertainty where precise values of uncertain input elements can be obtained by a query and the goal is to min... Read More about Sorting and Hypergraph Orientation under Uncertainty with Predictions.

Singularly Near Optimal Leader Election in Asynchronous Networks (2021)
Presentation / Conference Contribution

Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots (2020)
Presentation / Conference Contribution

Dispersion of Mobile Robots (2018)
Presentation / Conference Contribution