default search action
Birgit Jenner
Person information
- affiliation: University of Ulm, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 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)
1990 – 1999
- 1998
- [c10]Birgit Jenner, Pierre McKenzie, Jacobo Torán:
A Note on the Hardness of Tree Isomorphism. CCC 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. Comput. Complex. 5(2): 155-166 (1995) - [j7]Birgit Jenner:
Knapsack Problems for NL. Inf. Process. Lett. 54(3): 169-174 (1995) - [j6]Carme Àlvarez, José L. Balcázar, Birgit Jenner:
Adaptive Logspace Reducibility and Parallel Time. Math. Syst. 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. SCT 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. SCT 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. SCT 1990: 154-168
1980 – 1989
- 1989
- [b1]Birgit Jenner, Bernd Kirsig:
Alternierung und logarithmischer Platz. University of Hamburg, Germany, 1989, pp. 1-155 - [j2]Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange:
The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L. Inf. Comput. 80(3): 269-287 (1989) - [j1]Birgit Jenner, Bernd Kirsig:
Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. RAIRO Theor. Informatics Appl. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: