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 |