The SCEAS System
Navigation Menu

Search the dblp DataBase


Hermann Gruber: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hermann Gruber, Markus Holzer
    Finding Lower Bounds for Nondeterministic State Complexity Is Hard. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:363-374 [Conf]
  2. Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König
    On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:272-283 [Conf]
  3. Hermann Gruber, Markus Holzer
    Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:205-216 [Conf]
  4. Hermann Gruber, Markus Holzer, Martin Kutrib
    More on the Size of Higman-Haines Sets: Effective Constructions. [Citation Graph (0, 0)][DBLP]
    MCU, 2007, pp:193-204 [Conf]
  5. Hermann Gruber, Markus Holzer, Oliver Ruepp
    Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:183-197 [Conf]

  6. Provably Shorter Regular Expressions from Deterministic Finite Automata. [Citation Graph (, )][DBLP]

  7. Tight Bounds on the Descriptional Complexity of Regular Expressions. [Citation Graph (, )][DBLP]

  8. Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. [Citation Graph (, )][DBLP]

  9. Finite Automata, Digraph Connectivity, and Regular Expression Size. [Citation Graph (, )][DBLP]

  10. Short Regular Expressions from Finite Automata: Empirical Results. [Citation Graph (, )][DBLP]

  11. Simplifying Regular Expressions. [Citation Graph (, )][DBLP]

  12. On Measuring Non-Recursive Trade-Offs [Citation Graph (, )][DBLP]

  13. Finding Lower Bounds for Nondeterministic State Complexity is Hard. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002