Cs-Lo
A criterion for "easiness" of certain SAT problems
Branching-time model checking of one-counter processes
Order-Invariant MSO is Stronger than Counting MSO in the Finite
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
Arithmetical meadows
Kolmogorov Complexity in perspective. Part II: Classification, Information Processing and Duality
An Implicit Characterization of PSPACE
Realizing evaluation strategies by hierarchical graph rewriting
Functional units for natural numbers
Exhaustible sets in higher-type computation
Degrees of Undecidability in Rewriting
Common Knowledge in Interaction Structures
Relativized hyperequivalence of logic programs for modular programming
The Isomorphism Problem On Classes of Automatic Structures
Distance Constraint Satisfaction Problems
Monadic second-order model-checking on decomposable matroids
On Finite Bases for Weak Semantics: Failures versus Impossible Futures
Decisive Markov Chains
Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation
A proof theoretic analysis of intruder theories
Simple characterizations for commutativity of quantum weakest preconditions
Heuristic Methods for Security Protocols
