| No. |
Title |
Author |
Year |
| 1 |
A Unified Method for Placing Problems in Polylogarithmic Depth |
Krebs, Andreas et al. |
2018 |
| 2 |
An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation |
Krebs, Andreas et al. |
2018 |
| 3 |
Team Semantics for the Specification and Verification of Hyperproperties |
Krebs, Andreas et al. |
2018 |
| 4 |
Better Complexity Bounds for Cost Register Automata |
Allender, Eric et al. |
2017 |
| 5 |
On the Complexity of Bounded Context Switching |
Chini, Peter et al. |
2017 |
| 6 |
Stone Duality and the Substitution Principle |
Borlido, Célia et al. |
2017 |
| 7 |
Visibly Counter Languages and Constant Depth Circuits |
Krebs, Andreas et al. |
2015 |
| 8 |
Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy |
Berkholz, Christoph et al. |
2013 |
| 9 |
DLOGTIME Proof Systems |
Krebs, Andreas et al. |
2013 |
| 10 |
An effective characterization of the alternation hierarchy in two-variable logic |
Krebs, Andreas et al. |
2012 |
