- CSB - MetaPress - Google - Bing - Yahoo
 | 2006 | |
|---|---|---|
| j11 |      | 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. 72(4): 783 (2006) |
| 2003 | ||
| j10 | | Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán: Completeness results for graph isomorphism. J. Comput. Syst. Sci. 66(3): 549-566 (2003) |
| 1998 | ||
| c10 | | Birgit Jenner, Pierre McKenzie, Jacobo Torán: A Note on the Hardness of Tree Isomorphism. IEEE Conference on Computational Complexity 1998: 101-105 |
| 1997 | ||
| c9 | | Birgit Jenner: Closure under Complementation of Logspace Complexity Classes - A Survey. Foundations of Computer Science: Potential - Theory - Cognition 1997: 163-175 |
| 1996 | ||
| j9 | | Birgit Jenner, Pierre McKenzie, Denis Thérien: Logspace and Logtime Leaf Languages. Inf. Comput. 129(1): 21-33 (1996) |
| 1995 | ||
| j8 | | Carme Àlvarez, Birgit Jenner: A Note on Logspace Optimization. Computational Complexity 5(2): 155-166 (1995) |
| j7 | | |
| j6 | | Carme Àlvarez, José L. Balcázar, Birgit Jenner: Adaptive Logspace Reducibility and Parallel Time. Mathematical Systems Theory 28(2): 117-140 (1995) |
| j5 | | Birgit Jenner, Jacobo Torán: Computing Functions with Parallel Queries to NP. Theor. Comput. Sci. 141(1&2): 175-193 (1995) |
| j4 | | Carme Àlvarez, Birgit Jenner: On Adaptive DLOGTIME and POLYLOGTIME Reductions. Theor. Comput. Sci. 148(2): 183-205 (1995) |
| 1994 | ||
| c8 | | Birgit Jenner, Pierre McKenzie, Denis Thérien: Logspace and Logtime Leaf Languages. Structure in Complexity Theory Conference 1994: 242-254 |
| c7 | | Carme Àlvarez, Birgit Jenner: On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract). STACS 1994: 301-312 |
| 1993 | ||
| j3 | | Carme Àlvarez, Birgit Jenner: A Very Hard log-Space Counting Class. Theor. Comput. Sci. 107(1): 3-30 (1993) |
| c6 | | Birgit Jenner, Jacobo Torán: Computing Functions with Parallel Queries to NP. Structure in Complexity Theory Conference 1993: 280-291 |
| 1991 | ||
| c5 | | Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith: Unambiguity and Fewness for Logarithmic Space. FCT 1991: 168-179 |
| c4 | | Carme Àlvarez, José L. Balcázar, Birgit Jenner: Functional Oracle Queries as a Measure of Parallel Time. STACS 1991: 422-433 |
| 1990 | ||
| c3 | | Carme Àlvarez, Birgit Jenner: A Very Hard Log Space Counting Class. Structure in Complexity Theory Conference 1990: 154-168 |
| 1989 | ||
| j2 |  | 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) |
| j1 | | Birgit Jenner, Bernd Kirsig: Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. ITA 23(1): 87-99 (1989) |
| 1988 | ||
| c2 | | Birgit Jenner, Bernd Kirsig: Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. STACS 1988: 118-125 |
| 1987 | ||
| c1 | | 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 | José L. Balcázar | |
| 2 | Gerhard Buntrock | |
| 3 | Bernd Kirsig | |
| 4 | Johannes Köbler | |
| 5 | Klaus-Jörn Lange | |
| 6 | Pierre McKenzie | |
| 7 | Peter Rossmanith | |
| 8 | Denis Thérien | |
| 9 | Jacobo Torán | |
| 10 | Carme Àlvarez |
Data released under the ODC-BY 1.0 license — See also our legal information page