Back to Results
First PageMeta Content
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
Add to Reading List

Document Date: 2014-09-26 08:28:48


Open Document

File Size: 182,23 KB

Share Result on Facebook

City

Jerusalem / /

Country

United States / Italy / Israel / /

Event

Product Issues / /

IndustryTerm

consensus protocols / local area network / self-stabilizing algorithm / self-stabilizing algorithms / autonomic computing / deterministic local approximation algorithms / Self-stabilizing systems / local algorithms / local algorithm / a lot of fun designing self-stabilizing algorithms / distributed computing deals / randomized local algorithm / deterministic local algorithm / distributed computing / local approximation algorithms / token ring network / /

Organization

Republican Party / /

Person

John von Neumann / Baruch Awerbuch / David Peleg / Martin Gardner / Boaz Patt-Shamir / Silvio Frischknecht / Roger Wattenhofer / John Conway / Peter Winkler / Barbara Keller / George Varghese / /

Position

advisor / mathematician / /

Product

nodes / /

PublishedMedium

Scientific American / Communications of the ACM / /

Technology

consensus protocols / LAN / RAM / MIS algorithm / randomized local algorithm / local approximation algorithms / deterministic local algorithm / token ring / selfstabilizing algorithm / slow MIS Algorithm / self-stabilizing algorithms / random access / a lot of fun designing self-stabilizing algorithms / self-stabilizing algorithm / deterministic local approximation algorithms / local algorithm / /

SocialTag