The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Miki Hermann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Miki Hermann
    On the Relation Between Primitive Recursion, Schematization and Divergence. [Citation Graph (0, 0)][DBLP]
    ALP, 1992, pp:115-127 [Conf]
  2. Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
    Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2004, pp:244-258 [Conf]
  3. Miki Hermann, Phokion G. Kolaitis
    The Complexity of Counting Problems in Equational Matching. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:560-574 [Conf]
  4. Miki Hermann, Phokion G. Kolaitis
    Unification Algorithms Cannot be Combined in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:246-260 [Conf]
  5. Miki Hermann, Phokion G. Kolaitis
    On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. [Citation Graph (0, 0)][DBLP]
    CP, 1997, pp:282-296 [Conf]
  6. Hélène Kirchner, Miki Hermann
    Meta-rule Synthesis from Crossed Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1990, pp:143-154 [Conf]
  7. Miki Hermann, Igor Prívara
    On Nontermination of Knuth-Bendix Algorithm. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:146-156 [Conf]
  8. Miki Hermann, Reinhard Pichler
    Counting Complexity of Propositional Abduction. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:417-422 [Conf]
  9. Miki Hermann, Laurent Juban, Phokion G. Kolaitis
    On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. [Citation Graph (0, 0)][DBLP]
    LPAR, 1999, pp:13-32 [Conf]
  10. Philippe Chapdelaine, Miki Hermann, Ilka Schnoor
    Complexity of Default Logic on Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:58-70 [Conf]
  11. Arnaud Durand, Miki Hermann, Laurent Juban
    On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:92-102 [Conf]
  12. Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
    Subtractive Reductions and Complete Problems for Counting Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:323-332 [Conf]
  13. Miki Hermann, Phokion G. Kolaitis
    Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:359-370 [Conf]
  14. Miki Hermann, Gernot Salzer
    On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:257-266 [Conf]
  15. Miki Hermann
    On Proving Properties of Completion Strategies. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:398-410 [Conf]
  16. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
    An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  17. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
    An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:30-45 [Conf]
  18. Arnaud Durand, Miki Hermann
    The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:451-462 [Conf]
  19. Miki Hermann
    Chain Properties of Rule Closures. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:339-347 [Conf]
  20. Ali Amaniss, Miki Hermann, Denis Lugiez
    Set Operations for Recurrent Term Schematizations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:333-344 [Conf]
  21. Miki Hermann, Claude Kirchner, Hélène Kirchner
    Implementations of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1991, v:34, n:1, pp:20-33 [Journal]
  22. Miki Hermann
    Chain Properties of Rule Closures. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1990, v:2, n:3, pp:207-225 [Journal]
  23. Nadia Creignou, Miki Hermann
    Complexity of Generalized Satisfiability Counting Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:125, n:1, pp:1-12 [Journal]
  24. Miki Hermann, Phokion G. Kolaitis
    Unification Algorithms Cannot Be Combined in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:162, n:1-2, pp:24-42 [Journal]
  25. Miki Hermann, Phokion G. Kolaitis
    Computational Complexity of Simultaneous Elementary Matching Problems. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1999, v:23, n:2, pp:107-136 [Journal]
  26. Miki Hermann, Phokion G. Kolaitis
    The Complexity of Counting Problems in Equational Matching. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:20, n:3, pp:343-362 [Journal]
  27. Georg Gottlob, Miki Hermann, Michaël Rusinowitch
    2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:6, pp:639-640 [Journal]
  28. Arnaud Durand, Miki Hermann, Laurent Juban
    On the complexity of recognizing the Hilbert basis of a linear diophantine system. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:625-642 [Journal]
  29. Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
    Subtractive reductions and complete problems for counting complexity classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:3, pp:496-513 [Journal]
  30. Miki Hermann, Roman Galbavý
    Unification of Infinite Sets of Terms Schematized by Primal Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:176, n:1-2, pp:111-158 [Journal]

  31. Complexity of Existential Positive First-Order Logic. [Citation Graph (, )][DBLP]


  32. Complexity of Counting the Optimal Solutions. [Citation Graph (, )][DBLP]


  33. On the Complexity of Computing Generators of Closed Sets. [Citation Graph (, )][DBLP]


  34. Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. [Citation Graph (, )][DBLP]


  35. Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. [Citation Graph (, )][DBLP]


  36. Trichotomy in the Complexity of Minimal Inference. [Citation Graph (, )][DBLP]


  37. On the Computational Complexity of Monotone Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  38. On Boolean primitive positive clones. [Citation Graph (, )][DBLP]


  39. Complexity of Counting the Optimal Solutions. [Citation Graph (, )][DBLP]


  40. The Helly property and satisfiability of Boolean formulas defined on set families. [Citation Graph (, )][DBLP]


Search in 1.451secs, Finished in 1.454secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002