Bernd Kirsig

According to our database, Bernd Kirsig authored at least 6 papers between 1987 and 1997.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1997

A Relation Between Sparse and Printable Sets in NSPACE(log n).

Bernd Kirsig

Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1989

The Logarithmic Alternation Hierarchy Collapses: A∑₂^L = A∏₂^L.

Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange

Inf. Comput., March, 1989

Alternierung und logarithmischer Platz.

Birgit Jenner, Bernd Kirsig

PhD thesis, 1989

1988

Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata.

Birgit Jenner, Bernd Kirsig

Proceedings of the STACS 88, 1988

1987

Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n).

Bernd Kirsig, Klaus-Jörn Lange

Inf. Process. Lett., 1987

The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2.

Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987