555 search results - page 37 / 111 » Complexity of Operations on Cofinite Languages |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
POPL
1999
ACM
13 years 12 months ago
1999
ACM
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, ...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
VL
2005
IEEE
14 years 1 months ago
2005
IEEE
Design by Contract (DbC) is widely acknowledged to be a powerful technique for creating reliable software. DbC allows developers to specify the behavior of an operation precisely ...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...