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 | Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph LenzenAdd to Reading ListSource URL: disco.ethz.chDownload Document from Source WebsiteFile Size: 175,58 KBShare Document on Facebook |
TheToolkit for Building Your Own Balls-into-Bins Algorithm Pierre Bertrand ´ Ecole Normale Sup´erieure Cachan AbstractDocID: 1uxSe - View Document | |
Balanced Allocations: Balls-into-Bins Revisited and Chains-into-Bins Tu˘gkan Batu∗ Petra Berenbrink†DocID: 1uk7n - View Document | |
Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph LenzenDocID: 1qUdZ - View Document | |
Brief Announcement: TheToolkit for Building Your Own Balls-into-Bins Algorithm Pierre Bertrand1 and Christoph Lenzen2 1 Ecole Normale Suprieure CachanDocID: 1q0nQ - View Document | |
Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011DocID: 1p7SC - View Document |