default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Krebs
Person information
- affiliation: University of Tübingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i36]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Synchronous Team Semantics for Temporal Logics. CoRR abs/2409.18667 (2024)- [i35]Xinting Huang, Andy Yang, Satwik Bhattamishra, Yash Sarrof, Andreas Krebs, Hattie Zhou, Preetum Nakkiran, Michael Hahn:
A Formal Framework for Understanding Length Generalization in Transformers. CoRR abs/2410.02140 (2024) - 2022
- [i34]Andreas Krebs, Howard Straubing:
Regular languages defined by first-order formulas without quantifier alternation. CoRR abs/2208.10480 (2022) - 2020
- [j25]Henning Fernau
, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable parameterized problems and strict polynomial kernelization. Comput. 9(1): 1-24 (2020) - [j24]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. Log. Methods Comput. Sci. 16(3) (2020) - [j23]Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew circuits of small width. Theor. Comput. Sci. 821: 111-123 (2020)
2010 – 2019
- 2019
- [j22]Andreas Krebs, Arne Meier, Martin Mundhenk:
The model checking fingerprints of CTL operators. Acta Informatica 56(6): 487-519 (2019) - [j21]Silke Czarnetzki, Andreas Krebs:
A topological approach to non-uniform complexity. Inf. Comput. 269 (2019) - [j20]Eric Allender, Andreas Krebs, Pierre McKenzie:
Better Complexity Bounds for Cost Register Automata. Theory Comput. Syst. 63(3): 367-385 (2019) - [i33]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. CoRR abs/1902.05905 (2019) - [i32]Michael Hahn, Andreas Krebs, Howard Straubing:
Wreath Products of Distributive Forest Algebras. CoRR abs/1911.03493 (2019) - 2018
- [j19]Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
The Algebraic Theory of Parikh Automata. Theory Comput. Syst. 62(5): 1241-1268 (2018) - [c43]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE 2018: 161-171 - [c42]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation. CSL 2018: 28:1-28:17 - [c41]Demen Güler, Andreas Krebs, Klaus-Jörn Lange, Petra Wolf:
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. LATA 2018: 156-168 - [c40]Michael Hahn, Andreas Krebs, Howard Straubing:
Wreath Products of Distributive Forest Algebras. LICS 2018: 512-520 - [c39]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Team Semantics for the Specification and Verification of Hyperproperties. MFCS 2018: 10:1-10:16 - [i31]Silke Czarnetzki, Andreas Krebs, Klaus-Jörn Lange:
Visibly Pushdown Languages and Free Profinite Algebras. CoRR abs/1810.12731 (2018) - [i30]Célia Borlido, Mai Gehrke, Andreas Krebs, Howard Straubing:
Difference hierarchies and duality with an application to formal languages. CoRR abs/1812.01921 (2018) - 2017
- [j18]Henning Fernau, Andreas Krebs:
Problems on Finite Automata and the Exponential Time Hypothesis. Algorithms 10(1): 24 (2017) - [j17]Mai Gehrke, Andreas Krebs:
Stone duality for languages and complexity. ACM SIGLOG News 4(2): 29-53 (2017) - [j16]Andreas Krebs, Howard Straubing:
An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic. ACM Trans. Comput. Log. 18(4): 30:1-30:22 (2017) - [c38]Célia Borlido, Silke Czarnetzki, Mai Gehrke, Andreas Krebs:
Stone Duality and the Substitution Principle. CSL 2017: 13:1-13:20 - [c37]Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan:
On the Complexity of Bounded Context Switching. ESA 2017: 27:1-27:15 - [c36]Andreas Krebs, Nutan Limaye, Michael Ludwig:
A Unified Method for Placing Problems in Polylogarithmic Depth. FSTTCS 2017: 36:36-36:15 - [c35]Eric Allender, Andreas Krebs, Pierre McKenzie:
Better Complexity Bounds for Cost Register Automata. MFCS 2017: 24:1-24:14 - [i29]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Team Semantics for the Specification and Verification of Hyperproperties. CoRR abs/1709.08510 (2017) - [i28]Eric Allender, Andreas Krebs, Pierre McKenzie:
Better Complexity Bounds for Cost Register Machines. Electron. Colloquium Comput. Complex. TR17 (2017) - [i27]Andreas Krebs, Nutan Limaye, Michael Ludwig:
A Unified Method for Placing Problems in Polylogarithmic Depth. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j15]Michael Blondin, Andreas Krebs, Pierre McKenzie:
The complexity of intersecting finite automata having few final states. Comput. Complex. 25(4): 775-814 (2016) - [j14]Olga Dorzweiler, Thomas Flamm, Andreas Krebs, Michael Ludwig:
Positive and negative proofs for circuits and branching programs. Theor. Comput. Sci. 610: 24-36 (2016) - [j13]Mai Gehrke, Andreas Krebs, Jean-Éric Pin:
Ultrafilters on words for a fragment of logic. Theor. Comput. Sci. 610: 37-58 (2016) - [j12]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. ACM Trans. Comput. Theory 9(1): 2:1-2:26 (2016) - [c34]Andreas Krebs, Nutan Limaye, Michael Ludwig:
Cost Register Automata for Nested Words. COCOON 2016: 587-598 - [c33]Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange:
A Language-Theoretical Approach to Descriptive Complexity. DLT 2016: 64-76 - [c32]Silke Czarnetzki, Andreas Krebs:
Using Duality in Circuit Complexity. LATA 2016: 283-294 - [c31]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable Logic with a Between Relation. LICS 2016: 106-115 - [c30]Henning Fernau, Andreas Krebs:
Problems on Finite Automata and the Exponential Time Hypothesis. CIAA 2016: 89-100 - [i26]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable Logic with a Between Predicate. CoRR abs/1603.05625 (2016) - [i25]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR abs/1611.03739 (2016) - [i24]Andreas Krebs, Meena Mahajan, Anil Shukla:
Relating two width measures for resolution proofs. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j11]Christoph Berkholz, Andreas Krebs, Oleg Verbitsky:
Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy. ACM Trans. Comput. Log. 16(3): 21:1-21:26 (2015) - [c29]Andreas Krebs, Howard Straubing:
EF+EX Forest Algebras. CAI 2015: 128-139 - [c28]Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew Circuits of Small Width. COCOON 2015: 199-210 - [c27]Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
On Distinguishing NC1 and NL. DLT 2015: 340-351 - [c26]Andreas Krebs, Oleg Verbitsky:
Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth. LICS 2015: 689-700 - [c25]Michaël Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman:
A Circuit Complexity Approach to Transductions. MFCS (1) 2015: 141-153 - [c24]Michael Hahn, Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
Visibly Counter Languages and the Structure of NC1. MFCS (2) 2015: 384-394 - [c23]Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
Visibly Counter Languages and Constant Depth Circuits. STACS 2015: 594-607 - [c22]Andreas Krebs, Arne Meier, Martin Mundhenk:
The Model Checking Fingerprints of CTL Operators. TIME 2015: 101-110 - [c21]Andreas Krebs, Arne Meier, Jonni Virtema:
A Team Based Variant of CTL. TIME 2015: 140-149 - [i23]Andreas Krebs, Arne Meier, Martin Mundhenk:
The model checking fingerprints of CTL operators. CoRR abs/1504.04708 (2015) - [i22]Andreas Krebs, Arne Meier, Jonni Virtema:
Parallel Computational Tree Logic. CoRR abs/1505.01964 (2015) - [i21]Michaël Cadilhac, Andreas Krebs, Nutan Limaye:
Value Automata with Filters. CoRR abs/1510.02393 (2015) - [i20]Silke Czarnetzki, Andreas Krebs:
Using Duality in Circuit Complexity. CoRR abs/1510.04849 (2015) - 2014
- [j10]Matthias Maischak, Andreas Krebs, Ernst P. Stephan:
Quasi-optimal degree distribution for a quadratic programming problem arising from the p-version finite element method for a one-dimensional obstacle problem. Discret. Appl. Math. 164: 200-209 (2014) - [j9]Christoph Hering, Andreas Krebs, Thomas Edgar:
Naive configurations. Des. Codes Cryptogr. 72(3): 719-731 (2014) - [c20]Mai Gehrke, Andreas Krebs, Jean-Éric Pin:
From Ultrafilters on Words to the Expressive Power of a Fragment of Logic. DCFS 2014: 138-149 - [c19]Olga Dorzweiler, Thomas Flamm, Andreas Krebs, Michael Ludwig:
Positive and Negative Proofs for Circuits and Branching Programs. DCFS 2014: 270-281 - [c18]Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
Extremely uniform branching programs. NCMA 2014: 73-83 - [i19]Andreas Krebs, Oleg Verbitsky:
Universal covers, color refinement, and two-variable logic with counting quantifiers: Lower bounds for the depth. CoRR abs/1407.3175 (2014) - [i18]Andreas Krebs, Howard Straubing:
EF+EX Forest Algebras. CoRR abs/1408.0809 (2014) - [i17]Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew Circuits of Small Width. Electron. Colloquium Comput. Complex. TR14 (2014) - [i16]Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
Visibly Counter Languages and Constant Depth Circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j8]Christoph Behle, Andreas Krebs, Mark Mercer:
Linear circuits, two-variable logic and weakly blocked monoids. Theor. Comput. Sci. 501: 20-33 (2013) - [j7]Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5(1): 2:1-2:23 (2013) - [c17]Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
The Algebraic Theory of Parikh Automata. CAI 2013: 60-73 - [c16]Christoph Berkholz, Andreas Krebs, Oleg Verbitsky:
Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy. CSL 2013: 61-80 - [c15]Andreas Krebs, Nutan Limaye:
DLOGTIME Proof Systems. FSTTCS 2013: 189-200 - [c14]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. MFCS 2013: 583-594 - [i15]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. CoRR abs/1307.4897 (2013) - [i14]Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
The Algebraic Theory of Parikh Automata. Electron. Colloquium Comput. Complex. TR13 (2013) - [i13]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j6]Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting Paths in VPA Is Complete for #NC 1. Algorithmica 64(2): 279-294 (2012) - [c13]Andreas Krebs, Klaus-Jörn Lange:
Dense Completeness. Developments in Language Theory 2012: 178-189 - [c12]Andreas Krebs, Howard Straubing:
An effective characterization of the alternation hierarchy in two-variable logic. FSTTCS 2012: 86-98 - [c11]Andreas Krebs, A. V. Sreejith:
Non-definability of Languages by Generalized First-order Formulas over (N, +). LICS 2012: 451-460 - [c10]Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie:
The Lower Reaches of Circuit Uniformity. MFCS 2012: 590-602 - [i12]Andreas Krebs, A. V. Sreejith:
Non-definability of languages by generalized first-order formulas over (N,+). CoRR abs/1204.6179 (2012) - [i11]Andreas Krebs, Howard Straubing:
An effective characterization of the alternation hierarchy in two-variable logic. CoRR abs/1205.4802 (2012) - [i10]Andreas Krebs, Nutan Limaye, Srikanth Srinivasan:
Streaming algorithms for recognizing nearly well-parenthesized expressions. CoRR abs/1206.0206 (2012) - [i9]Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. TR12 (2012) - [i8]Michael Blondin, Andreas Krebs, Pierre McKenzie:
The Complexity of Intersecting Finite Automata Having Few Final States. Electron. Colloquium Comput. Complex. TR12 (2012) - [i7]Andreas Krebs, Nutan Limaye:
DLOGTIME-Proof Systems. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c9]Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
Typed Monoids - An Eilenberg-Like Theorem for Non Regular Languages. CAI 2011: 97-114 - [c8]Andreas Krebs, Johan Wiklund, Michael Felsberg:
Optimization of Quadrature Filters Based on the Numerical Integration of Improper Integrals. DAGM-Symposium 2011: 91-100 - [c7]Andreas Krebs, Nutan Limaye, Srikanth Srinivasan:
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. MFCS 2011: 412-423 - [i6]Christoph Behle, Andreas Krebs:
Regular Languages in MAJ[>] with three variables. Electron. Colloquium Comput. Complex. TR11 (2011) - [i5]Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie:
Low uniform versions of NC1. Electron. Colloquium Comput. Complex. TR11 (2011) - [i4]Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
Typed Monoids - An Eilenberg-like Theorem for non regular Languages. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j5]Matthias Maischak, Andreas Krebs, Ernst P. Stephan:
A quadratic programming problem arising from the p-version for obstacle problems. Electron. Notes Discret. Math. 36: 923-930 (2010) - [c6]Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting Paths in VPA Is Complete for #NC1. COCOON 2010: 44-53 - [i3]Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting paths in VPA is complete for #NC1. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c5]Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
Regular Languages Definable by Majority Quantifiers with Two Variables. Developments in Language Theory 2009: 91-102 - [c4]Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]. LATA 2009: 129-140 - [i2]Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
An Approach to characterize the Regular Languages in TC0 with Linear Wires. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [b1]Andreas Krebs:
Typed semigroups, majority logic, and threshold circuits. University of Tübingen, Germany, 2008, pp. 1-111 - 2007
- [j4]Christoph Hering, Andreas Krebs:
A partial plane of order 6 constructed from the icosahedron. Des. Codes Cryptogr. 44(1-3): 287-292 (2007) - [j3]Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid:
Characterizing TC0 in Terms of Infinite Groups. Theory Comput. Syst. 40(4): 303-325 (2007) - [j2]Andreas Krebs, Ernst P. Stephan:
A p-version finite element method for nonlinear elliptic variational inequalities in 2D. Numerische Mathematik 105(3): 457-480 (2007) - [c3]Christoph Behle, Andreas Krebs, Mark Mercer:
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids. MFCS 2007: 147-158 - [c2]Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien:
Languages with Bounded Multiparty Communication Complexity. STACS 2007: 500-511 - 2006
- [i1]Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien:
Languages with Bounded Multiparty Communication Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c1]Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid:
Characterizing TC0 in Terms of Infinite Groups. STACS 2005: 496-507 - 2003
- [j1]Andreas Krebs, Jürgen Ruf:
Optimized Temporal Logic Compilation. J. Univers. Comput. Sci. 9(2): 120-137 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
