Andreas Krebs

ScholarGPS® ID: 14399310988374

Affiliation

University of Tübingen, Tübingen, Germany

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Metrics Summary

Publication Count

Predicted Citations

232

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Skew circuits of small width (journal article) Balaji, Nikhil \| Krebs, Andreas \| Limaye, Nutan Theoretical Computer Science, volume 821 (2020). 10.1016/j.tcs.2017.03.013 Cite \| Source
Difference hierarchies and duality with an application to formal languages (journal article) Borlido, Célia \| Gehrke, Mai \| Krebs, Andreas \| Straubing, Howard Topology and its Applications, volume 273 (2020). 10.1016/j.topol.2019.106975 Cited by (2) \| Cite \| Source
Diminishable parameterized problems and strict polynomial kernelization (journal article) Fernau, Henning \| Fluschnik, Till \| Hermelin, Danny \| Krebs, Andreas \| Molter, Hendrik \| Niedermeier, Rolf Computability (2020). 10.3233/COM-180220 Cited by (1) \| Cite \| Source
A topological approach to non-uniform complexity (journal article) Czarnetzki, Silke \| Krebs, Andreas Information and Computation, volume 269 (2019). 10.1016/j.ic.2019.104443 Cited by (1) \| Cite \| Source
The model checking fingerprints of CTL operators (journal article) Krebs, Andreas \| Meier, Arne \| Mundhenk, Martin Acta Informatica, volume 56, issue 6, pages 487-519 (2019). 10.1007/s00236-018-0326-9 Cited by (2) \| Cite \| Source \| Open Access
Better Complexity Bounds for Cost Register Automata (journal article) Allender, Eric \| Krebs, Andreas \| McKenzie, Pierre Theory of Computing Systems, volume 63, issue 3, pages 367-385 (2019). 10.1007/s00224-018-9871-4 Cited by (1) \| Cite \| Source
Wreath Products of Distributive Forest Algebras (conference) Hahn, Michael \| Krebs, Andreas \| Straubing, Howard LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (2018) Oxford United Kingdom 10.1145/3209108.3209158 Cite \| Source
The Algebraic Theory of Parikh Automata (journal article) Cadilhac, Michaël \| Krebs, Andreas \| McKenzie, Pierre Theory of Computing Systems, volume 62, issue 5, pages 1241-1268 (2018). 10.1007/s00224-017-9817-2 Cited by (2) \| Cite \| Source
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy (book chapter) In Language and Automata Theory and Applications Güler, Demen \| Krebs, Andreas \| Lange, Klaus-Jörn \| Wolf, Petra Springer International Publishing (2018) 10.1007/978-3-319-77313-1_12 Cited by (6) \| Cite \| Source
Diminishable Parameterized Problems and Strict Polynomial Kernelization (book chapter) In Sailing Routes in the World of Computation Fernau, Henning \| Fluschnik, Till \| Hermelin, Danny \| Krebs, Andreas \| Molter, Hendrik \| Niedermeier, Rolf Springer International Publishing (2018) 10.1007/978-3-319-94418-0_17 Cited by (6) \| Cite \| Source \| Open Access
A Unified Method for Placing Problems in Polylogarithmic Depth. (conference) Krebs, Andreas \| Limaye, Nutan \| Ludwig, Michael Foundations of Software Technology and Theoretical Computer Science (2018) 10.4230/LIPIcs.FSTTCS.2017.36 Cited by (2) \| Cite \| Source
An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic (journal article) Krebs, Andreas \| Straubing, Howard ACM Transactions on Computational Logic, volume 18, issue 4, pages 1-22 (2017). 10.1145/3149822 Cited by (5) \| Cite \| Source \| Open Access
Stone duality for languages and complexity (journal article) Gehrke, Mai \| Krebs, Andreas ACM SIGLOG News, volume 4, issue 2, pages 29-53 (2017). 10.1145/3090064.3090068 Cited by (2) \| Cite \| Source
Small Depth Proof Systems (journal article) Krebs, Andreas \| Limaye, Nutan \| Mahajan, Meena \| Sreenivasaiah, Karteek ACM Transactions on Computation Theory, volume 9, issue 1, pages 1-26 (2017). 10.1145/2956229 Cite \| Source
Problems on Finite Automata and the Exponential Time Hypothesis (journal article) Fernau, Henning \| Krebs, Andreas Algorithms, volume 10, issue 1, pages 24- (2017). 10.3390/a10010024 Cited by (19) \| Cite \| Source \| Open Access
Stone Duality and the Substitution Principle (conference) Borlido, Célia \| Czarnetzki, Silke \| Gehrke, Mai \| Krebs, Andreas Computer Science Logic (2017) 10.4230/LIPIcs.CSL.2017.13 Cited by (2) \| Cite \| Source
The complexity of intersecting finite automata having few final states (journal article) Blondin, Michael \| Krebs, Andreas \| McKenzie, Pierre computational complexity, volume 25, issue 4, pages 775-814 (2016). 10.1007/s00037-014-0089-9 Cited by (2) \| Cite \| Source
Two-variable Logic with a Between Relation (conference) Krebs, Andreas \| Lodaya, Kamal \| Pandya, Paritosh \| Straubing, Howard LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science (2016) New York NY USA 10.1145/2933575.2935308 Cited by (4) \| Cite \| Source
A Language-Theoretical Approach to Descriptive Complexity (book chapter) In Developments in Language Theory Cadilhac, Michaël \| Krebs, Andreas \| Lange, Klaus-Jörn Springer Berlin Heidelberg (2016) 10.1007/978-3-662-53132-7_6 Cite \| Source
Positive and negative proofs for circuits and branching programs (journal article) Dorzweiler, Olga \| Flamm, Thomas \| Krebs, Andreas \| Ludwig, Michael Theoretical Computer Science, volume 610 (2016). 10.1016/j.tcs.2015.08.041 Cited by (2) \| Cite \| Source