research
∙
07/02/2023
On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions
This paper studies the (discrete) chemical reaction network (CRN) comput...
share
research
∙
02/10/2023
Online Algorithms with Randomly Infused Advice
We introduce a novel method for the rigorous quantitative evaluation of ...
research
∙
10/13/2022
Beeping Shortest Paths via Hypergraph Bipartite Decomposition
Constructing a shortest path between two network nodes is a fundamental ...
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
∙
08/18/2022
Locally Restricted Proof Labeling Schemes (Full Version)
Introduced by Korman, Kutten, and Peleg (PODC 2005), a proof labeling sc...
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
∙
02/25/2021
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks
Introduced by Emek and Wattenhofer (PODC 2013), the stone age (SA) model...
research
∙
11/18/2020
Online Paging with a Vanishing Regret
This paper considers a variant of the online paging problem, where the o...
research
∙
08/10/2020
Communication Efficient Self-Stabilizing Leader Election (Full Version)
This paper presents a randomized self-stabilizing algorithm that elects ...
research
∙
07/28/2020
Twenty-Two New Approximate Proof Labeling Schemes (Full Version)
Introduced by Korman, Kutten, and Peleg (Distributed Computing 2005), a ...
research
∙
07/19/2020
Exploitation of Multiple Replenishing Resources with Uncertainty
We consider an optimization problem in which a (single) bat aims to expl...
research
∙
05/04/2020
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes
In this paper, a rather general online problem called dynamic resource a...
research
∙
05/04/2020
No-Regret Stateful Posted Pricing
In this paper, a rather general online problem called dynamic resource a...
research
∙
09/19/2019
Low Diameter Graph Decompositions by Approximate Distance Computation
In many models for large-scale computation, decomposition of the problem...
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
∙
06/30/2019
Bayesian Generalized Network Design
We study network coordination problems, as captured by the setting of ge...
research
∙
05/02/2019
Deterministic Leader Election in Programmable Matter
Addressing a fundamental problem in programmable matter, we present the ...
research
∙
04/23/2019
Maximizing Communication Throughput in Tree Networks
A widely studied problem in communication networks is that of finding th...
research
∙
04/23/2019
Hierarchical b-Matching
A matching of a graph is a subset of edges no two of which share a commo...
research
∙
05/15/2018
Selecting a Leader in a Network of Finite State Machines
This paper studies a variant of the leader election problem under the st...
research
∙
03/14/2018