2010
DOI: 10.1007/978-3-642-11476-2_11 View full text |Buy / Rent full text
|
|

Abstract: Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at the assumptions they make on the underlying network. We investigate this question from the perspective of network dynamics. In particular, we ask how a given property on the evolution of the network can be rigorously proven as necessary or sufficient for a given algorithm. The main contribution of this paper is to propose the combination of two existing tools in this direction: local co… Show more

Help me understand this report

Search citation statements

Order By: Relevance
0
0
0
0
0
0
41
0
2

Publication Types

Select...

Relationship

0
0

Authors

Journals