default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiki Hermann
Person information
- affiliation: École Polytechnique, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c34]Adel Bouhoula, Miki Hermann:
Primal Grammars Driven Automated Induction. IJCAI 2024: 3259-3269- 2021
- [c33]Miki Hermann, Gernot Salzer
:
MCP: Capturing Big Data by Satisfiability (Tool Description). SAT 2021: 207-215 - [c32]Miki Hermann:
How to Find the Exit from a 3-Dimensional Maze. SEA 2021: 21:1-21:12
2010 – 2019
- 2019
- [j21]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
Minimal Distance of Propositional Models. Theory Comput. Syst. 63(6): 1131-1184 (2019) - 2018
- [j20]Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble:
On the complexity of generalized chromatic polynomials. Adv. Appl. Math. 94: 71-102 (2018) - 2017
- [i4]Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble:
On the complexity of generalized chromatic polynomials. CoRR abs/1701.06639 (2017) - 2016
- [c31]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
The Next Whisky Bar. CSR 2016: 41-56 - [c30]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
As Close as It Gets. WALCOM 2016: 222-235 - 2015
- [c29]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
Give Me Another One! ISAAC 2015: 664-676 - [i3]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
Minimal Distance of Propositional Models. CoRR abs/1502.06761 (2015) - 2013
- [j19]Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of existential positive first-order logic. J. Log. Comput. 23(4): 753-760 (2013) - 2012
- [j18]Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomies in the Complexity of Minimal Inference. Theory Comput. Syst. 50(3): 446-491 (2012) - [c28]Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi:
Counting Partitions of Graphs. ISAAC 2012: 227-236 - 2010
- [j17]Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer:
The Helly property and satisfiability of Boolean formulas defined on set families. Eur. J. Comb. 31(2): 502-516 (2010) - [j16]Miki Hermann, Reinhard Pichler:
Counting complexity of propositional abduction. J. Comput. Syst. Sci. 76(7): 634-649 (2010) - [i2]Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of Existential Positive First-Order Logic. CoRR abs/1011.4757 (2010)
2000 – 2009
- 2009
- [j15]Miki Hermann, Reinhard Pichler:
Complexity of counting the optimal solutions. Theor. Comput. Sci. 410(38-40): 3814-3825 (2009) - [c27]Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of Existential Positive First-Order Logic. CiE 2009: 31-36 - [c26]Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomy in the Complexity of Minimal Inference. LICS 2009: 387-396 - [c25]Miki Hermann, Florian Richoux:
On the Computational Complexity of Monotone Constraint Satisfaction Problems. WALCOM 2009: 286-297 - 2008
- [j14]Miki Hermann:
On Boolean primitive positive clones. Discret. Math. 308(15): 3151-3162 (2008) - [j13]Arnaud Durand, Miki Hermann:
On the counting complexity of propositional circumscription. Inf. Process. Lett. 106(4): 164-170 (2008) - [j12]Nadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer:
Complexity of Clausal Constraints Over Chains. Theory Comput. Syst. 42(2): 239-255 (2008) - [j11]À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) - [c24]Miki Hermann, Reinhard Pichler:
Complexity of Counting the Optimal Solutions. COCOON 2008: 149-159 - [c23]Miki Hermann, Baris Sertkaya:
On the Complexity of Computing Generators of Closed Sets. ICFCA 2008: 158-168 - [c22]Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer:
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL 2008: 100-105 - [c21]Miki Hermann, Reinhard Pichler:
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. JELIA 2008: 206-218 - [i1]Miki Hermann, Reinhard Pichler:
Complexity of Counting the Optimal Solutions. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c20]Miki Hermann, Reinhard Pichler:
Counting Complexity of Propositional Abduction. IJCAI 2007: 417-422 - [c19]Philippe Chapdelaine, Miki Hermann, Ilka Schnoor:
Complexity of Default Logic on Generalized Conjunctive Queries. LPNMR 2007: 58-70 - 2006
- [e1]Miki Hermann, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings. Lecture Notes in Computer Science 4246, Springer 2006, ISBN 3-540-48281-4 [contents] - 2005
- [j10]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
- [j9]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) - [c18]À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 - [c17]Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004 - [c16]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 - 2003
- [c15]Arnaud Durand, Miki Hermann:
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. STACS 2003: 451-462 - 2002
- [j8]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
- [j7]Miki Hermann, Phokion G. Kolaitis:
Unification Algorithms Cannot Be Combined in Polynomial Time. Inf. Comput. 162(1-2): 24-42 (2000) - [c14]Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS 2000: 323-332
1990 – 1999
- 1999
- [j6]Miki Hermann, Phokion G. Kolaitis:
Computational Complexity of Simultaneous Elementary Matching Problems. J. Autom. Reason. 23(2): 107-136 (1999) - [c13]Miki Hermann, Laurent Juban, Phokion G. Kolaitis:
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. LPAR 1999: 13-32 - [c12]Arnaud Durand, Miki Hermann, Laurent Juban:
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. MFCS 1999: 92-102 - 1998
- [c11]Miki Hermann, Gernot Salzer:
On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations. MFCS 1998: 257-266 - 1997
- [j5]Miki Hermann, Roman Galbavý:
Unification of Infinite Sets of Terms Schematized by Primal Grammars. Theor. Comput. Sci. 176(1-2): 111-158 (1997) - [c10]Miki Hermann, Phokion G. Kolaitis:
On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. CP 1997: 282-296 - [c9]Ali Amaniss, Miki Hermann, Denis Lugiez:
Set Operations for Recurrent Term Schematizations. TAPSOFT 1997: 333-344 - 1996
- [j4]Nadia Creignou, Miki Hermann:
Complexity of Generalized Satisfiability Counting Problems. Inf. Comput. 125(1): 1-12 (1996) - [c8]Miki Hermann, Phokion G. Kolaitis:
Unification Algorithms Cannot be Combined in Polynomial Time. CADE 1996: 246-260 - 1995
- [j3]Miki Hermann, Phokion G. Kolaitis:
The Complexity of Counting Problems in Equational Matching. J. Symb. Comput. 20(3): 343-362 (1995) - [c7]Miki Hermann, Phokion G. Kolaitis:
Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). MFCS 1995: 359-370 - 1994
- [c6]Miki Hermann, Phokion G. Kolaitis:
The Complexity of Counting Problems in Equational Matching. CADE 1994: 560-574 - 1992
- [c5]Miki Hermann:
On the Relation Between Primitive Recursion, Schematization and Divergence. ALP 1992: 115-127 - 1991
- [j2]Miki Hermann, Claude Kirchner, Hélène Kirchner:
Implementations of Term Rewriting Systems. Comput. J. 34(1): 20-33 (1991) - [c4]Miki Hermann:
On Proving Properties of Completion Strategies. RTA 1991: 398-410 - 1990
- [j1]Miki Hermann:
Chain Properties of Rule Closures. Formal Aspects Comput. 2(3): 207-225 (1990) - [c3]Hélène Kirchner, Miki Hermann:
Meta-rule Synthesis from Crossed Rewrite Systems. CTRS 1990: 143-154
1980 – 1989
- 1989
- [c2]Miki Hermann:
Chain Properties of Rule Closures. STACS 1989: 339-347 - 1986
- [c1]Miki Hermann, Igor Prívara:
On Nontermination of Knuth-Bendix Algorithm. ICALP 1986: 146-156
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
