13603 search results - page 2609 / 2721 » On the Computational Complexity of Cut-Reduction |
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
110
click to vote
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
DCOSS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper presents a failure diagnosis algorithm for summarizing and generalizing patterns that lead to instances of anomalous behavior in sensor networks. Often multipl...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
ISEUD
2009
Springer
15 years 4 months ago
2009
Springer
All software today is written using libraries, toolkits, frameworks and other application programming interfaces (APIs). We performed a user study of the online documentation a lar...