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

Birgit Jenner University of Ulm, Germany http://theorie.informatik.uni-ulm.de/Personen/bj.html

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]. 783 2006 72 J. Comput. Syst. Sci. 4 db/journals/jcss/jcss72.html#JennerKMT06 https://doi.org/10.1016/j.jcss.2005.11.002

Birgit Jenner Johannes Köbler Pierre McKenzie Jacobo Torán Completeness results for graph isomorphism. 549-566 2003 66 J. Comput. Syst. Sci. 3 https://doi.org/10.1016/S0022-0000(03)00042-4 db/journals/jcss/jcss66.html#JennerKMT03

Birgit Jenner Pierre McKenzie Jacobo Torán A Note on the Hardness of Tree Isomorphism. 101-105 1998 conf/coco/1998 CCC https://doi.org/10.1109/CCC.1998.694595 https://doi.ieeecomputersociety.org/10.1109/CCC.1998.694595 db/conf/coco/coco1998.html#JennerMT98 Birgit Jenner Closure under Complementation of Logspace Complexity Classes - A Survey. 163-175 https://doi.org/10.1007/BFb0052085 1997 conf/birthday/1997brauer Foundations of Computer Science: Potential - Theory - Cognition db/conf/birthday/brauer97.html#Jenner97

Birgit Jenner Pierre McKenzie Denis Thérien Logspace and Logtime Leaf Languages. 21-33 1996 129 Inf. Comput. 1 db/journals/iandc/iandc129.html#JennerMT96 https://doi.org/10.1006/inco.1996.0071

Carme Àlvarez Birgit Jenner A Note on Logspace Optimization. 155-166 1995 5 Comput. Complex. 2 db/journals/cc/cc5.html#AlvarezJ95 https://doi.org/10.1007/BF01268143

Birgit Jenner Knapsack Problems for NL. 169-174 1995 54 Inf. Process. Lett. 3 db/journals/ipl/ipl54.html#Jenner95 https://doi.org/10.1016/0020-0190(95)00017-7

Carme Àlvarez José L. Balcázar Birgit Jenner Adaptive Logspace Reducibility and Parallel Time. 117-140 1995 28 2 Math. Syst. Theory db/journals/mst/mst28.html#AlvarezBJ95 https://doi.org/10.1007/BF01191473

Birgit Jenner Jacobo Torán Computing Functions with Parallel Queries to NP. 175-193 1995 141 Theor. Comput. Sci. 1&2 db/journals/tcs/tcs141.html#JennerT95 https://doi.org/10.1016/0304-3975(94)00080-3

Carme Àlvarez Birgit Jenner On Adaptive DLOGTIME and POLYLOGTIME Reductions. 183-205 1995 148 Theor. Comput. Sci. 2 db/journals/tcs/tcs148.html#AlvarezJ95 https://doi.org/10.1016/0304-3975(95)00033-S

Birgit Jenner Pierre McKenzie Denis Thérien Logspace and Logtime Leaf Languages. 242-254 1994 conf/coco/1994 SCT db/conf/coco/coco94.html#JennerMT94 https://doi.org/10.1109/SCT.1994.315799 https://doi.ieeecomputersociety.org/10.1109/SCT.1994.315799 Carme Àlvarez Birgit Jenner On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract). 301-312 1994 conf/stacs/1994 STACS db/conf/stacs/stacs94.html#AlvarezJ94 https://doi.org/10.1007/3-540-57785-8_150

Carme Àlvarez Birgit Jenner A Very Hard log-Space Counting Class. 3-30 1993 107 Theor. Comput. Sci. 1 db/journals/tcs/tcs107.html#AlvarezJ93 https://doi.org/10.1016/0304-3975(93)90252-O

Birgit Jenner Jacobo Torán Computing Functions with Parallel Queries to NP. 280-291 1993 conf/coco/1993 SCT db/conf/coco/coco93.html#JennerT93 https://doi.org/10.1109/SCT.1993.336519 https://doi.ieeecomputersociety.org/10.1109/SCT.1993.336519 Gerhard Buntrock Birgit Jenner Klaus-Jörn Lange Peter Rossmanith Unambiguity and Fewness for Logarithmic Space. 168-179 1991 conf/fct/1991 FCT db/conf/fct/fct91.html#BuntrockJLR91 https://doi.org/10.1007/3-540-54458-5_61 Carme Àlvarez José L. Balcázar Birgit Jenner Functional Oracle Queries as a Measure of Parallel Time. 422-433 1991 conf/stacs/1991 STACS db/conf/stacs/stacs91.html#AlvarezBJ91 https://doi.org/10.1007/BFb0020817 https://www.wikidata.org/entity/Q56458687 Carme Àlvarez Birgit Jenner A Very Hard Log Space Counting Class. 154-168 1990 conf/coco/1990 SCT db/conf/coco/coco90.html#AlvarezJ90 https://doi.org/10.1109/SCT.1990.113964 https://doi.ieeecomputersociety.org/10.1109/SCT.1990.113964 Birgit Jenner Bernd Kirsig Alternierung und logarithmischer Platz. 1989 1-155 University of Hamburg, Germany https://d-nb.info/900108371

Birgit Jenner Bernd Kirsig Klaus-Jörn Lange The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L. 269-287 Inf. Comput. March 1989 80 3 db/journals/iandc/iandc80.html#LangeJK89 https://doi.org/10.1016/0890-5401(89)90012-6

Birgit Jenner Bernd Kirsig Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. 87-99 1989 23 RAIRO Theor. Informatics Appl. 1 db/journals/ita/ita23.html#JennerK89 https://doi.org/10.1051/ita/1989230100871

Birgit Jenner Bernd Kirsig Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. 118-125 1988 conf/stacs/1988 STACS db/conf/stacs/stacs88.html#JennerK88 https://doi.org/10.1007/BFb0035838 Klaus-Jörn Lange Birgit Jenner Bernd Kirsig The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2. 531-541 1987 conf/icalp/1987 ICALP db/conf/icalp/icalp87.html#LangeJK87 https://doi.org/10.1007/3-540-18088-5_46 Carme Àlvarez José L. Balcázar Gerhard Buntrock Bernd Kirsig Johannes Köbler Klaus-Jörn Lange Pierre McKenzie Peter Rossmanith Denis Thérien Jacobo Torán