13621 search results - page 207 / 2725 » Computability and Complexity in Self-assembly |
160
click to vote
LICS
2008
IEEE
16 years 28 days ago
2008
IEEE
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
181
click to vote
FCT
2007
Springer
16 years 21 days ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
ICCS
2004
Springer
15 years 12 months ago
2004
Springer
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
151
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
186
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...