Travelled to:1 × Ireland
2 × Canada
2 × France
2 × Italy
2 × USA
Collaborated with:P.G.Kolaitis ∅ I.Prívara M.Bauland P.Chapdelaine N.Creignou H.Vollmer A.Durand G.Nordh A.Amaniss D.Lugiez À.J.Gil G.Salzer B.Zanuttini
Talks about:complex (4) algorithm (3) conjunct (2) approach (2) schemat (2) problem (2) general (2) algebra (2) queri (2) trichotomi (1)
Person: Miki Hermann
DBLP: Hermann:Miki
Contributed to:
2009
2004
20042005
19961994
1992
1991
1986
1997Wrote 10 papers:
- LICS-2009-DurandHN #complexity
- Trichotomy in the Complexity of Minimal Inference (AD, MH, GN), pp. 387–396.
- IJCAR-2004-GilHSZ #algorithm #constraints #finite #order #performance #problem
- Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract (ÀJG, MH, GS, BZ), pp. 244–258.
- SAT-2004-BaulandCCHV #algebra #approach #complexity #query
- An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 181–190.
- SAT-J-2004-BaulandCCHV05 #algebra #approach #complexity #query
- An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 30–45.
- CADE-1996-HermannK #algorithm #polynomial #unification
- Unification Algorithms Cannot be Combined in Polynomial Time (MH, PGK), pp. 246–260.
- CADE-1994-HermannK #complexity #equation #problem
- The Complexity of Counting Problems in Equational Matching (MH, PGK), pp. 560–574.
- ALP-1992-Hermann #on the #recursion
- On the Relation Between Primitive Recursion, Schematization and Divergence (MH), pp. 115–127.
- RTA-1991-Hermann #on the #proving
- On Proving Properties of Completion Strategies (MH), pp. 398–410.
- ICALP-1986-HermannP #algorithm #on the
- On Nontermination of Knuth-Bendix Algorithm (MH, IP), pp. 146–156.
- TAPSOFT-1997-AmanissHL #set
- Set Operations for Recurrent Term Schematizations (AA, MH, DL), pp. 333–344.