dblp.uni-trier.dewww.uni-trier.de

Miki Hermann Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
43EEManuel Bodirsky, Miki Hermann, Florian Richoux: Complexity of Existential Positive First-Order Logic. CiE 2009: 31-36
42EEMiki Hermann, Florian Richoux: On the Computational Complexity of Monotone Constraint Satisfaction Problems. WALCOM 2009: 286-297
41EEMiki Hermann, Reinhard Pichler: Complexity of counting the optimal solutions. Theor. Comput. Sci. 410(38-40): 3814-3825 (2009)
2008
40EEMiki Hermann, Reinhard Pichler: Complexity of Counting the Optimal Solutions. COCOON 2008: 149-159
39EEMiki Hermann, Baris Sertkaya: On the Complexity of Computing Generators of Closed Sets. ICFCA 2008: 158-168
38EEVictor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer: Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL 2008: 100-105
37EEMiki Hermann, Reinhard Pichler: Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. JELIA 2008: 206-218
36EEMiki Hermann: On Boolean primitive positive clones. Discrete Mathematics 308(15): 3151-3162 (2008)
35EEMiki Hermann, Reinhard Pichler: Complexity of Counting the Optimal Solutions. Electronic Colloquium on Computational Complexity (ECCC) 15(044): (2008)
34EEArnaud Durand, Miki Hermann: On the counting complexity of propositional circumscription. Inf. Process. Lett. 106(4): 164-170 (2008)
33EEÀ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)
32EENadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer: Complexity of Clausal Constraints Over Chains. Theory Comput. Syst. 42(2): 239-255 (2008)
2007
31EEMiki Hermann, Reinhard Pichler: Counting Complexity of Propositional Abduction. IJCAI 2007: 417-422
30EEPhilippe 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
28EEArnaud Durand, Miki Hermann, Phokion G. Kolaitis: Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3): 496-513 (2005)
2004
27EEÀ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
26EEMichael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004
25EEMichael 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
24EEGeorg 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
23EEArnaud Durand, Miki Hermann: The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. STACS 2003: 451-462
2002
22EEArnaud 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
21EEArnaud 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
19EEMiki Hermann, Laurent Juban, Phokion G. Kolaitis: On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. LPAR 1999: 13-32
18EEArnaud 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
16EEMiki 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
14EEAli Amaniss, Miki Hermann, Denis Lugiez: Set Operations for Recurrent Term Schematizations. TAPSOFT 1997: 333-344
13EEMiki Hermann, Roman Galbavý: Unification of Infinite Sets of Terms Schematized by Primal Grammars. Theor. Comput. Sci. 176(1-2): 111-158 (1997)
1996
12EEMiki 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
10EEMiki 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
8EEMiki Hermann, Phokion G. Kolaitis: The Complexity of Counting Problems in Equational Matching. CADE 1994: 560-574
1992
7EEMiki Hermann: On the Relation Between Primitive Recursion, Schematization and Divergence. ALP 1992: 115-127
1991
6EEMiki 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
2EEMiki Hermann: Chain Properties of Rule Closures. STACS 1989: 339-347
1986
1EEMiki Hermann, Igor Prívara: On Nontermination of Knuth-Bendix Algorithm. ICALP 1986: 146-156

Coauthor Index

1Ali Amaniss [14]
2Michael Bauland [25] [26]
3Manuel Bodirsky [43]
4Philippe Chapdelaine [25] [26] [30]
5Victor Chepoi [38]
6Nadia Creignou [11] [25] [26] [32] [38]
7Arnaud Durand [18] [21] [22] [23] [28] [34]
8Roman Galbavý [13]
9Àngel J. Gil [27] [33]
10Georg Gottlob [24]
11Laurent Juban [18] [19] [22]
12Claude Kirchner [5]
13Hélène Kirchner [4] [5]
14Phokion G. Kolaitis [8] [9] [10] [12] [15] [17] [19] [20] [21] [28]
15Andrei A. Krokhin [32]
16Denis Lugiez [14]
17Reinhard Pichler [31] [35] [37] [40] [41]
18Igor Prívara [1]
19Florian Richoux [42] [43]
20Michaël Rusinowitch [24]
21Gernot Salzer [16] [27] [32] [33] [38]
22Ilka Schnoor [30]
23Baris Sertkaya [39]
24Heribert Vollmer [25] [26]
25Andrei Voronkov [29]
26Bruno Zanuttini [27] [33]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)