Birgit Jenner

According to our database, Birgit Jenner authored at least 18 papers between 1987 and 2006.

Collaborative distances:

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

2006

Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566].

Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán

J. Comput. Syst. Sci., 2006

2003

Completeness results for graph isomorphism.

Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán

J. Comput. Syst. Sci., 2003

1998

A Note on the Hardness of Tree Isomorphism.

Birgit Jenner, Pierre McKenzie, Jacobo Torán

Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997

Closure under Complementation of Logspace Complexity Classes - A Survey.

Birgit Jenner

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

1995

On Adaptive DLOGTIME and POLYLOGTIME Reductions.

Carme Àlvarez, Birgit Jenner

Theor. Comput. Sci., 1995

Adaptive Logspace Reducibility and Parallel Time.

Carme Àlvarez, José L. Balcázar, Birgit Jenner

Math. Syst. Theory, 1995

Knapsack Problems for NL.

Birgit Jenner

Inf. Process. Lett., 1995

A Note on Logspace Optimization.

Carme Àlvarez, Birgit Jenner

Comput. Complex., 1995

1994

On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract).

Carme Àlvarez, Birgit Jenner

Proceedings of the STACS 94, 1994

Logspace and Logtime Leaf Languages.

Birgit Jenner, Pierre McKenzie, Denis Thérien

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

Computing Functions with Parallel Queries to NP.

Birgit Jenner, Jacobo Torán

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1991

Functional Oracle Queries as a Measure of Parallel Time.

Carme Àlvarez, José L. Balcázar, Birgit Jenner

Proceedings of the STACS 91, 1991

Unambiguity and Fewness for Logarithmic Space.

Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

A Very Hard Log Space Counting Class.

Carme Àlvarez, Birgit Jenner

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

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

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