Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Hermann Gruber
2010 – today
- 2012
[j7]Hermann Gruber: Digraph Complexity Measures and Applications in Formal Language Theory. Discrete Mathematics & Theoretical Computer Science 14(2): 189-204 (2012)- [i5]Hermann Gruber, Jonathan Lee, Jeffrey Shallit: Enumerating regular expressions and their languages. CoRR abs/1204.4982 (2012)
- 2011
- [j6]Hermann Gruber: Bounding the feedback vertex number of digraphs in terms of vertex degrees. Discrete Applied Mathematics 159(8): 872-875 (2011)
- [i4]Hermann Gruber: Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees. CoRR abs/1101.1291 (2011)
- [i3]Hermann Gruber: Digraph Complexity Measures and Applications in Formal Language Theory. CoRR abs/1111.5357 (2011)
- 2010
- [b1]Hermann Gruber: On the descriptional and algorithmic complexity of regular languages. Justus Liebig University Giessen 2010, ISBN 978-3-938363-62-1, pp. 1-174
- [j5]Hermann Gruber, Markus Holzer, Martin Kutrib: On Measuring Non-recursive Trade-Offs. Journal of Automata, Languages and Combinatorics 15(1/2): 107-120 (2010)
- [c15]
- [i2]
2000 – 2009
- 2009
- [j4]Hermann Gruber, Markus Holzer, Martin Kutrib: More on the Size of Higman-Haines Sets: Effective Constructions. Fundam. Inform. 91(1): 105-121 (2009)
- [j3]Hermann Gruber, Markus Holzer: Language operations with regular expressions of polynomial size. Theor. Comput. Sci. 410(35): 3281-3289 (2009)
- [c14]Hermann Gruber, Markus Holzer: Tight Bounds on the Descriptional Complexity of Regular Expressions. Developments in Language Theory 2009: 276-287
- [c13]Hermann Gruber, Markus Holzer, Michael Tautschnig: Short Regular Expressions from Finite Automata: Empirical Results. CIAA 2009: 188-197
- [c12]Hermann Gruber, Markus Holzer, Martin Kutrib: On Measuring Non-Recursive Trade-Offs. DCFS 2009: 141-150
- 2008
- [c11]Hermann Gruber, Markus Holzer: Language Operations with Regular Expressions of Polynomial Size. DCFS 2008: 182-193
- [c10]Hermann Gruber, Markus Holzer: Provably Shorter Regular Expressions from Deterministic Finite Automata. Developments in Language Theory 2008: 383-395
- [c9]Hermann Gruber, Jan Johannsen: Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. FoSSaCS 2008: 273-286
- [c8]Hermann Gruber, Markus Holzer: Finite Automata, Digraph Connectivity, and Regular Expression Size. ICALP (2) 2008: 39-50
- 2007
- [j2]Hermann Gruber, Markus Holzer: On the average state and transition complexity of finite languages. Theor. Comput. Sci. 387(2): 155-166 (2007)
- [j1]Hermann Gruber, Markus Holzer, Martin Kutrib: The size of Higman-Haines sets. Theor. Comput. Sci. 387(2): 167-176 (2007)
- [c7]Hermann Gruber, Markus Holzer: Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. Developments in Language Theory 2007: 205-216
- [c6]Hermann Gruber, Markus Holzer, Oliver Ruepp: Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. FUN 2007: 183-197
- [c5]Hermann Gruber, Markus Holzer: Computational Complexity of NFA Minimization for Finite and Unary Languages. LATA 2007: 261-272
- [c4]Hermann Gruber, Markus Holzer, Martin Kutrib: More on the Size of Higman-Haines Sets: Effective Constructions. MCU 2007: 193-204
- 2006
- [c3]Hermann Gruber, Markus Holzer: Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). DCFS 2006: 267-275
- [c2]Hermann Gruber, Markus Holzer: Finding Lower Bounds for Nondeterministic State Complexity Is Hard. Developments in Language Theory 2006: 363-374
- [i1]Hermann Gruber, Markus Holzer: Finding Lower Bounds for Nondeterministic State Complexity is Hard. Electronic Colloquium on Computational Complexity (ECCC) 13(027) (2006)
- 2005
- [c1]Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König: On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. Developments in Language Theory 2005: 272-283
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:32 CET by the dblp team