Optimized Temporal Logic Compilation. - Andreas Krebs; Jürgen Ruf (J. Univers. Comput. Sci., 2003)

Languages with Bounded Multiparty Communication Complexity. - Arkadev Chattopadhyay; Michal Koucký 001; Andreas Krebs; Mario Szegedy; Pascal Tesson; Denis Thérien (Electron. Colloquium Comput. Complex., 2006)

A partial plane of order 6 constructed from the icosahedron. - Christoph Hering; Andreas Krebs (Des. Codes Cryptogr., 2007)

Characterizing TC0 in Terms of Infinite Groups. - Andreas Krebs; Klaus-Jörn Lange; Stephanie Reifferscheid (Theory Comput. Syst., 2007)

A p-version finite element method for nonlinear elliptic variational inequalities in 2D. - Andreas Krebs; Ernst P. Stephan (Numerische Mathematik, 2007)

Typed semigroups, majority logic, and threshold circuits. - Andreas Krebs (2008)

Regular Languages Definable by Majority Quantifiers with Two Variables. - Christoph Behle; Andreas Krebs; Stephanie Reifferscheid (Developments in Language Theory, 2009)

Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]. - Christoph Behle; Andreas Krebs; Stephanie Reifferscheid (LATA, 2009)

An Approach to characterize the Regular Languages in TC0 with Linear Wires. - Christoph Behle; Andreas Krebs; Stephanie Reifferscheid (Electron. Colloquium Comput. Complex., 2009)

Counting paths in VPA is complete for #NC1. - Andreas Krebs; Nutan Limaye; Meena Mahajan (Electron. Colloquium Comput. Complex., 2010)

A quadratic programming problem arising from the p-version for obstacle problems. - Matthias Maischak; Andreas Krebs; Ernst P. Stephan (Electron. Notes Discret. Math., 2010)

Optimization of Quadrature Filters Based on the Numerical Integration of Improper Integrals. - Andreas Krebs; Johan Wiklund; Michael Felsberg (DAGM-Symposium, 2011)

Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. - Andreas Krebs; Nutan Limaye; Srikanth Srinivasan 001 (MFCS, 2011)

Regular Languages in MAJ[>] with three variables. - Christoph Behle; Andreas Krebs (Electron. Colloquium Comput. Complex., 2011)

Low uniform versions of NC1. - Christoph Behle; Andreas Krebs; Klaus-Jörn Lange; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2011)

Typed Monoids - An Eilenberg-like Theorem for non regular Languages. - Christoph Behle; Andreas Krebs; Stephanie Reifferscheid (Electron. Colloquium Comput. Complex., 2011)

Dense Completeness. - Andreas Krebs; Klaus-Jörn Lange (Developments in Language Theory, 2012)

Non-definability of Languages by Generalized First-order Formulas over (N, +). - Andreas Krebs; A. V. Sreejith (LICS, 2012)

The Lower Reaches of Circuit Uniformity. - Christoph Behle; Andreas Krebs; Klaus-Jörn Lange; Pierre McKenzie (MFCS, 2012)

Counting Paths in VPA Is Complete for #NC 1. - Andreas Krebs; Nutan Limaye; Meena Mahajan (Algorithmica, 2012)

Verifying Proofs in Constant Depth. - Olaf Beyersdorff; Samir Datta; Andreas Krebs; Meena Mahajan; Gido Scharfenberger-Fabian; Karteek Sreenivasaiah; Michael Thomas 001; Heribert Vollmer (Electron. Colloquium Comput. Complex., 2012)

DLOGTIME-Proof Systems. - Andreas Krebs; Nutan Limaye (Electron. Colloquium Comput. Complex., 2012)

The Algebraic Theory of Parikh Automata. - Michaël Cadilhac; Andreas Krebs; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2013)

Small Depth Proof Systems. - Andreas Krebs; Nutan Limaye; Meena Mahajan; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2013)

Linear circuits, two-variable logic and weakly blocked monoids. - Christoph Behle; Andreas Krebs; Mark Mercer (Theor. Comput. Sci., 2013)

From Ultrafilters on Words to the Expressive Power of a Fragment of Logic. - Mai Gehrke; Andreas Krebs; Jean-Éric Pin (DCFS, 2014)

Extremely uniform branching programs. - Michaël Cadilhac; Andreas Krebs; Pierre McKenzie (NCMA, 2014)

Universal covers, color refinement, and two-variable logic with counting quantifiers: Lower bounds for the depth. - Andreas Krebs; Oleg Verbitsky 001 (CoRR, 2014)

Quasi-optimal degree distribution for a quadratic programming problem arising from the p-version finite element method for a one-dimensional obstacle problem. - Matthias Maischak; Andreas Krebs; Ernst P. Stephan (Discret. Appl. Math., 2014)

Naive configurations. - Christoph Hering; Andreas Krebs; Thomas Edgar (Des. Codes Cryptogr., 2014)

Visibly Counter Languages and Constant Depth Circuits. - Andreas Krebs; Klaus-Jörn Lange; Michael Ludwig (Electron. Colloquium Comput. Complex., 2014)

EF+EX Forest Algebras. - Andreas Krebs; Howard Straubing (CAI, 2015)

On Distinguishing NC1 and NL. - Andreas Krebs; Klaus-Jörn Lange; Michael Ludwig (DLT, 2015)

Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth. - Andreas Krebs; Oleg Verbitsky 001 (LICS, 2015)

A Circuit Complexity Approach to Transductions. - Michaël Cadilhac; Andreas Krebs; Michael Ludwig; Charles Paperman (MFCS (1), 2015)

Visibly Counter Languages and the Structure of NC1. - Michael Hahn 001; Andreas Krebs; Klaus-Jörn Lange; Michael Ludwig (MFCS (2), 2015)

A Team Based Variant of CTL. - Andreas Krebs; Arne Meier; Jonni Virtema (TIME, 2015)

Value Automata with Filters. - Michaël Cadilhac; Andreas Krebs; Nutan Limaye (CoRR, 2015)

Parallel Computational Tree Logic. - Andreas Krebs; Arne Meier; Jonni Virtema (CoRR, 2015)

Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy. - Christoph Berkholz; Andreas Krebs; Oleg Verbitsky 001 (ACM Trans. Comput. Log., 2015)

Cost Register Automata for Nested Words. - Andreas Krebs; Nutan Limaye; Michael Ludwig (COCOON, 2016)

A Language-Theoretical Approach to Descriptive Complexity. - Michaël Cadilhac; Andreas Krebs; Klaus-Jörn Lange (DLT, 2016)

Using Duality in Circuit Complexity. - Silke Czarnetzki; Andreas Krebs (LATA, 2016)

Two-variable Logic with a Between Relation. - Andreas Krebs; Kamal Lodaya; Paritosh K. Pandya; Howard Straubing (LICS, 2016)

The complexity of intersecting finite automata having few final states. - Michael Blondin; Andreas Krebs; Pierre McKenzie (Comput. Complex., 2016)

Two-variable Logic with a Between Predicate. - Andreas Krebs; Kamal Lodaya; Paritosh K. Pandya; Howard Straubing (CoRR, 2016)

Relating two width measures for resolution proofs. - Andreas Krebs; Meena Mahajan; Anil Shukla (Electron. Colloquium Comput. Complex., 2016)

Positive and negative proofs for circuits and branching programs. - Olga Dorzweiler; Thomas Flamm; Andreas Krebs; Michael Ludwig (Theor. Comput. Sci., 2016)

Ultrafilters on words for a fragment of logic. - Mai Gehrke; Andreas Krebs; Jean-Éric Pin (Theor. Comput. Sci., 2016)

Stone Duality and the Substitution Principle. - Célia Borlido; Silke Czarnetzki; Mai Gehrke; Andreas Krebs (CSL, 2017)

On the Complexity of Bounded Context Switching. - Peter Chini; Jonathan Kolberg; Andreas Krebs; Roland Meyer 001; Prakash Saivasan (ESA, 2017)

Problems on Finite Automata and the Exponential Time Hypothesis. - Henning Fernau; Andreas Krebs (Algorithms, 2017)

Better Complexity Bounds for Cost Register Machines. - Eric Allender; Andreas Krebs; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2017)

A Unified Method for Placing Problems in Polylogarithmic Depth. - Andreas Krebs; Nutan Limaye; Michael Ludwig (Electron. Colloquium Comput. Complex., 2017)

Stone duality for languages and complexity. - Mai Gehrke; Andreas Krebs (ACM SIGLOG News, 2017)

An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic. - Andreas Krebs; Howard Straubing (ACM Trans. Comput. Log., 2017)

An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation. - Andreas Krebs; Kamal Lodaya; Paritosh K. Pandya; Howard Straubing (CSL, 2018)

Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. - Demen Güler; Andreas Krebs; Klaus-Jörn Lange; Petra Wolf 002 (LATA, 2018)

Wreath Products of Distributive Forest Algebras. - Michael Hahn 001; Andreas Krebs; Howard Straubing (LICS, 2018)

Team Semantics for the Specification and Verification of Hyperproperties. - Andreas Krebs; Arne Meier; Jonni Virtema; Martin Zimmermann 002 (MFCS, 2018)

Visibly Pushdown Languages and Free Profinite Algebras. - Silke Czarnetzki; Andreas Krebs; Klaus-Jörn Lange (CoRR, 2018)

Difference hierarchies and duality with an application to formal languages. - Célia Borlido; Mai Gehrke; Andreas Krebs; Howard Straubing (CoRR, 2018)

The model checking fingerprints of CTL operators. - Andreas Krebs; Arne Meier; Martin Mundhenk (Acta Informatica, 2019)

A topological approach to non-uniform complexity. - Silke Czarnetzki; Andreas Krebs (Inf. Comput., 2019)

Better Complexity Bounds for Cost Register Automata. - Eric Allender; Andreas Krebs; Pierre McKenzie (Theory Comput. Syst., 2019)

Diminishable parameterized problems and strict polynomial kernelization. - Henning Fernau; Till Fluschnik; Danny Hermelin; Andreas Krebs; Hendrik Molter; Rolf Niedermeier (Comput., 2020)

Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. - Andreas Krebs; Kamal Lodaya; Paritosh K. Pandya; Howard Straubing (Log. Methods Comput. Sci., 2020)

Skew circuits of small width. - Nikhil Balaji; Andreas Krebs; Nutan Limaye (Theor. Comput. Sci., 2020)

Regular languages defined by first-order formulas without quantifier alternation. - Andreas Krebs; Howard Straubing (CoRR, 2022)

Synchronous Team Semantics for Temporal Logics. - Andreas Krebs; Arne Meier; Jonni Virtema; Martin Zimmermann 002 (CoRR, 2024)

A Formal Framework for Understanding Length Generalization in Transformers. - Xinting Huang; Andy Yang; Satwik Bhattamishra; Yash Raj Sarrof; Andreas Krebs; Hattie Zhou; Preetum Nakkiran; Michael Hahn 001 (ICLR, 2025)