<--- Back to Details
First PageDocument Content
Consensus / Distributed computing / Randomized algorithm / Distributed data storage / Chord / Leader election
Date: 2014-11-12 04:31:22
Consensus
Distributed computing
Randomized algorithm
Distributed data storage
Chord
Leader election

Lecture 4 Reaching Consensus 4.1 The problem

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Download Document from Source Website

File Size: 117,11 KB

Share Document on Facebook

Similar Documents

Quantum Leader Election S. Tani, H. Kobayashi, K. Matsumoto, Y. Okubo, X,-B. Wang, Y.-K. Jiang, A. Tomita LNCS3404, ); arXiv:; PRA77, Quantum Leader Election

DocID: 1ufoL - View Document

Robot / Mobile robot / Leader election

Gathering Asynchronous Oblivious Mobile Robots in a Ring Ralf Klasing1 , Euripides Markou2,? , and Andrzej Pelc3,?? 1 2

DocID: 1r6G6 - View Document

Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Spanning tree / Combinatorial optimization / Maximal independent set / Matching / Connectivity / Vertex cover / Minimum spanning tree / Leader election

On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

DocID: 1r62H - View Document

Leader election / Networks / Network theory / Computer programming / Mathematics / Combinatorial optimization / Routing algorithms / Search algorithms / Computing

The Cost of Unknown Diameter in Dynamic Networks Haifeng Yu Yuda Zhao

DocID: 1qVmW - View Document

Analysis of algorithms / Computational complexity theory / Theory of computation / Mathematics / Balls into bins / With high probability / Sorting algorithm / Leader election / Time complexity / Entropy / Best /  worst and average case / Big O notation

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

DocID: 1qUdZ - View Document