| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán |
Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566].  |
J. Comput. Syst. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán |
Completeness results for graph isomorphism. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Pierre McKenzie, Jacobo Torán |
A Note on the Hardness of Tree Isomorphism. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner |
Closure under Complementation of Logspace Complexity Classes - A Survey. |
Foundations of Computer Science: Potential - Theory - Cognition |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Pierre McKenzie, Denis Thérien |
Logspace and Logtime Leaf Languages. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner |
Knapsack Problems for NL. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Jacobo Torán |
Computing Functions with Parallel Queries to NP. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Carme Àlvarez, Birgit Jenner |
On Adaptive DLOGTIME and POLYLOGTIME Reductions. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Carme Àlvarez, Birgit Jenner |
A Note on Logspace Optimization. |
Computational Complexity |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Carme Àlvarez, José L. Balcázar, Birgit Jenner |
Adaptive Logspace Reducibility and Parallel Time. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Carme Àlvarez, Birgit Jenner |
On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract). |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Pierre McKenzie, Denis Thérien |
Logspace and Logtime Leaf Languages. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Carme Àlvarez, Birgit Jenner |
A Very Hard log-Space Counting Class. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Jacobo Torán |
Computing Functions with Parallel Queries to NP. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Carme Àlvarez, José L. Balcázar, Birgit Jenner |
Functional Oracle Queries as a Measure of Parallel Time. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith |
Unambiguity and Fewness for Logarithmic Space. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Carme Àlvarez, Birgit Jenner |
A Very Hard Log Space Counting Class. |
Structure in Complexity Theory Conference |
1990 |
DBLP BibTeX RDF |
|
| 1 | Birgit Jenner, Bernd Kirsig |
Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. |
ITA |
1989 |
DBLP BibTeX RDF |
|
| 1 | Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange |
The Logarithmic Alternation Hierarchy Collapses: A \sum^\calL_2=APi^\calL_2 |
Inf. Comput. |
1989 |
DBLP BibTeX RDF |
|
| 1 | Birgit Jenner, Bernd Kirsig |
Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. |
STACS |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig |
The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2. |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")