Hubert Comon

3.2k total citations
33 papers, 483 citations indexed

About

Hubert Comon is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Hubert Comon has authored 33 papers receiving a total of 483 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Artificial Intelligence, 22 papers in Computational Theory and Mathematics and 6 papers in Computer Networks and Communications. Recurrent topics in Hubert Comon's work include Logic, programming, and type systems (24 papers), semigroups and automata theory (11 papers) and Logic, Reasoning, and Knowledge (10 papers). Hubert Comon is often cited by papers focused on Logic, programming, and type systems (24 papers), semigroups and automata theory (11 papers) and Logic, Reasoning, and Knowledge (10 papers). Hubert Comon collaborates with scholars based in France, Spain and United States. Hubert Comon's co-authors include Pierre Lescanne, Vitaly Shmatikov, Robert Nieuwenhuis, Alain Finkel, Gérard Berry, Véronique Cortier, Florent Jacquemard, Jean-Pierre Jouannaud, Ralf Treinen and Paliath Narendran and has published in prestigious journals such as Theoretical Computer Science, Lecture notes in computer science and Information and Computation.

In The Last Decade

Hubert Comon

31 papers receiving 418 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Hubert Comon France	14	435	295	111	60	55	33	483
Mario Coppo Italy	12	537 1.2×	405 1.4×	93 0.8×	35 0.6×	33 0.6×	37	578
Pierre Lescanne France	13	558 1.3×	423 1.4×	65 0.6×	34 0.6×	52 0.9×	47	606
Ernst–Erich Doberkat Germany	9	200 0.5×	163 0.6×	55 0.5×	43 0.7×	22 0.4×	59	282
Christian Suttner Australia	11	341 0.8×	218 0.7×	77 0.7×	23 0.4×	39 0.7×	16	394
Val Breazu-Tannen United States	10	413 0.9×	152 0.5×	248 2.2×	62 1.0×	17 0.3×	19	467
Christian Urban Germany	11	422 1.0×	300 1.0×	46 0.4×	39 0.7×	28 0.5×	30	454
Eduardo Giménez	2	368 0.8×	267 0.9×	77 0.7×	53 0.9×	46 0.8×	2	444
Harry G. Mairson United States	15	429 1.0×	315 1.1×	104 0.9×	38 0.6×	35 0.6×	37	476
R.J. vanGlabbeek United States	6	247 0.6×	296 1.0×	61 0.5×	24 0.4×	50 0.9×	10	349
Roger Villemaire Canada	9	210 0.5×	197 0.7×	88 0.8×	121 2.0×	47 0.9×	33	362

Countries citing papers authored by Hubert Comon

Since Specialization

Citations

This map shows the geographic impact of Hubert Comon'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 Hubert Comon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hubert Comon more than expected).

Fields of papers citing papers by Hubert Comon

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hubert Comon. 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 Hubert Comon. The network helps show where Hubert Comon may publish in the future.

Co-authorship network of co-authors of Hubert Comon

This figure shows the co-authorship network connecting the top 25 collaborators of Hubert Comon. A scholar is included among the top collaborators of Hubert Comon 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 Hubert Comon. Hubert Comon 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

Comon, Hubert & Véronique Cortier. (2004). Tree automata with one memory set constraints and cryptographic protocols. Theoretical Computer Science. 331(1). 143–214. 22 indexed citations

Comon, Hubert & Florent Jacquemard. (2003). Ground reducibility is EXPTIME-complete. Information and Computation. 187(1). 123–153. 10 indexed citations

Comon, Hubert, et al.. (2003). Decidable problems in shallow equational theories. 510. 255–265. 1 indexed citations

Comon, Hubert & Vitaly Shmatikov. (2002). Is it possible to decide whether a cryptographic protocol is secure or not?. Journal of Telecommunications and Information Technology. 5–15. 31 indexed citations

Comon, Hubert, Claude Marché, & Ralf Treinen. (2001). Constraints in computational logics : theory and applications : International Summer School, CCL'99, Gif-sur-Yvette, France, September 5-8, 1999 : revised lectures. Springer eBooks. 1 indexed citations

Berry, Gérard, Hubert Comon, & Alain Finkel. (2001). Computer Aided Verification: 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001. Proceedings. Medical Entomology and Zoology. 1 indexed citations

Comon, Hubert, et al.. (2001). The confluence of ground term rewrite systems is decidable in polynomial time. 298–307. 13 indexed citations

Comon, Hubert. (2000). Sequentiality, Monadic Second-Order Logic and Tree Automata. Information and Computation. 157(1-2). 25–51. 15 indexed citations

Comon, Hubert & Robert Nieuwenhuis. (2000). Induction=I-Axiomatization+First-Order Consistency. Information and Computation. 159(1-2). 151–186. 18 indexed citations

10.

Comon, Hubert. (1998). Completion of Rewrite Systems with Membership Constraints Part II: Constraint Solving. Journal of Symbolic Computation. 25(4). 421–453. 21 indexed citations

11.

Comon, Hubert. (1998). Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules. Journal of Symbolic Computation. 25(4). 397–419. 19 indexed citations

12.

Comon, Hubert & Ralf Treinen. (1997). The first-order theory of lexicographic path orderings is undecidable. Theoretical Computer Science. 176(1-2). 67–87. 11 indexed citations

13.

Comon, Hubert & Jean-Pierre Jouannaud. (1995). Term rewriting : French Spring School of Theoretical Computer Science, Font Romeux [sic], France, May 17-21, 1993 : advanced course. Springer eBooks. 3 indexed citations

14.

Comon, Hubert, et al.. (1994). Syntacticness, Cycle-Syntacticness, and Shallow Theories. Information and Computation. 111(1). 154–191. 17 indexed citations

15.

Comon, Hubert, et al.. (1994). Equational Formulas with Membership Constraints. Information and Computation. 112(2). 167–216. 35 indexed citations

16.

Comon, Hubert. (1993). Complete axiomatizations of some quotient term algebras. Theoretical Computer Science. 118(2). 167–191. 17 indexed citations

17.

Comon, Hubert, et al.. (1992). Decidable Problems in Shallow Equational Theories (Extended Abstract). 255–265. 2 indexed citations

18.

Comon, Hubert. (1990). Solving Inequations in Term Algebras (Extended Abstract ). 62–69. 5 indexed citations

19.

Comon, Hubert & Pierre Lescanne. (1989). Equational problems anddisunification. Journal of Symbolic Computation. 7(3-4). 371–425. 83 indexed citations

20.

Rémy, Jean-Luc & Hubert Comon. (1986). How to characterize the language of ground normal forms. HAL (Le Centre pour la Communication Scientifique Directe). 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