 | 2011 |
|---|
| 10 |       | Christoph Behle,
Andreas Krebs,
Stephanie Reifferscheid:
Typed Monoids - An Eilenberg-Like Theorem for Non Regular Languages.
CAI 2011: 97-114 |
| 9 | | Christoph Behle,
Andreas Krebs:
Regular Languages in MAJ[>] with three variables.
Electronic Colloquium on Computational Complexity (ECCC) 18: 173 (2011) |
| 8 | | 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) |
| 7 | | 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 |
|---|
| 6 | | Carsten Henneges,
Christoph Behle,
Andreas Zell:
Practical Graph Isomorphism for Graphlet Data Mining in Protein Structures.
IJCCI (Selected Papers) 2010: 345-360 |
| 2009 |
|---|
| 5 | | Christoph Behle,
Andreas Krebs,
Stephanie Reifferscheid:
Regular Languages Definable by Majority Quantifiers with Two Variables.
Developments in Language Theory 2009: 91-102 |
| 4 | | Christoph Behle,
Andreas Krebs,
Stephanie Reifferscheid:
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG].
LATA 2009: 129-140 |
| 3 | | 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) |
| 2007 |
|---|
| 2 | | Christoph Behle,
Andreas Krebs,
Mark Mercer:
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids.
MFCS 2007: 147-158 |
| 2006 |
|---|
| 1 | | Christoph Behle,
Klaus-Jörn Lange:
FO[<]-Uniformity.
IEEE Conference on Computational Complexity 2006: 183-189 |
Data released under the ODC-BY 1.0 license — See also our legal information page