Andreas Krebs
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
33
Venues
11
Active years
2005–2025
Best venue rank
A*
Where they publish
Papers
33 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICLR | 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 |
| 2018 | CiE | Diminishable Parameterized Problems and Strict Polynomial Kernelization. | Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier |
| 2018 | CSL | An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation. | Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing |
| 2018 | LATA | Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. | Demen Gler, Andreas Krebs, Klaus-Jrn Lange, Petra Wolf |
| 2018 | LICS | Wreath Products of Distributive Forest Algebras. | Michael Hahn, Andreas Krebs, Howard Straubing |
| 2018 | MFCS | Team Semantics for the Specification and Verification of Hyperproperties. | Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann |
| 2017 | CSL | Stone Duality and the Substitution Principle. | Clia Borlido, Silke Czarnetzki, Mai Gehrke, Andreas Krebs |
| 2017 | ESA | On the Complexity of Bounded Context Switching. | Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan |
| 2017 | MFCS | Better Complexity Bounds for Cost Register Automata. | Eric Allender, Andreas Krebs, Pierre McKenzie |
| 2016 | COCOON | Cost Register Automata for Nested Words. | Andreas Krebs, Nutan Limaye, Michael Ludwig |
| 2016 | DLT | A Language-Theoretical Approach to Descriptive Complexity. | Michal Cadilhac, Andreas Krebs, Klaus-Jrn Lange |
| 2016 | LATA | Using Duality in Circuit Complexity. | Silke Czarnetzki, Andreas Krebs |
| 2016 | LICS | Two-variable Logic with a Between Relation. | Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing |
| 2015 | COCOON | Skew Circuits of Small Width. | Nikhil Balaji, Andreas Krebs, Nutan Limaye |
| 2015 | DLT | On Distinguishing NC | Andreas Krebs, Klaus-Jrn Lange, Michael Ludwig |
| 2015 | LICS | Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth. | Andreas Krebs, Oleg Verbitsky |
| 2015 | MFCS | A Circuit Complexity Approach to Transductions. | Michal Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman |
| 2015 | MFCS | Visibly Counter Languages and the Structure of NC | Michael Hahn, Andreas Krebs, Klaus-Jrn Lange, Michael Ludwig |
| 2015 | STACS | Visibly Counter Languages and Constant Depth Circuits. | Andreas Krebs, Klaus-Jrn Lange, Michael Ludwig |
| 2015 | TIME | The Model Checking Fingerprints of CTL Operators. | Andreas Krebs, Arne Meier, Martin Mundhenk |
| 2015 | TIME | A Team Based Variant of CTL. | Andreas Krebs, Arne Meier, Jonni Virtema |
| 2013 | CSL | Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy. | Christoph Berkholz, Andreas Krebs, Oleg Verbitsky |
| 2013 | MFCS | Small Depth Proof Systems. | Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah |
| 2012 | DLT | Dense Completeness. | Andreas Krebs, Klaus-Jrn Lange |
| 2012 | LICS | Non-definability of Languages by Generalized First-order Formulas over (N, +). | Andreas Krebs, A. V. Sreejith |
| 2012 | MFCS | The Lower Reaches of Circuit Uniformity. | Christoph Behle, Andreas Krebs, Klaus-Jrn Lange, Pierre McKenzie |
| 2011 | MFCS | Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. | Andreas Krebs, Nutan Limaye, Srikanth Srinivasan |
| 2010 | COCOON | Counting Paths in VPA Is Complete for #NC | Andreas Krebs, Nutan Limaye, Meena Mahajan |
| 2009 | DLT | Regular Languages Definable by Majority Quantifiers with Two Variables. | Christoph Behle, Andreas Krebs, Stephanie Reifferscheid |
| 2009 | LATA | Non-solvable Groups Are Not in FO+MOD+MJ2[REG]. | Christoph Behle, Andreas Krebs, Stephanie Reifferscheid |
| 2007 | MFCS | Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids. | Christoph Behle, Andreas Krebs, Mark Mercer |
| 2007 | STACS | Languages with Bounded Multiparty Communication Complexity. | Arkadev Chattopadhyay, Andreas Krebs, Michal Kouck, Mario Szegedy, Pascal Tesson, Denis Thrien |
| 2005 | STACS | Characterizing TC | Andreas Krebs, Klaus-Jrn Lange, Stephanie Reifferscheid |