| 2020 | CCS | Oracle Simulation: A Technique for Protocol Composition with Long Term Shared Secrets. | Hubert Comon, Charlie Jacomme, Guillaume Scerri |
| 2001 | FOCS | The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. | Hubert Comon, Guillem Godoy, Robert Nieuwenhuis |
| 2001 | ICALP | Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. | Hubert Comon, Vronique Cortier, John Mitchell |
| 2000 | CSL | Flatness Is Not a Weakness. | Hubert Comon, Vronique Cortier |
| 1999 | CONCUR | Timed Automata and the Theory of Real Numbers. | Hubert Comon, Yan Jurski |
| 1998 | CAV | Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. | Hubert Comon, Yan Jurski |
| 1998 | LICS | Decision Problems in Ordered Rewriting. | Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michal Rusinowitch |
| 1997 | CSL | Higher-Order Matching and Tree Automata. | Hubert Comon, Yan Jurski |
| 1997 | LICS | Ground Reducibility is EXPTIME-Complete. | Hubert Comon, Florent Jacquemard |
| 1995 | LICS | Sequentiality, Second Order Monadic Logic and Tree Automata | Hubert Comon |
| 1995 | LICS | Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract) | Hubert Comon, Robert Nieuwenhuis, Albert Rubio |
| 1994 | ICALP | Pumping, Cleaning and Symbolic Constraints Solving. | Anne-Ccile Caron, Hubert Comon, Jean-Luc Coquid, Max Dauchet, Florent Jacquemard |
| 1994 | STACS | Ground Reducibility and Automata with Disequality Constraints. | Hubert Comon, Florent Jacquemard |
| 1992 | ICALP | Completion of Rewrite Systems with Membership Constraints. | Hubert Comon |
| 1992 | LICS | Decidable Problems in Shallow Equational Theories (Extended Abstract) | Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud |
| 1992 | MFCS | Negation Elimination in Equational Formulae. | Hubert Comon, Maribel Fernndez |
| 1991 | ICALP | Complete Axiomatizations of Some Quotient Term Algebras. | Hubert Comon |
| 1990 | ICALP | Equational Formulas in Order-Sorted Algebras. | Hubert Comon |
| 1990 | LICS | Solving Inequations in Term Algebras (Extended Abstract) | Hubert Comon |
| 1986 | CADE | Sufficient Completness, Term Rewriting Systems and "Anti-Unification". | Hubert Comon |