In this work, our primary focus is to determine the intersections that exist between the family of QL-implications and the families of (S, N)- and R-implications. Toward this end,...
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...