First Page | Document Content | |
---|---|---|
![]() Date: 2014-09-26 08:36:31Analysis 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 | Add to Reading List |
![]() | Quantum Leader Election S. Tani, H. Kobayashi, K. Matsumoto, Y. Okubo, X,-B. Wang, Y.-K. Jiang, A. Tomita LNCS3404, ); arXiv:; PRA77, Quantum Leader ElectionDocID: 1ufoL - View Document |
![]() | Gathering Asynchronous Oblivious Mobile Robots in a Ring Ralf Klasing1 , Euripides Markou2,? , and Andrzej Pelc3,?? 1 2DocID: 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: +DocID: 1r62H - View Document |
![]() | The Cost of Unknown Diameter in Dynamic Networks Haifeng Yu Yuda ZhaoDocID: 1qVmW - View Document |
![]() | Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph LenzenDocID: 1qUdZ - View Document |