FO[<]-Uniformity. - Christoph Behle; Klaus-Jörn Lange (CCC, 2006)

Regular Languages Definable by Majority Quantifiers with Two Variables. - Christoph Behle; Andreas Krebs; Stephanie Reifferscheid (Developments in Language Theory, 2009)

Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]. - Christoph Behle; Andreas Krebs; Stephanie Reifferscheid (LATA, 2009)

An Approach to characterize the Regular Languages in TC0 with Linear Wires. - Christoph Behle; Andreas Krebs; Stephanie Reifferscheid (Electron. Colloquium Comput. Complex., 2009)

Practical Graph Isomorphism for Graphlet Data Mining in Protein Structures. - Carsten Henneges; Christoph Behle; Andreas Zell (IJCCI (Selected Papers), 2010)

Regular Languages in MAJ[>] with three variables. - Christoph Behle; Andreas Krebs (Electron. Colloquium Comput. Complex., 2011)

Low uniform versions of NC1. - Christoph Behle; Andreas Krebs; Klaus-Jörn Lange; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2011)

Typed Monoids - An Eilenberg-like Theorem for non regular Languages. - Christoph Behle; Andreas Krebs; Stephanie Reifferscheid (Electron. Colloquium Comput. Complex., 2011)

The Lower Reaches of Circuit Uniformity. - Christoph Behle; Andreas Krebs; Klaus-Jörn Lange; Pierre McKenzie (MFCS, 2012)

Linear circuits, two-variable logic and weakly blocked monoids. - Christoph Behle; Andreas Krebs; Mark Mercer (Theor. Comput. Sci., 2013)