The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Hubert Comon: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jacques Calmet, Hubert Comon, Denis Lugiez
    Type Inference Using Unification in Computer Algebra. [Citation Graph (0, 0)][DBLP]
    AAECC, 1986, pp:25-28 [Conf]
  2. Hubert Comon
    An Effective Method for Handling Initial Algebras. [Citation Graph (0, 0)][DBLP]
    ALP, 1988, pp:108-118 [Conf]
  3. Hubert Comon
    Constraints in Term Algebras (Short Survey). [Citation Graph (0, 0)][DBLP]
    AMAST, 1993, pp:97-108 [Conf]
  4. Hubert Comon
    Disunification: A Survey. [Citation Graph (0, 0)][DBLP]
    Computational Logic - Essays in Honor of Alan Robinson, 1991, pp:322-359 [Conf]
  5. Alexandre Boudet, Hubert Comon
    Diophantine Equations, Presburger Arithmetic and Finite Automata. [Citation Graph (0, 0)][DBLP]
    CAAP, 1996, pp:30-43 [Conf]
  6. Hubert Comon, Ralf Treinen
    Ordering Constraints on Trees. [Citation Graph (0, 0)][DBLP]
    CAAP, 1994, pp:1-14 [Conf]
  7. Hubert Comon
    Sufficient Completness, Term Rewriting Systems and "Anti-Unification". [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:128-140 [Conf]
  8. Hubert Comon, Yan Jurski
    Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. [Citation Graph (0, 0)][DBLP]
    CAV, 1998, pp:268-279 [Conf]
  9. Hubert Comon, Claude Kirchner
    Constraint Solving on Terms. [Citation Graph (0, 0)][DBLP]
    CCL, 1999, pp:47-103 [Conf]
  10. Hubert Comon, Yan Jurski
    Timed Automata and the Theory of Real Numbers. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:242-257 [Conf]
  11. Hubert Comon, Véronique Cortier
    Flatness Is Not a Weakness. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:262-276 [Conf]
  12. Hubert Comon, Yan Jurski
    Higher-Order Matching and Tree Automata. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:157-176 [Conf]
  13. Hubert Comon, Guillem Godoy, Robert Nieuwenhuis
    The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:298-307 [Conf]
  14. Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
    Pumping, Cleaning and Symbolic Constraints Solving. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:436-449 [Conf]
  15. Hubert Comon
    Equational Formulas in Order-Sorted Algebras. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:674-688 [Conf]
  16. Hubert Comon
    Complete Axiomatizations of Some Quotient Term Algebras. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:469-480 [Conf]
  17. Hubert Comon
    Completion of Rewrite Systems with Membership Constraints. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:392-403 [Conf]
  18. Hubert Comon, Véronique Cortier, John Mitchell
    Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:682-693 [Conf]
  19. Hubert Comon
    Solving Inequations in Term Algebras (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:62-69 [Conf]
  20. Hubert Comon
    Sequentiality, Second Order Monadic Logic and Tree Automata [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:508-517 [Conf]
  21. Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud
    Decidable Problems in Shallow Equational Theories (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:255-265 [Conf]
  22. Hubert Comon, Florent Jacquemard
    Ground Reducibility is EXPTIME-Complete. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:26-34 [Conf]
  23. Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
    Decision Problems in Ordered Rewriting. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:276-286 [Conf]
  24. Hubert Comon, Robert Nieuwenhuis, Albert Rubio
    Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:375-385 [Conf]
  25. Hubert Comon, Maribel Fernández
    Negation Elimination in Equational Formulae. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:191-199 [Conf]
  26. Hubert Comon
    Inductive Proofs by Specification Transformation. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:76-91 [Conf]
  27. Hubert Comon
    About Proofs by Consistency (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:136-137 [Conf]
  28. Hubert Comon, Florent Jacquemard
    Ground Reducibility and Automata with Disequality Constraints. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:151-162 [Conf]
  29. Alexandre Boudet, Hubert Comon
    About the Theory of Tree Embedding. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:376-390 [Conf]
  30. Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner
    A Methodological View of Constraint Solving. [Citation Graph (0, 0)][DBLP]
    Constraints, 1999, v:4, n:4, pp:337-361 [Journal]
  31. Hubert Comon, Robert Nieuwenhuis
    Induction=I-Axiomatization+First-Order Consistency. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:159, n:1-2, pp:151-186 [Journal]
  32. Hubert Comon, Florent Jacquemard
    Ground reducibility is EXPTIME-complete. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:1, pp:123-153 [Journal]
  33. Hubert Comon
    Sequentiality, Monadic Second-Order Logic and Tree Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:157, n:1-2, pp:25-51 [Journal]
  34. Hubert Comon, Catherine Delor
    Equational Formulae with Membership Constraints [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:112, n:2, pp:167-216 [Journal]
  35. Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud
    Syntacticness, Cycle-Syntacticness, and Shallow Theories [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:111, n:1, pp:154-191 [Journal]
  36. Hubert Comon
    Solving Symbolic Ordering Constraints. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:4, pp:387-412 [Journal]
  37. Hubert Comon
    Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1998, v:25, n:4, pp:397-419 [Journal]
  38. Hubert Comon
    Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1998, v:25, n:4, pp:421-453 [Journal]
  39. Hubert Comon, Pierre Lescanne
    Equational Problems and Disunification. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:3/4, pp:371-425 [Journal]
  40. Hubert Comon, Denis Lugiez, Ph. Schnoebelen
    A Rewrite-Based Type Discipline for a Subset of Computer Algebra. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:11, n:4, pp:349-368 [Journal]
  41. Hubert Comon
    Constraints in Term Algebras: An Overview of Constraint Solving Techniques [Citation Graph (0, 0)][DBLP]
    , 1994, v:, n:, pp:62-67 [Journal]
  42. Hubert Comon
    On Unification of Terms with Integer Exponents. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:1, pp:67-88 [Journal]
  43. Hubert Comon
    Complete Axiomatizations of Some Quotient Term Algebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:118, n:2, pp:167-191 [Journal]
  44. Hubert Comon, Véronique Cortier
    Tree automata with one memory set constraints and cryptographic protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:143-214 [Journal]
  45. Hubert Comon, Ralf Treinen
    The First-Order Theory of Lexicographic Path Orderings is Undecidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:176, n:1-2, pp:67-87 [Journal]
  46. Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
    Deciding the confluence of ordered term rewrite systems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2003, v:4, n:1, pp:33-55 [Journal]

Search in 0.059secs, Finished in 0.060secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002