The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Hermann Gruber" ( http://dblp.L3S.de/Authors/Hermann_Gruber )

URL (Homepage):  http://www.informatik.uni-giessen.de/staff/gruber/  Author page on DBLP  Author page in RDF  Community of Hermann Gruber in ASPL-2

Publication years (Num. hits)
2005-2009 (19) 2010-2012 (7)
Publication types (Num. hits)
article(10) inproceedings(15) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 26 publication records. Showing 26 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Hermann Gruber, Jonathan Lee, Jeffrey Shallit Enumerating regular expressions and their languages Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Hermann Gruber Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Hermann Gruber Digraph Complexity Measures and Applications in Formal Language Theory Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Hermann Gruber Bounding the feedback vertex number of digraphs in terms of vertex degrees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hermann Gruber On the descriptional and algorithmic complexity of regular languages. Search on Bibsonomy 2010   RDF
1Hermann Gruber On Balanced Separators, Treewidth, and Cycle Rank Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Hermann Gruber, Stefan Gulan Simplifying Regular Expressions. Search on Bibsonomy LATA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Language operations with regular expressions of polynomial size. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Martin Kutrib More on the Size of Higman-Haines Sets: Effective Constructions. Search on Bibsonomy Fundam. Inform. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Martin Kutrib On Measuring Non-Recursive Trade-Offs Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Tight Bounds on the Descriptional Complexity of Regular Expressions. Search on Bibsonomy Developments in Language Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Michael Tautschnig Short Regular Expressions from Finite Automata: Empirical Results. Search on Bibsonomy CIAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Finite Automata, Digraph Connectivity, and Regular Expression Size. Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Provably Shorter Regular Expressions from Deterministic Finite Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Language Operations with Regular Expressions of Polynomial Size. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Hermann Gruber, Jan Johannsen Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. Search on Bibsonomy FoSSaCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Martin Kutrib The size of Higman-Haines sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer On the average state and transition complexity of finite languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Computational Complexity of NFA Minimization for Finite and Unary Languages. Search on Bibsonomy LATA The full citation details ... 2007 DBLP  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Martin Kutrib More on the Size of Higman-Haines Sets: Effective Constructions. Search on Bibsonomy MCU The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Oliver Ruepp Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. Search on Bibsonomy FUN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Finding Lower Bounds for Nondeterministic State Complexity is Hard. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Hermann Gruber, Markus Holzer Finding Lower Bounds for Nondeterministic State Complexity Is Hard. Search on Bibsonomy Developments in Language Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. Search on Bibsonomy Developments in Language Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #26 of 26 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.