10608 search results - page 279 / 2122 » Complexity of O'Hara's Algorithm |
121
click to vote
PODC
2003
ACM
15 years 5 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
95
Voted
WDAG
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
75
Voted
CORR
2008
Springer
15 years 20 days ago
2008
Springer
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduc...
106
click to vote
DCC
2008
IEEE
16 years 5 days ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
103
Voted
ACSD
2009
IEEE
15 years 4 months ago
2009
IEEE
A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrent systems. Among them, the...