Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...