13306 search results - page 373 / 2662 » Theoretical Computer Science |
170
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
We consrder asynchronous general topology dynamic networks of identical nameless nodes wzth worst-case transient faults. Starting from any faulty configuration, our protocols self...
155
click to vote
STACS
1990
Springer
15 years 10 months ago
1990
Springer
We consider the problem of approximating a convex gure in the plane by a pair (r; R) of homothetic (that is, similar and parallel) rectangles with r C R. We show the existenc...
180
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
Abstract. Concurrent pattern calculus drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising fro...
169
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
155
Voted
STACS
2005
Springer
16 years 8 days ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...