<--- Back to Details
First PageDocument Content
Mathematics / Self-stabilization / Randomized algorithm / Search algorithms / Routing algorithms / Small world routing / Superstabilization / Theoretical computer science / Computational complexity theory / Fault-tolerant computer systems
Date: 2014-09-26 08:28:48
Mathematics
Self-stabilization
Randomized algorithm
Search algorithms
Routing algorithms
Small world routing
Superstabilization
Theoretical computer science
Computational complexity theory
Fault-tolerant computer systems

Add to Reading List

Source URL: dcg.ethz.ch

Download Document from Source Website

File Size: 186,28 KB

Share Document on Facebook

Similar Documents

Mathematics / Self-stabilization / Randomized algorithm / Search algorithms / Routing algorithms / Small world routing / Superstabilization / Theoretical computer science / Computational complexity theory / Fault-tolerant computer systems

Chapter 12 Stabilization A large branch of research in distributed computing deals with fault-tolerance. Being able to tolerate a considerable fraction of failing or even maliciously behaving (“Byzantine”) nodes whi

DocID: 17vNF - View Document

Mathematics / Self-stabilization / Randomized algorithm / Search algorithms / Routing algorithms / Small world routing / Superstabilization / Theoretical computer science / Computational complexity theory / Fault-tolerant computer systems

PDF Document

DocID: 17uSQ - View Document

Superstabilization / Convergence / Communications protocol / Modal logic / Process / Distributed computing / Computing / Fault-tolerant computer systems / Self-stabilization

PDF Document

DocID: 5qu - View Document