Predicate classes, promise classe, and the acceptance power of regular languages. - Bernd Borchert (1994)

Predicate Classes and Promise Classes. - Bernd Borchert (SCT, 1994)

On the Acceptance Power of Regular Languages. - Bernd Borchert (STACS, 1994)

Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept - Bernd Borchert; Antoni Lozano (Electron. Colloquium Comput. Complex., 1996)

Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems - Bernd Borchert; Lane A. Hemaspaandra; Jörg Rothe (Electron. Colloquium Comput. Complex., 1996)

Looking for an Analogue of Rice's Theorem in Complexity Theory - Bernd Borchert; Frank Stephan 001 (Electron. Colloquium Comput. Complex., 1996)

The General Notion of a Dot-Operator. - Bernd Borchert; Riccardo Silvestri (CCC, 1997)

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. - Bernd Borchert; Frank Stephan 001 (Kurt Gödel Colloquium, 1997)

A Characterization of the Leaf Language Classes. - Bernd Borchert; Riccardo Silvestri (Inf. Process. Lett., 1997)

On Existentially First-Order Definable Languages and Their Relation to NP. - Bernd Borchert; Dietrich Kuske; Frank Stephan 001 (ICALP, 1998)

On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. - Bernd Borchert; Desh Ranjan; Frank Stephan 001 (Theory Comput. Syst., 1998)

Restrictive Acceptance Suffices for Equivalence Problems. - Bernd Borchert; Lane A. Hemaspaandra; Jörg Rothe (FCT, 1999)

Dot operators. - Bernd Borchert; Riccardo Silvestri (Theor. Comput. Sci., 2001)

The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. - Bernd Borchert; Klaus-Jörn Lange; Frank Stephan 001; Pascal Tesson; Denis Thérien (Developments in Language Theory, 2004)

The dot-depth and the polynomial hierarchies correspond on the delta levels. - Bernd Borchert; Klaus-Jörn Lange; Frank Stephan 001; Pascal Tesson; Denis Thérien (Int. J. Found. Comput. Sci., 2005)

Searching Paths of Constant Bandwidth. - Bernd Borchert; Klaus Reinhardt (SOFSEM, 2006)

Deterministically and Sudoku-Deterministically Recognizable Picture Languages. - Bernd Borchert; Klaus Reinhardt (LATA, 2007)

Formal Language Characterizations of P, NP, and PSPACE. - Bernd Borchert (J. Autom. Lang. Comb., 2008)

Few Product Gates But Many Zeros. - Bernd Borchert; Pierre McKenzie; Klaus Reinhardt (MFCS, 2009)

Indirect NFC-login. - Bernd Borchert; Max Günther (ICITST, 2013)

Online Banking with NFC-Enabled Bank Card and NFC-Enabled Smartphone. - Max Günther; Bernd Borchert (WISTP, 2013)

Few Product Gates but Many Zeroes. - Bernd Borchert; Pierre McKenzie; Klaus Reinhardt (Chic. J. Theor. Comput. Sci., 2013)