1331 search results - page 184 / 267 » Complexity bounds for zero-test algorithms |
119
click to vote
FOSSACS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
130
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
ECCC
2007
15 years 3 months ago
2007
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
110
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
117
click to vote
FMSD
2006
15 years 3 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...