Back to Results
First PageMeta Content
Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Selection algorithm / B-tree / Oblivious data structure / Maximal independent set


Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland
Add to Reading List

Document Date: 2015-05-18 12:16:23


Open Document

File Size: 239,56 KB

Share Result on Facebook