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

	Verification of Fault-Tolerant Protocols with Sally Bruno Dutertre, Dejan Jovanovi´c, and Jorge A. Navas Computer Science Laboratory, SRI International Abstract. Sally is a model checker for infinite-state systems that DocID: 1xVqL - View Document
	Verification of Fault-Tolerant Protocols with Sally Bruno Dutertre, Dejan Jovanovi´c, and Jorge A. Navas Computer Science Laboratory, SRI International Abstract. Sally is a model checker for infinite-state systems that DocID: 1xUKn - View Document
	Cluster Fault-Tolerance: An Experimental Evaluation of Checkpointing and MapReduce through Simulation Thomas C. Bressoud #1 , Michael A. Kozuch ∗2 # DocID: 1rqZy - View Document
	Attested Append-Only Memory: Making Adversaries Stick to their Word Byung-Gon Chun† Petros Maniatis⋆ Scott Shenker†‡ † DocID: 1rqQM - View Document