Birgit Jenner

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from SIGIR 2026 / reviewers in the wild / expert

dblp:j/BirgitJenner · DBLP profile ↗

← Back

16ranked-venue papers

8as first author

0since 2021 · last 2006

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 16 · 8 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

4 papers

Computational complexity · 70% Graph algorithms and graph theory · 30%

Topics — the 4 heaviest of 5, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Graph algorithms and graph theory › graph isomorphism tree isomorphism	1	1998	A Note on the Hardness of Tree Isomorphism · CCC 1998
Computational complexity › space complexity logarithmic space	3	1998	A Note on the Hardness of Tree Isomorphism · CCC 1998 The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L · Inf. Comput. 1989 Logspace and Logtime Leaf Languages · Inf. Comput. 1996
Computational complexity › structural complexity leaf language	1	1996	Logspace and Logtime Leaf Languages · Inf. Comput. 1996
Computational complexity › structural complexity › complexity hierarchies alternation hierarchy	2	1989	The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L · Inf. Comput. 1989 The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2 · ICALP 1987

Methods — techniques the papers use, named apart from their topics

DLOGTIME reductions · 0.0

Year	Publication	Venue	Position
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.	1
2003	Completeness results for graph isomorphism Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán	J. Comput. Syst. Sci.	1
1998	A Note on the Hardness of Tree Isomorphism abstract We prove that the tree isomorphism problem, when trees are encoded as strings, is NC/sup 1/-hard under DLOGTIME-reductions. NC/sup 1/-completeness thus follows from Buss's recent NC/sup 1/ upper bound. By contrast, we prove that testing isomorphism of two trees encoded as pointer lists is L-complete. Birgit Jenner, Pierre McKenzie, Jacobo Torán	CCC	1
1996	Logspace and Logtime Leaf Languages Birgit Jenner, Pierre McKenzie, Denis Thérien	Inf. Comput.	1
1995	A Note on Logspace Optimization Carme Àlvarez, Birgit Jenner	Comput. Complex.	2
1995	Knapsack Problems for NL Birgit Jenner	Inf. Process. Lett.	1
1995	Adaptive Logspace Reducibility and Parallel Time Carme Àlvarez, José L. Balcázar, Birgit Jenner	Math. Syst. Theory	3
1995	On Adaptive DLOGTIME and POLYLOGTIME Reductions Carme Àlvarez, Birgit Jenner	Theor. Comput. Sci.	2
1995	Computing Functions with Parallel Queries to NP Birgit Jenner, Jacobo Torán	Theor. Comput. Sci.	1
1994	On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract) Carme Àlvarez, Birgit Jenner	STACS	2
1993	A Very Hard log-Space Counting Class Carme Àlvarez, Birgit Jenner	Theor. Comput. Sci.	2
1991	Unambiguity and Fewness for Logarithmic Space Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith	FCT	2
1991	Functional Oracle Queries as a Measure of Parallel Time Carme Àlvarez, José L. Balcázar, Birgit Jenner	STACS	3
1989	The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange	Inf. Comput.	1
1988	Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata Birgit Jenner, Bernd Kirsig	STACS	1
1987	The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2 Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig	ICALP	2