Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller

First Page		Document Content
Date: 2014-09-26 08:28:47 Spanning tree Fault-tolerant computer systems Analysis of algorithms Self-stabilization Minimum spanning tree Algorithm Time complexity Bellman–Ford algorithm Distributed computing Theoretical computer science Computational complexity theory Mathematics		Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller Add to Reading List Source URL: dcg.ethz.ch Download Document from Source Website File Size: 238,83 KB Share Document on Facebook

	Local Algorithms: Self-Stabilization on Speed Christoph Lenzen1 , Jukka Suomela2 , and Roger Wattenhofer1 1 Computer Engineering and Networks Laboratory TIK DocID: 1rvI6 - View Document
	Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip DocID: 1rn5A - View Document
	Exercise 9: It’s Christmas time! Task 1: Self-stabilization survey a) Check out the algorithms from the lecture and the exercises. Make a table, marking each1 of them as one of the following: (i) trivially self-stabili DocID: 1pfAr - View Document
	An Application of Specification-based Design of Self-Stabilization to Tracking in Wireless Sensor Networks Murat Demirbas1 and Anish Arora2 1 DocID: 1lZaU - View Document
	Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs Riko Jacob1 , Stephan Ritscher2 , Christian Scheideler3 , Stefan Schmid4 1 DocID: 1kaQ5 - View Document