Sciweavers

12 search results - page 3 / 3
» Lower bounds for 2-dimensional range counting
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
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 9 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....