Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Lorraine Nichols
Tidjani Négadi
Daniel P. Kennedy
Barbara Aquilani
Gaud Catho
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Zhixiang Peng
Chen Ma
Home
/
Author
/
BIRGIT JENNER
Author Info
Open Visualization
Name
Affiliation
Papers
BIRGIT JENNER
TECH UNIV MUNICH,FAK INFORMAT,D-80290 MUNICH,GERMANY
18
Collaborators
Citations
PageRank
11
247
14.47
Referers
Referees
References
237
166
188
Search Limit
100
237
Publications (18 rows)
Collaborators (11 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Corrigendum to “Completeness results for graph isomorphism” [J. Comput. System Sci. 66 (2003) 549–566]
0
0.34
2006
Completeness results for graph isomorphism
27
0.98
2003
A note on the hardness of tree isomorphism
8
0.58
1998
Closure under Complementation of Logspace Complexity Classes - A Survey
0
0.34
1997
Adaptive Logspace Reducibility and Parallel Time
7
0.79
1995
Knapsack problems for NL
13
0.74
1995
A note on logspace optimization
2
0.36
1995
On adaptive DLOGTIME and POLYLOGTIME reductions
1
0.40
1995
Logspace and logtime leaf languages
32
1.17
1994
On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract)
1
0.47
1994
A very hard log-space counting class
46
1.91
1993
Computing functions with parallel queries to NP
31
1.82
1993
Functional oracle queries as a measure of parallel time
7
0.62
1991
Unambiguity and Fewness for Logarithmic Space
26
1.06
1991
A very hard log space counting class
34
1.42
1990
Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata
9
0.59
1989
The Logarithmic Alternation Hierarchy Collapses: A \sum^\calL_2=APi^\calL_2
3
0.55
1989
The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2
0
0.34
1987
1