On Nontermination of Knuth-Bendix Algorithm. - Miki Hermann; Igor Prívara (ICALP, 1986)

Meta-rule Synthesis from Crossed Rewrite Systems. - Hélène Kirchner; Miki Hermann (CTRS, 1990)

Chain Properties of Rule Closures. - Miki Hermann (Formal Aspects Comput., 1990)

On Proving Properties of Completion Strategies. - Miki Hermann (RTA, 1991)

Implementations of Term Rewriting Systems. - Miki Hermann; Claude Kirchner; Hélène Kirchner (Comput. J., 1991)

On the Relation Between Primitive Recursion, Schematization and Divergence. - Miki Hermann (ALP, 1992)

Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). - Miki Hermann; Phokion G. Kolaitis (MFCS, 1995)

The Complexity of Counting Problems in Equational Matching. - Miki Hermann; Phokion G. Kolaitis (J. Symb. Comput., 1995)

Complexity of Generalized Satisfiability Counting Problems. - Nadia Creignou; Miki Hermann (Inf. Comput., 1996)

On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. - Miki Hermann; Phokion G. Kolaitis (CP, 1997)

Set Operations for Recurrent Term Schematizations. - Ali Amaniss; Miki Hermann; Denis Lugiez (TAPSOFT, 1997)

Unification of Infinite Sets of Terms Schematized by Primal Grammars. - Miki Hermann; Roman Galbavý (Theor. Comput. Sci., 1997)

On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations. - Miki Hermann; Gernot Salzer (MFCS, 1998)

On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. - Miki Hermann; Laurent Juban; Phokion G. Kolaitis (LPAR, 1999)

Computational Complexity of Simultaneous Elementary Matching Problems. - Miki Hermann; Phokion G. Kolaitis (J. Autom. Reason., 1999)

Unification Algorithms Cannot Be Combined in Polynomial Time. - Miki Hermann; Phokion G. Kolaitis (Inf. Comput., 2000)

On the complexity of recognizing the Hilbert basis of a linear diophantine system. - Arnaud Durand 001; Miki Hermann; Laurent Juban (Theor. Comput. Sci., 2002)

The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. - Arnaud Durand 001; Miki Hermann (STACS, 2003)

Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract. - Àngel J. Gil; Miki Hermann; Gernot Salzer; Bruno Zanuttini (IJCAR, 2004)

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. - Michael Bauland; Philippe Chapdelaine; Nadia Creignou; Miki Hermann; Heribert Vollmer (SAT (Selected Papers, 2004)

2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword. - Georg Gottlob; Miki Hermann; Michaël Rusinowitch (Theory Comput. Syst., 2004)

Subtractive reductions and complete problems for counting complexity classes. - Arnaud Durand 001; Miki Hermann; Phokion G. Kolaitis (Theor. Comput. Sci., 2005)

Complexity of Default Logic on Generalized Conjunctive Queries. - Philippe Chapdelaine; Miki Hermann; Ilka Schnoor (LPNMR, 2007)

On the Complexity of Computing Generators of Closed Sets. - Miki Hermann; Baris Sertkaya (ICFCA, 2008)

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. - Victor Chepoi; Nadia Creignou; Miki Hermann; Gernot Salzer (ISMVL, 2008)

Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. - Miki Hermann; Reinhard Pichler (JELIA, 2008)

On Boolean primitive positive clones. - Miki Hermann (Discret. Math., 2008)

On the counting complexity of propositional circumscription. - Arnaud Durand 001; Miki Hermann (Inf. Process. Lett., 2008)

Complexity of Clausal Constraints Over Chains. - Nadia Creignou; Miki Hermann; Andrei A. Krokhin; Gernot Salzer (Theory Comput. Syst., 2008)

Efficient Algorithms for Description Problems over Finite Totally Ordered Domains. - Àngel J. Gil; Miki Hermann; Gernot Salzer; Bruno Zanuttini (SIAM J. Comput., 2008)

Trichotomy in the Complexity of Minimal Inference. - Arnaud Durand 001; Miki Hermann; Gustav Nordh (LICS, 2009)

On the Computational Complexity of Monotone Constraint Satisfaction Problems. - Miki Hermann; Florian Richoux (WALCOM, 2009)

Complexity of counting the optimal solutions. - Miki Hermann; Reinhard Pichler (Theor. Comput. Sci., 2009)

The Helly property and satisfiability of Boolean formulas defined on set families. - Victor Chepoi; Nadia Creignou; Miki Hermann; Gernot Salzer (Eur. J. Comb., 2010)

Counting complexity of propositional abduction. - Miki Hermann; Reinhard Pichler (J. Comput. Syst. Sci., 2010)

Counting Partitions of Graphs. - Pavol Hell; Miki Hermann; Mayssam Mohammadi Nevisi (ISAAC, 2012)

Trichotomies in the Complexity of Minimal Inference. - Arnaud Durand 001; Miki Hermann; Gustav Nordh (Theory Comput. Syst., 2012)

Complexity of existential positive first-order logic. - Manuel Bodirsky; Miki Hermann; Florian Richoux (J. Log. Comput., 2013)

Give Me Another One! - Mike Behrisch; Miki Hermann; Stefan Mengel; Gernot Salzer (ISAAC, 2015)

The Next Whisky Bar. - Mike Behrisch; Miki Hermann; Stefan Mengel; Gernot Salzer (CSR, 2016)

As Close as It Gets. - Mike Behrisch; Miki Hermann; Stefan Mengel; Gernot Salzer (WALCOM, 2016)

On the complexity of generalized chromatic polynomials. - Andrew J. Goodall; Miki Hermann; Tomer Kotek; Johann A. Makowsky; Steven D. Noble (Adv. Appl. Math., 2018)

Minimal Distance of Propositional Models. - Mike Behrisch; Miki Hermann; Stefan Mengel; Gernot Salzer (Theory Comput. Syst., 2019)

MCP: Capturing Big Data by Satisfiability (Tool Description). - Miki Hermann; Gernot Salzer (SAT, 2021)

How to Find the Exit from a 3-Dimensional Maze. - Miki Hermann (SEA, 2021)

Primal Grammars Driven Automated Induction. - Adel Bouhoula; Miki Hermann (IJCAI, 2024)

Efficient Implementation of 2SAT Formula Learning over Finite Totally Ordered Domains. - Miki Hermann; Gernot Salzer (MIWAI (1), 2024)