 | 2012 |
| 23 |  | Andreas Krebs,
Nutan Limaye,
Meena Mahajan:
Counting Paths in VPA Is Complete for #NC 1.
Algorithmica 64(2): 279-294 (2012) |
| 22 |  | Andreas Krebs,
A. V. Sreejith:
Non-definability of languages by generalized first-order formulas over (N,+)
CoRR abs/1204.6179: (2012) |
| 21 |  | Andreas Krebs,
Howard Straubing:
An effective characterization of the alternation hierarchy in two-variable logic
CoRR abs/1205.4802: (2012) |
| 2011 |
| 20 |  | Christoph Behle,
Andreas Krebs,
Stephanie Reifferscheid:
Typed Monoids - An Eilenberg-Like Theorem for Non Regular Languages.
CAI 2011: 97-114 |
| 19 |  | Andreas Krebs,
Johan Wiklund,
Michael Felsberg:
Optimization of Quadrature Filters Based on the Numerical Integration of Improper Integrals.
DAGM-Symposium 2011: 91-100 |
| 18 |  | Andreas Krebs,
Nutan Limaye,
Srikanth Srinivasan:
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions.
MFCS 2011: 412-423 |
| 17 |  | Christoph Behle,
Andreas Krebs:
Regular Languages in MAJ[>] with three variables.
Electronic Colloquium on Computational Complexity (ECCC) 18: 173 (2011) |
| 16 |  | Christoph Behle,
Andreas Krebs,
Stephanie Reifferscheid:
Typed Monoids - An Eilenberg-like Theorem for non regular Languages.
Electronic Colloquium on Computational Complexity (ECCC) 18: 35 (2011) |
| 15 |  | Christoph Behle,
Andreas Krebs,
Klaus-Jörn Lange,
Pierre McKenzie:
Low uniform versions of NC1.
Electronic Colloquium on Computational Complexity (ECCC) 18: 95 (2011) |
| 2010 |
| 14 |  | Andreas Krebs,
Nutan Limaye,
Meena Mahajan:
Counting Paths in VPA Is Complete for #NC1.
COCOON 2010: 44-53 |
| 13 |  | Andreas Krebs,
Nutan Limaye,
Meena Mahajan:
Counting paths in VPA is complete for #NC1.
Electronic Colloquium on Computational Complexity (ECCC) 17: 103 (2010) |
| 12 |  | Matthias Maischak,
Andreas Krebs,
Ernst P. Stephan:
A quadratic programming problem arising from the p-version for obstacle problems.
Electronic Notes in Discrete Mathematics 36: 923-930 (2010) |
| 2009 |
| 11 |  | Christoph Behle,
Andreas Krebs,
Stephanie Reifferscheid:
Regular Languages Definable by Majority Quantifiers with Two Variables.
Developments in Language Theory 2009: 91-102 |
| 10 |  | Christoph Behle,
Andreas Krebs,
Stephanie Reifferscheid:
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG].
LATA 2009: 129-140 |
| 9 |  | Christoph Behle,
Andreas Krebs,
Stephanie Reifferscheid:
An Approach to characterize the Regular Languages in TC0 with Linear Wires.
Electronic Colloquium on Computational Complexity (ECCC) 16: 85 (2009) |
| 2008 |
| 8 |  | Andreas Krebs:
Typed semigroups, majority logic, and threshold circuits.
Eberhard Karls University of Tübingen 2008: 1-111 |
| 2007 |
| 7 |  | Christoph Behle,
Andreas Krebs,
Mark Mercer:
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids.
MFCS 2007: 147-158 |
| 6 |  | Arkadev Chattopadhyay,
Andreas Krebs,
Michal Koucký,
Mario Szegedy,
Pascal Tesson,
Denis Thérien:
Languages with Bounded Multiparty Communication Complexity.
STACS 2007: 500-511 |
| 5 |  | Christoph Hering,
Andreas Krebs:
A partial plane of order 6 constructed from the icosahedron.
Des. Codes Cryptography 44(1-3): 287-292 (2007) |
| 4 |  | Andreas Krebs,
Klaus-Jörn Lange,
Stephanie Reifferscheid:
Characterizing TC0 in Terms of Infinite Groups.
Theory Comput. Syst. 40(4): 303-325 (2007) |
| 2006 |
| 3 |  | Arkadev Chattopadhyay,
Michal Koucký,
Andreas Krebs,
Mario Szegedy,
Pascal Tesson,
Denis Thérien:
Languages with Bounded Multiparty Communication Complexity.
Electronic Colloquium on Computational Complexity (ECCC) 13(117): (2006) |
| 2005 |
| 2 |  | Andreas Krebs,
Klaus-Jörn Lange,
Stephanie Reifferscheid:
Characterizing TC0 in Terms of Infinite Groups.
STACS 2005: 496-507 |
| 2003 |
| 1 |  | Andreas Krebs,
Jürgen Ruf:
Optimized Temporal Logic Compilation.
J. UCS 9(2): 120-137 (2003) |