-
Fully Adaptive Self-Stabilizing Transformer for LCL Problems
The first generic self-stabilizing transformer for local problems in a c...
05/20/2021 ∙ by Shimon Bitton, et al. ∙
0
∙
share
read it
-
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...
02/25/2021 ∙ by Yuval Emek, et al. ∙
0
∙
share
read it
-
Online Paging with a Vanishing Regret
This paper considers a variant of the online paging problem, where the o...
11/18/2020 ∙ by Yuval Emek, et al. ∙
1
∙
share
read it
-
Communication Efficient Self-Stabilizing Leader Election (Full Version)
This paper presents a randomized self-stabilizing algorithm that elects ...
08/10/2020 ∙ by Xavier Défago, et al. ∙
0
∙
share
read it
-
Twenty-Two New Approximate Proof Labeling Schemes (Full Version)
Introduced by Korman, Kutten, and Peleg (Distributed Computing 2005), a ...
07/28/2020 ∙ by Yuval Emek, et al. ∙
0
∙
share
read it
-
Exploitation of Multiple Replenishing Resources with Uncertainty
We consider an optimization problem in which a (single) bat aims to expl...
07/19/2020 ∙ by Amos Korman, et al. ∙
0
∙
share
read it
-
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes
In this paper, a rather general online problem called dynamic resource a...
05/04/2020 ∙ by Yuval Emek, et al. ∙
0
∙
share
read it
-
No-Regret Stateful Posted Pricing
In this paper, a rather general online problem called dynamic resource a...
05/04/2020 ∙ by Yuval Emek, et al. ∙
0
∙
share
read it
-
Low Diameter Graph Decompositions by Approximate Distance Computation
In many models for large-scale computation, decomposition of the problem...
09/19/2019 ∙ by Ruben Becker, et al. ∙
0
∙
share
read it
-
Message Reduction in the Local Model is a Free Lunch
A new spanner construction algorithm is presented, working under the LOC...
09/18/2019 ∙ by Shimon Bitton, et al. ∙
0
∙
share
read it
-
Bayesian Generalized Network Design
We study network coordination problems, as captured by the setting of ge...
06/30/2019 ∙ by Yuval Emek, et al. ∙
0
∙
share
read it
-
Deterministic Leader Election in Programmable Matter
Addressing a fundamental problem in programmable matter, we present the ...
05/02/2019 ∙ by Yuval Emek, et al. ∙
0
∙
share
read it
-
Maximizing Communication Throughput in Tree Networks
A widely studied problem in communication networks is that of finding th...
04/23/2019 ∙ by Yuval Emek, et al. ∙
0
∙
share
read it
-
Hierarchical b-Matching
A matching of a graph is a subset of edges no two of which share a commo...
04/23/2019 ∙ by Yuval Emek, et al. ∙
0
∙
share
read it
-
Selecting a Leader in a Network of Finite State Machines
This paper studies a variant of the leader election problem under the st...
05/15/2018 ∙ by Yehuda Afek, et al. ∙
0
∙
share
read it
-
Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency
In a generalized network design (GND) problem, a set of resources are as...
03/14/2018 ∙ by Yuval Emek, et al. ∙
0
∙
share
read it
