The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Birgit Jenner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Birgit Jenner
    Closure under Complementation of Logspace Complexity Classes - A Survey. [Citation Graph (0, 0)][DBLP]
    Foundations of Computer Science: Potential - Theory - Cognition, 1997, pp:163-175 [Conf]
  2. Carme Àlvarez, Birgit Jenner
    A Very Hard Log Space Counting Class. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:154-168 [Conf]
  3. Birgit Jenner, Pierre McKenzie, Denis Thérien
    Logspace and Logtime Leaf Languages. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:242-254 [Conf]
  4. Birgit Jenner, Pierre McKenzie, Jacobo Torán
    A Note on the Hardness of Tree Isomorphism. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:101-105 [Conf]
  5. Birgit Jenner, Jacobo Torán
    Computing Functions with Parallel Queries to NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:280-291 [Conf]
  6. Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith
    Unambiguity and Fewness for Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:168-179 [Conf]
  7. Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig
    The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:531-541 [Conf]
  8. Carme Àlvarez, José L. Balcázar, Birgit Jenner
    Functional Oracle Queries as a Measure of Parallel Time. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:422-433 [Conf]
  9. Carme Àlvarez, Birgit Jenner
    On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:301-312 [Conf]
  10. Birgit Jenner, Bernd Kirsig
    Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:118-125 [Conf]
  11. Carme Àlvarez, Birgit Jenner
    A Note on Logspace Optimization. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:2, pp:155-166 [Journal]
  12. Birgit Jenner, Pierre McKenzie, Denis Thérien
    Logspace and Logtime Leaf Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:129, n:1, pp:21-33 [Journal]
  13. Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange
    The Logarithmic Alternation Hierarchy Collapses: A \sum^\calL_2=APi^\calL_2 [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:80, n:3, pp:269-287 [Journal]
  14. Birgit Jenner
    Knapsack Problems for NL. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:3, pp:169-174 [Journal]
  15. Birgit Jenner, Bernd Kirsig
    Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    ITA, 1989, v:23, n:1, pp:87-99 [Journal]
  16. Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
    Completeness results for graph isomorphism. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:3, pp:549-566 [Journal]
  17. 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]. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:783- [Journal]
  18. Carme Àlvarez, José L. Balcázar, Birgit Jenner
    Adaptive Logspace Reducibility and Parallel Time. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:2, pp:117-140 [Journal]
  19. Carme Àlvarez, Birgit Jenner
    A Very Hard log-Space Counting Class. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:107, n:1, pp:3-30 [Journal]
  20. Carme Àlvarez, Birgit Jenner
    On Adaptive DLOGTIME and POLYLOGTIME Reductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:2, pp:183-205 [Journal]
  21. Birgit Jenner, Jacobo Torán
    Computing Functions with Parallel Queries to NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:175-193 [Journal]

Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002