Bernd Kirsig

	1997
6		Bernd Kirsig: A Relation Between Sparse and Printable Sets in NSPACE(log n). Foundations of Computer Science: Potential - Theory - Cognition 1997: 177-184
	1989
5		Birgit Jenner, Bernd Kirsig: Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. ITA 23(1): 87-99 (1989)
4		Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange: The Logarithmic Alternation Hierarchy Collapses: A \sum^\calL_2=APi^\calL_2 Inf. Comput. 80(3): 269-287 (1989)
	1988
3		Birgit Jenner, Bernd Kirsig: Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. STACS 1988: 118-125
	1987
2		Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig: The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2. ICALP 1987: 531-541
1		Bernd Kirsig, Klaus-Jörn Lange: Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n). Inf. Process. Lett. 25(1): 13-15 (1987)

Coauthor Index

1	Birgit Jenner	[2] [3] [4] [5]
2	Klaus-Jörn Lange	[1] [2] [4]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page