Bernd Borchert

Publication Activity (10 Years)

Years Active: 1994-2013
Publications (10 Years): 0

Top Venues

Chic. J. Theor. Comput. Sci.

WISTP

ICITST

University of Heidelberg, Germany (PHD)

Education History

University of Heidelberg, Germany

PHD

Publications

Bernd Borchert, Max Günther
Indirect NFC-login. ICITST (2013)
Max Günther, Bernd Borchert
Online Banking with NFC-Enabled Bank Card and NFC-Enabled Smartphone. WISTP (2013)
Bernd Borchert, Pierre McKenzie, Klaus Reinhardt
Few Product Gates but Many Zeroes. Chic. J. Theor. Comput. Sci. 2013 (2013)
Bernd Borchert, Pierre McKenzie, Klaus Reinhardt
Few Product Gates But Many Zeros. MFCS (2009)
Bernd Borchert
Formal Language Characterizations of P, NP, and PSPACE. J. Autom. Lang. Comb. 13 (3/4) (2008)
Bernd Borchert, Klaus Reinhardt
Deterministically and Sudoku-Deterministically Recognizable Picture Languages. LATA (2007)
Bernd Borchert, Klaus Reinhardt
Searching Paths of Constant Bandwidth. SOFSEM (2006)
Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
The dot-depth and the polynomial hierarchies correspond on the delta levels. Int. J. Found. Comput. Sci. 16 (4) (2005)
Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. Developments in Language Theory (2004)
Bernd Borchert, Riccardo Silvestri
Dot operators. Theor. Comput. Sci. 262 (1) (2001)
Bernd Borchert, Frank Stephan
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Math. Log. Q. 46 (4) (2000)
Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
Restrictive Acceptance Suffices for Equivalence Problems CoRR (1999)
Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
Restrictive Acceptance Suffices for Equivalence Problems. FCT (1999)
Bernd Borchert, Dietrich Kuske, Frank Stephan
On existentially first-order definable languages and their relation to NP. RAIRO Theor. Informatics Appl. 33 (3) (1999)
Bernd Borchert, Desh Ranjan, Frank Stephan
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. Theory Comput. Syst. 31 (6) (1998)
Bernd Borchert, Dietrich Kuske, Frank Stephan
On Existentially First-Order Definable Languages and Their Relation to NP. ICALP (1998)
Bernd Borchert, Frank Stephan
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Kurt Gödel Colloquium (1997)
Bernd Borchert, Riccardo Silvestri
A Characterization of the Leaf Language Classes. Inf. Process. Lett. 63 (3) (1997)
Bernd Borchert, Riccardo Silvestri
The General Notion of a Dot-Operator. Computational Complexity Conference (1997)
Bernd Borchert, Dietrich Kuske, Frank Stephan
On Existentially First-Order Definable Languages and their Relation to NP Electron. Colloquium Comput. Complex. 4 (13) (1997)
Bernd Borchert, Antoni Lozano
Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. Inf. Process. Lett. 59 (4) (1996)
Bernd Borchert, Frank Stephan
Looking for an Analogue of Rice's Theorem in Complexity Theory Electron. Colloquium Comput. Complex. 3 (60) (1996)
Bernd Borchert, Antoni Lozano
Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept Electron. Colloquium Comput. Complex. 3 (6) (1996)
Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems Electron. Colloquium Comput. Complex. 3 (45) (1996)
Bernd Borchert, Desh Ranjan, Frank Stephan
On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions Electron. Colloquium Comput. Complex. 3 (33) (1996)
Bernd Borchert
On the Acceptance Power of Regular Languages. Theor. Comput. Sci. 148 (2) (1995)
Bernd Borchert
Predicate Classes and Promise Classes. Computational Complexity Conference (1994)
Bernd Borchert
On the Acceptance Power of Regular Languages. STACS (1994)

Bernd Borchert.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bernd Borchert