Bernd Borchert

	2009
25		Bernd Borchert, Pierre McKenzie, Klaus Reinhardt: Few Product Gates But Many Zeros. MFCS 2009: 162-174
	2007
24		Bernd Borchert, Klaus Reinhardt: Deterministically and Sudoku-Deterministically Recognizable Picture Languages. LATA 2007: 175-186
	2006
23		Bernd Borchert, Klaus Reinhardt: Searching Paths of Constant Bandwidth. SOFSEM 2006: 187-196
	2005
22		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
21		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
20		Bernd Borchert, Riccardo Silvestri: Dot operators. Theor. Comput. Sci. 262(1): 501-523 (2001)
	2000
19		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
18		Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe: Restrictive Acceptance Suffices for Equivalence Problems. FCT 1999: 124-135
17		Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe: Restrictive Acceptance Suffices for Equivalence Problems CoRR cs.CC/9907041: (1999)
16		Bernd Borchert, Dietrich Kuske, Frank Stephan: On existentially first-order definable languages and their relation to NP. ITA 33(3): 259-270 (1999)
	1998
15		Bernd Borchert, Dietrich Kuske, Frank Stephan: On Existentially First-Order Definable Languages and Their Relation to NP. ICALP 1998: 17-28
14		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
13		Bernd Borchert, Riccardo Silvestri: The General Notion of a Dot-Operator. IEEE Conference on Computational Complexity 1997: 36-44
12		Bernd Borchert, Frank Stephan: Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Kurt Gödel Colloquium 1997: 114-127
11		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)
10		Bernd Borchert, Riccardo Silvestri: A Characterization of the Leaf Language Classes. Inf. Process. Lett. 63(3): 153-158 (1997)
	1996
9		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)
8		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)
7		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)
6		Bernd Borchert, Frank Stephan: Looking for an Analogue of Rice's Theorem in Complexity Theory Electronic Colloquium on Computational Complexity (ECCC) 3(60): (1996)
5		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
4		Bernd Borchert: On the Acceptance Power of Regular Languages. Theor. Comput. Sci. 148(2): 207-225 (1995)
	1994
3		Bernd Borchert: On the Acceptance Power of Regular Languages. STACS 1994: 533-541
2		Bernd Borchert: Predicate Classes and Promise Classes. Structure in Complexity Theory Conference 1994: 235-241
1		Bernd Borchert: Predicate classes, promise classe, and the acceptance power of regular languages. Universität Heidelberg 1994: I-IV, 1-64

Coauthor Index

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

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page