 | 2009 |
|---|
| 16 |       | Hermann Gruber,
Markus Holzer,
Michael Tautschnig:
Short Regular Expressions from Finite Automata: Empirical Results.
CIAA 2009: 188-197 |
| 15 | | Hermann Gruber,
Markus Holzer:
Tight Bounds on the Descriptional Complexity of Regular Expressions.
Developments in Language Theory 2009: 276-287 |
| 14 | | Hermann Gruber,
Markus Holzer,
Martin Kutrib:
On Measuring Non-Recursive Trade-Offs
CoRR abs/0907.5063: (2009) |
| 13 | | Hermann Gruber,
Markus Holzer,
Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions.
Fundam. Inform. 91(1): 105-121 (2009) |
| 12 | | Hermann Gruber,
Markus Holzer:
Language operations with regular expressions of polynomial size.
Theor. Comput. Sci. 410(35): 3281-3289 (2009) |
| 2008 |
|---|
| 11 | | Hermann Gruber,
Markus Holzer:
Provably Shorter Regular Expressions from Deterministic Finite Automata.
Developments in Language Theory 2008: 383-395 |
| 10 | | Hermann Gruber,
Jan Johannsen:
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity.
FoSSaCS 2008: 273-286 |
| 9 | | Hermann Gruber,
Markus Holzer:
Finite Automata, Digraph Connectivity, and Regular Expression Size.
ICALP (2) 2008: 39-50 |
| 2007 |
|---|
| 8 | | Hermann Gruber,
Markus Holzer:
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP.
Developments in Language Theory 2007: 205-216 |
| 7 | | Hermann Gruber,
Markus Holzer,
Oliver Ruepp:
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms.
FUN 2007: 183-197 |
| 6 | | Hermann Gruber,
Markus Holzer,
Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions.
MCU 2007: 193-204 |
| 5 | | Hermann Gruber,
Markus Holzer:
On the average state and transition complexity of finite languages.
Theor. Comput. Sci. 387(2): 155-166 (2007) |
| 4 | | Hermann Gruber,
Markus Holzer,
Martin Kutrib:
The size of Higman-Haines sets.
Theor. Comput. Sci. 387(2): 167-176 (2007) |
| 2006 |
|---|
| 3 | | Hermann Gruber,
Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity Is Hard.
Developments in Language Theory 2006: 363-374 |
| 2 | | Hermann Gruber,
Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity is Hard.
Electronic Colloquium on Computational Complexity (ECCC) 13(027): (2006) |
| 2005 |
|---|
| 1 | | 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 |
