Miki Hermann
Orcid: 0000-0003-2517-2127Affiliations:
- École Polytechnique, Paris, France
According to our database1,
Miki Hermann
authored at least 46 papers
between 1986 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
2021
Proceedings of the 19th International Symposium on Experimental Algorithms, 2021
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021
2019
2018
2016
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016
Proceedings of the Computer Science - Theory and Applications, 2016
2015
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
2013
2012
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
2010
Eur. J. Comb., 2010
2009
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009
2008
SIAM J. Comput., 2008
Inf. Process. Lett., 2008
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.
Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008
Proceedings of the Formal Concept Analysis, 6th International Conference, 2008
2007
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007
2005
Theor. Comput. Sci., 2005
2004
Theory Comput. Syst., 2004
Proceedings of the Theory and Applications of Satisfiability Testing, 2004
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract.
Proceedings of the Automated Reasoning - Second International Joint Conference, 2004
2003
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
2002
Theor. Comput. Sci., 2002
2000
1999
J. Autom. Reason., 1999
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999
1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
1997
Theor. Comput. Sci., 1997
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997
On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997
1996
1995
Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995
1992
Proceedings of the Algebraic and Logic Programming, 1992
1991
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991
1990
Proceedings of the Conditional and Typed Rewriting Systems, 1990
1986
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986