Bernd Borchert

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