<--- Back to Details
First PageDocument Content
Leader election / Networks / Network theory / Computer programming / Mathematics / Combinatorial optimization / Routing algorithms / Search algorithms / Computing
Date: 2016-07-25 01:25:31
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

Add to Reading List

Source URL: www.comp.nus.edu.sg

Download Document from Source Website

File Size: 605,73 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

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

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

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

DocID: 1r6G6 - View Document

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

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

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

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

DocID: 1qVmW - View Document

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

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

DocID: 1qUdZ - View Document