| Finite automata, digraph connectivity, and regular expression size H Gruber, M Holzer International Colloquium on Automata, Languages, and Programming, 39-50, 2008 | 100 | 2008 |
| Finding lower bounds for nondeterministic state complexity is hard H Gruber, M Holzer Developments in Language Theory: 10th International Conference, DLT 2006 …, 2006 | 59 | 2006 |
| Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP H Gruber, M Holzer International Conference on Developments in Language Theory, 205-216, 2007 | 57 | 2007 |
| Optimal lower bounds on regular expression size using communication complexity H Gruber, J Johannsen Foundations of Software Science and Computational Structures: 11th …, 2008 | 52 | 2008 |
| Digraph complexity measures and applications in formal language theory H Gruber Discrete Mathematics & Theoretical Computer Science 14 (Automata, Logic and …, 2012 | 38 | 2012 |
| From finite automata to regular expressions and back—a summary on descriptional complexity H Gruber, M Holzer International Journal of Foundations of Computer Science 26 (08), 1009-1040, 2015 | 35 | 2015 |
| Computational Complexity of NFA Minimization for Finite and Unary Languages. H Gruber, M Holzer LATA 8, 261-272, 2007 | 34 | 2007 |
| Tight bounds on the descriptional complexity of regular expressions H Gruber, M Holzer International Conference on Developments in Language Theory, 276-287, 2009 | 33 | 2009 |
| Provably shorter regular expressions from deterministic finite automata H Gruber, M Holzer Developments in Language Theory: 12th International Conference, DLT 2008 …, 2008 | 32 | 2008 |
| Language operations with regular expressions of polynomial size H Gruber, M Holzer Theoretical computer science 410 (35), 3281-3289, 2009 | 30 | 2009 |
| More on the size of Higman-Haines sets: effective constructions H Gruber, M Holzer, M Kutrib Fundamenta Informaticae 91 (1), 105-121, 2009 | 29 | 2009 |
| The size of Higman–Haines sets H Gruber, M Holzer, M Kutrib Theoretical Computer Science 387 (2), 167-176, 2007 | 28 | 2007 |
| On the average state and transition complexity of finite languages H Gruber, M Holzer Theoretical computer science 387 (2), 155-166, 2007 | 22 | 2007 |
| Simplifying regular expressions: a quantitative perspective H Gruber, S Gulan International Conference on Language and Automata Theory and Applications …, 2010 | 19 | 2010 |
| Sorting the slow way: an analysis of perversely awful randomized sorting algorithms H Gruber, M Holzer, O Ruepp International Conference on Fun with Algorithms, 183-197, 2007 | 17 | 2007 |
| Short regular expressions from finite automata: Empirical results H Gruber, M Holzer, M Tautschnig Implementation and Application of Automata: 14th International Conference …, 2009 | 14 | 2009 |
| Enumerating regular expressions and their languages H Gruber, J Lee, J Shallit arXiv preprint arXiv:1204.4982, 2012 | 13 | 2012 |
| Estimates for the minimal crossing number H Gruber arXiv preprint math/0303273, 2003 | 11 | 2003 |
| On balanced separators, treewidth, and cycle rank H Gruber arXiv preprint arXiv:1012.1344, 2010 | 10 | 2010 |
| Simplifying regular expressions: A quantitative perspective H Gruber, S Gulan | 10 | 2009 |
Markus HolzerProfessor für Informatik, Universität GiessenVerified email at in.tum.de
