Sciweavers

2168 search results - page 30 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
CC
2010
Springer
117views System Software» more  CC 2010»
14 years 9 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
92
Voted
ITSL
2008
15 years 1 months ago
A Randomized Complexity-theoretic Model of Bio-inspired Mobile Epidemics via Close Contact
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
Zhen Cao, Jiejun Kong, Mario Gerla, Dapeng Wu
85
Voted
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
15 years 9 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
91
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
80
Voted
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 3 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...