Sciweavers

82 search results - page 17 / 17
» Lower Bounds for the Smoothed Number of Pareto optimal Solut...
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
13 years 10 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
PODC
2005
ACM
13 years 11 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer