2084 search results - page 173 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
137
click to vote
CC
2007
Springer
15 years 5 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
142
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
168
Voted
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
137
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
126
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...