Bernd Borchert

2006
22	EE	Bernd Borchert, Klaus Reinhardt: Searching Paths of Constant Bandwidth. SOFSEM 2006: 187-196
2005
21	EE	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): 625-644 (2005)
2004
20	EE	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: 89-101
2001
19	EE	Bernd Borchert, Riccardo Silvestri: Dot operators. Theor. Comput. Sci. 262(1): 501-523 (2001)
2000
18	EE	Bernd Borchert, Frank Stephan: Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Math. Log. Q. 46(4): 489-504 (2000)
1999
17	EE	Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe: Restrictive Acceptance Suffices for Equivalence Problems. FCT 1999: 124-135
16	EE	Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe: Restrictive Acceptance Suffices for Equivalence Problems CoRR cs.CC/9907041: (1999)
15		Bernd Borchert, Dietrich Kuske, Frank Stephan: On existentially first-order definable languages and their relation to NP. ITA 33(3): 259-270 (1999)
1998
14	EE	Bernd Borchert, Dietrich Kuske, Frank Stephan: On Existentially First-Order Definable Languages and Their Relation to NP. ICALP 1998: 17-28
13	EE	Bernd Borchert, Desh Ranjan, Frank Stephan: On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. Theory Comput. Syst. 31(6): 679-693 (1998)
1997
12	EE	Bernd Borchert, Riccardo Silvestri: The General Notion of a Dot-Operator. IEEE Conference on Computational Complexity 1997: 36-44
11		Bernd Borchert, Frank Stephan: Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Kurt Gödel Colloquium 1997: 114-127
10	EE	Bernd Borchert, Dietrich Kuske, Frank Stephan: On Existentially First-Order Definable Languages and their Relation to NP Electronic Colloquium on Computational Complexity (ECCC) 4(13): (1997)
9	EE	Bernd Borchert, Riccardo Silvestri: A Characterization of the Leaf Language Classes. Inf. Process. Lett. 63(3): 153-158 (1997)
1996
8	EE	Bernd Borchert, Desh Ranjan, Frank Stephan: On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions Electronic Colloquium on Computational Complexity (ECCC) 3(33): (1996)
7	EE	Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe: Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems Electronic Colloquium on Computational Complexity (ECCC) 3(45): (1996)
6	EE	Bernd Borchert, Antoni Lozano: Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept Electronic Colloquium on Computational Complexity (ECCC) 3(6): (1996)
5	EE	Bernd Borchert, Frank Stephan: Looking for an Analogue of Rice's Theorem in Complexity Theory Electronic Colloquium on Computational Complexity (ECCC) 3(60): (1996)
4	EE	Bernd Borchert, Antoni Lozano: Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. Inf. Process. Lett. 59(4): 211-215 (1996)
1995
3	EE	Bernd Borchert: On the Acceptance Power of Regular Languages. Theor. Comput. Sci. 148(2): 207-225 (1995)
1994
2		Bernd Borchert: On the Acceptance Power of Regular Languages. STACS 1994: 533-541
1		Bernd Borchert: Predicate Classes and Promise Classes. Structure in Complexity Theory Conference 1994: 235-241

Coauthor Index

1	Lane A. Hemaspaandra (Lane A. Hemachandra)	[7] [16] [17]
2	Dietrich Kuske	[10] [14] [15]
3	Klaus-Jörn Lange	[20] [21]
4	Antoni Lozano	[4] [6]
5	Desh Ranjan	[8] [13]
6	Klaus Reinhardt	[22]
7	Jörg Rothe	[7] [16] [17]
8	Riccardo Silvestri	[9] [12] [19]
9	Frank Stephan	[5] [8] [10] [11] [13] [14] [15] [18] [20] [21]
10	Pascal Tesson	[20] [21]
11	Denis Thérien	[20] [21]

Colors in the list of coauthors