| 2009 |
|---|
| 41 | EE | Miki Hermann,
Florian Richoux:
On the Computational Complexity of Monotone Constraint Satisfaction Problems.
WALCOM 2009: 286-297 |
| 2008 |
|---|
| 40 | EE | Miki Hermann,
Reinhard Pichler:
Complexity of Counting the Optimal Solutions.
COCOON 2008: 149-159 |
| 39 | EE | Miki Hermann,
Baris Sertkaya:
On the Complexity of Computing Generators of Closed Sets.
ICFCA 2008: 158-168 |
| 38 | EE | Victor Chepoi,
Nadia Creignou,
Miki Hermann,
Gernot Salzer:
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.
ISMVL 2008: 100-105 |
| 37 | EE | Miki Hermann,
Reinhard Pichler:
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction.
JELIA 2008: 206-218 |
| 36 | EE | Miki Hermann:
On Boolean primitive positive clones.
Discrete Mathematics 308(15): 3151-3162 (2008) |
| 35 | EE | Miki Hermann,
Reinhard Pichler:
Complexity of Counting the Optimal Solutions.
Electronic Colloquium on Computational Complexity (ECCC) 15(044): (2008) |
| 34 | EE | Arnaud Durand,
Miki Hermann:
On the counting complexity of propositional circumscription.
Inf. Process. Lett. 106(4): 164-170 (2008) |
| 33 | EE | Àngel J. Gil,
Miki Hermann,
Gernot Salzer,
Bruno Zanuttini:
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains.
SIAM J. Comput. 38(3): 922-945 (2008) |
| 32 | EE | Nadia Creignou,
Miki Hermann,
Andrei A. Krokhin,
Gernot Salzer:
Complexity of Clausal Constraints Over Chains.
Theory Comput. Syst. 42(2): 239-255 (2008) |
| 2007 |
|---|
| 31 | EE | Miki Hermann,
Reinhard Pichler:
Counting Complexity of Propositional Abduction.
IJCAI 2007: 417-422 |
| 30 | EE | Philippe Chapdelaine,
Miki Hermann,
Ilka Schnoor:
Complexity of Default Logic on Generalized Conjunctive Queries.
LPNMR 2007: 58-70 |
| 2006 |
|---|
| 29 | | Miki Hermann,
Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings
Springer 2006 |
| 2005 |
|---|
| 28 | EE | Arnaud Durand,
Miki Hermann,
Phokion G. Kolaitis:
Subtractive reductions and complete problems for counting complexity classes.
Theor. Comput. Sci. 340(3): 496-513 (2005) |
| 2004 |
|---|
| 27 | EE | Àngel J. Gil,
Miki Hermann,
Gernot Salzer,
Bruno Zanuttini:
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract.
IJCAR 2004: 244-258 |
| 26 | EE | Michael Bauland,
Philippe Chapdelaine,
Nadia Creignou,
Miki Hermann,
Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT 2004 |
| 25 | EE | Michael Bauland,
Philippe Chapdelaine,
Nadia Creignou,
Miki Hermann,
Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT (Selected Papers 2004: 30-45 |
| 24 | EE | Georg Gottlob,
Miki Hermann,
Michaël Rusinowitch:
2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword.
Theory Comput. Syst. 37(6): 639-640 (2004) |
| 2003 |
|---|
| 23 | EE | Arnaud Durand,
Miki Hermann:
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete.
STACS 2003: 451-462 |
| 2002 |
|---|
| 22 | EE | Arnaud Durand,
Miki Hermann,
Laurent Juban:
On the complexity of recognizing the Hilbert basis of a linear diophantine system.
Theor. Comput. Sci. 270(1-2): 625-642 (2002) |
| 2000 |
|---|
| 21 | EE | Arnaud Durand,
Miki Hermann,
Phokion G. Kolaitis:
Subtractive Reductions and Complete Problems for Counting Complexity Classes.
MFCS 2000: 323-332 |
| 20 | | Miki Hermann,
Phokion G. Kolaitis:
Unification Algorithms Cannot Be Combined in Polynomial Time.
Inf. Comput. 162(1-2): 24-42 (2000) |
| 1999 |
|---|
| 19 | | Miki Hermann,
Laurent Juban,
Phokion G. Kolaitis:
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System.
LPAR 1999: 13-32 |
| 18 | | Arnaud Durand,
Miki Hermann,
Laurent Juban:
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System.
MFCS 1999: 92-102 |
| 17 | | Miki Hermann,
Phokion G. Kolaitis:
Computational Complexity of Simultaneous Elementary Matching Problems.
J. Autom. Reasoning 23(2): 107-136 (1999) |
| 1998 |
|---|
| 16 | EE | Miki Hermann,
Gernot Salzer:
On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations.
MFCS 1998: 257-266 |
| 1997 |
|---|
| 15 | | Miki Hermann,
Phokion G. Kolaitis:
On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups.
CP 1997: 282-296 |
| 14 | | Ali Amaniss,
Miki Hermann,
Denis Lugiez:
Set Operations for Recurrent Term Schematizations.
TAPSOFT 1997: 333-344 |
| 13 | EE | Miki Hermann,
Roman Galbavý:
Unification of Infinite Sets of Terms Schematized by Primal Grammars.
Theor. Comput. Sci. 176(1-2): 111-158 (1997) |
| 1996 |
|---|
| 12 | | Miki Hermann,
Phokion G. Kolaitis:
Unification Algorithms Cannot be Combined in Polynomial Time.
CADE 1996: 246-260 |
| 11 | | Nadia Creignou,
Miki Hermann:
Complexity of Generalized Satisfiability Counting Problems.
Inf. Comput. 125(1): 1-12 (1996) |
| 1995 |
|---|
| 10 | | Miki Hermann,
Phokion G. Kolaitis:
Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract).
MFCS 1995: 359-370 |
| 9 | | Miki Hermann,
Phokion G. Kolaitis:
The Complexity of Counting Problems in Equational Matching.
J. Symb. Comput. 20(3): 343-362 (1995) |
| 1994 |
|---|
| 8 | | Miki Hermann,
Phokion G. Kolaitis:
The Complexity of Counting Problems in Equational Matching.
CADE 1994: 560-574 |
| 1992 |
|---|
| 7 | | Miki Hermann:
On the Relation Between Primitive Recursion, Schematization and Divergence.
ALP 1992: 115-127 |
| 1991 |
|---|
| 6 | | Miki Hermann:
On Proving Properties of Completion Strategies.
RTA 1991: 398-410 |
| 5 | | Miki Hermann,
Claude Kirchner,
Hélène Kirchner:
Implementations of Term Rewriting Systems.
Comput. J. 34(1): 20-33 (1991) |
| 1990 |
|---|
| 4 | | Hélène Kirchner,
Miki Hermann:
Meta-rule Synthesis from Crossed Rewrite Systems.
CTRS 1990: 143-154 |
| 3 | | Miki Hermann:
Chain Properties of Rule Closures.
Formal Asp. Comput. 2(3): 207-225 (1990) |
| 1989 |
|---|
| 2 | | Miki Hermann:
Chain Properties of Rule Closures.
STACS 1989: 339-347 |
| 1986 |
|---|
| 1 | | Miki Hermann,
Igor Prívara:
On Nontermination of Knuth-Bendix Algorithm.
ICALP 1986: 146-156 |
