The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian Hagenah: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Hagenah, Anca Muscholl
    Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:277-285 [Conf]
  2. Volker Diekert, Claudio Gutiérrez, Christian Hagenah
    The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:170-182 [Conf]
  3. Volker Diekert, Claudio Gutiérrez, Christian Hagenah
    The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  4. Volker Diekert, Claudio Gutiérrez, Christian Hagenah
    The existential theory of equations with rational constraints in free groups is PSPACE-complete. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:202, n:2, pp:105-140 [Journal]
  5. Christian Hagenah, Anca Muscholl
    Computing epsilon-free NFA from regular expressions in O(n log2(n)) time. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:4, pp:257-278 [Journal]

Search in 0.002secs, Finished in 0.002secs
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