
Online Paging with a Vanishing Regret
This paper considers a variant of the online paging problem, where the o...
read it

Communication Efficient SelfStabilizing Leader Election (Full Version)
This paper presents a randomized selfstabilizing algorithm that elects ...
read it

TwentyTwo New Approximate Proof Labeling Schemes (Full Version)
Introduced by Korman, Kutten, and Peleg (Distributed Computing 2005), a ...
read it

Exploitation of Multiple Replenishing Resources with Uncertainty
We consider an optimization problem in which a (single) bat aims to expl...
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...
read it

NoRegret Stateful Posted Pricing
In this paper, a rather general online problem called dynamic resource a...
read it

Low Diameter Graph Decompositions by Approximate Distance Computation
In many models for largescale computation, decomposition of the problem...
read it

Message Reduction in the Local Model is a Free Lunch
A new spanner construction algorithm is presented, working under the LOC...
read it

Bayesian Generalized Network Design
We study network coordination problems, as captured by the setting of ge...
read it

Deterministic Leader Election in Programmable Matter
Addressing a fundamental problem in programmable matter, we present the ...
read it

Maximizing Communication Throughput in Tree Networks
A widely studied problem in communication networks is that of finding th...
read it

Hierarchical bMatching
A matching of a graph is a subset of edges no two of which share a commo...
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...
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...
read it
Yuval Emek
is this you? claim profile