LCC'14 Opening Remarks (abstract)

Weighted Automata Theory for Complexity Analysis of Rewrite Systems (abstract)

Non-uniform Polytime Computation in the Infinitary Affine Lambda-calculus (abstract)

Towards recursion schemata for the probablistic class PP (abstract)

Closing a Gap in the Complexity of Refinement Modal Logic (abstract)

On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic (abstract)

First-Order Logic of Order and Metric has the Three-Variable Property (abstract)

Search problems, proof complexity, and second-order bounded arithmetic (abstract)

Infinite AC0 Circuits for Parity (abstract)

Descriptive Complexity and CSP (abstract)

Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic (abstract)

Small Dynamic Descriptive Complexity Classes (abstract)

ImmermanFest Opening Remarks (abstract)

27 and still counting: Iterated product, inductive counting, and the structure of P (abstract)

Some Reflections on Definability and Complexity (abstract)

Crane Beach Revisited (abstract)

On the power of fixed-point logic with counting (abstract)

Reasoning about transitive closure in Immerman's style (abstract)

The Variable Hierarchy on Ordered Graphs (abstract)

Closing Remarks (abstract)