Back to Results
First PageMeta Content
Analysis of algorithms / Balls into bins / With high probability / Sorting algorithm / Leader election / Time complexity / Best / worst and average case / Big O notation / Bin / Iterated logarithm / Randomized algorithm / Asymptotically optimal algorithm


Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen
Add to Reading List

Document Date: 2015-05-29 10:12:02

Open Document

File Size: 175,58 KB

Share Result on Facebook