This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. We propose a simple local algorithm that is closely related...
An edge dominating set of a graph G = (V, E) is a subset M ⊆ E of edges such that each edge in E \M is incident to at least one edge in M. In this paper, we consider the paramete...