Miki Hermann

729 total citations
24 papers, 251 citations indexed

About

Miki Hermann is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Miki Hermann has authored 24 papers receiving a total of 251 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 15 papers in Artificial Intelligence and 4 papers in Computer Networks and Communications. Recurrent topics in Miki Hermann's work include Logic, Reasoning, and Knowledge (11 papers), semigroups and automata theory (8 papers) and Advanced Algebra and Logic (6 papers). Miki Hermann is often cited by papers focused on Logic, Reasoning, and Knowledge (11 papers), semigroups and automata theory (8 papers) and Advanced Algebra and Logic (6 papers). Miki Hermann collaborates with scholars based in France, Austria and United States. Miki Hermann's co-authors include Nadia Creignou, Arnaud Durand, Phokion G. Kolaitis, Ulf Schlichtmann, F. Brglez, Reinhard Pichler, Gernot Salzer, Andrei Krokhin, Андрей Воронков and Andrew Goodall and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Miki Hermann

24 papers receiving 231 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Miki Hermann France	7	185	126	63	31	23	24	251
Thomas Dueholm Hansen Denmark	7	108 0.6×	94 0.7×	40 0.6×	12 0.4×	8 0.3×	21	187
Markus Frick United Kingdom	6	318 1.7×	149 1.2×	128 2.0×	5 0.2×	7 0.3×	6	398
Amir M. Ben-Amram Israel	10	326 1.8×	329 2.6×	52 0.8×	8 0.3×	57 2.5×	39	419
Leen Torenvliet Netherlands	10	208 1.1×	162 1.3×	35 0.6×	11 0.4×	3 0.1×	39	252
Gudmund Skovbjerg Frandsen Denmark	9	118 0.6×	124 1.0×	25 0.4×	7 0.2×	8 0.3×	38	187
Jonathan F. Buss Canada	8	215 1.2×	96 0.8×	98 1.6×	7 0.2×	23 1.0×	20	314
B. A. Trakhtenbrot Israel	7	266 1.4×	239 1.9×	55 0.9×	5 0.2×	27 1.2×	17	382
Tian Sang United States	4	52 0.3×	189 1.5×	62 1.0×	13 0.4×	7 0.3×	5	216
Richard Schroeppel United States	7	68 0.4×	149 1.2×	78 1.2×	3 0.1×	19 0.8×	11	241
Monika Rauch United States	6	134 0.7×	54 0.4×	114 1.8×	3 0.1×	12 0.5×	9	202

Countries citing papers authored by Miki Hermann

Since Specialization

Citations

This map shows the geographic impact of Miki Hermann's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Miki Hermann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Miki Hermann more than expected).

Fields of papers citing papers by Miki Hermann

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Miki Hermann. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Miki Hermann. The network helps show where Miki Hermann may publish in the future.

Co-authorship network of co-authors of Miki Hermann

This figure shows the co-authorship network connecting the top 25 collaborators of Miki Hermann. A scholar is included among the top collaborators of Miki Hermann based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Miki Hermann. Miki Hermann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Hermann, Miki, et al.. (2018). Minimal Distance of Propositional Models. Theory of Computing Systems. 63(6). 1131–1184. 3 indexed citations

Goodall, Andrew, et al.. (2017). On the complexity of generalized chromatic polynomials. Advances in Applied Mathematics. 94. 71–102. 2 indexed citations

Durand, Arnaud, et al.. (2011). Trichotomies in the Complexity of Minimal Inference. Theory of Computing Systems. 50(3). 446–491. 1 indexed citations

Hermann, Miki & Reinhard Pichler. (2009). Counting complexity of propositional abduction. Journal of Computer and System Sciences. 76(7). 634–649. 7 indexed citations

Chepoi, Victor, Nadia Creignou, Miki Hermann, & Gernot Salzer. (2009). The Helly property and satisfiability of Boolean formulas defined on set families. European Journal of Combinatorics. 31(2). 502–516. 1 indexed citations

Durand, Arnaud, et al.. (2009). Trichotomy in the Complexity of Minimal Inference. 5. 387–396. 3 indexed citations

Hermann, Miki & Reinhard Pichler. (2007). Counting complexity of propositional abduction. International Joint Conference on Artificial Intelligence. 417–422. 7 indexed citations

Hermann, Miki. (2007). On Boolean primitive positive clones. Discrete Mathematics. 308(15). 3151–3162. 6 indexed citations

Durand, Arnaud & Miki Hermann. (2007). On the counting complexity of propositional circumscription. Information Processing Letters. 106(4). 164–170. 6 indexed citations

10.

Hermann, Miki & Андрей Воронков. (2006). Logic for Programming, Artificial Intelligence, and Reasoning. Lecture notes in computer science. 2 indexed citations

11.

Schlichtmann, Ulf, F. Brglez, & Miki Hermann. (2003). Characterization of Boolean functions for rapid matching in EPGA technology mapping. 374–379. 3 indexed citations

12.

Hermann, Miki, Ulf Schlichtmann, & K. Antreich. (2002). Fast technology mapping for multiplexor-based architecture with area/delay tradeoff. 300–304. 1 indexed citations

13.

Durand, Arnaud, et al.. (2002). On the complexity of recognizing the Hilbert basis of a linear diophantine system. Theoretical Computer Science. 270(1-2). 625–642. 2 indexed citations

14.

Durand, Arnaud, Miki Hermann, & Phokion G. Kolaitis. (2000). Subtractive reductions and complete problems for counting complexity classes. 340(3). 323–332. 36 indexed citations

15.

Hermann, Miki & Phokion G. Kolaitis. (1999). Computational Complexity of Simultaneous Elementary Matching Problems. Journal of Automated Reasoning. 23(2). 107–136. 2 indexed citations

16.

Hermann, Miki, et al.. (1997). Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science. 176(1-2). 111–158. 9 indexed citations

17.

Creignou, Nadia & Miki Hermann. (1996). Complexity of Generalized Satisfiability Counting Problems. Information and Computation. 125(1). 1–12. 106 indexed citations

18.

Hermann, Miki & Phokion G. Kolaitis. (1995). The Complexity of Counting Problems in Equational Matching. Journal of Symbolic Computation. 20(3). 343–362. 5 indexed citations

19.

Hermann, Miki. (1991). Implementations of Term Rewriting Systems. The Computer Journal. 34(1). 20–33. 5 indexed citations

20.

Hermann, Miki. (1990). Chain properties of rule closures. Formal Aspects of Computing. 2(1). 207–225. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact