CSR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Queries over streaming data offer the potential to provide timely information for modern database applications, such as sensor networks and web services. Isoline-based vi...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
CSR
2006
Springer
13 years 11 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
