268 search results - page 39 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
CSR
2007
Springer
15 years 3 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
STOC
1997
ACM
15 years 1 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
Region-based memory management offers several important potential advantages over garbage collection, including real-time performance, better data locality, and more efficient us...
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
MCU
1998
14 years 11 months ago
1998
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...