Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[3]
Hilfe
Suche: Author="Comon, Hubert"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tree automata with one memory set constraints and cryptographic protocols
Hubert Comon
,
Véronique Cortier
Theoretical Computer Science
331
(1), 2005, pp. 143-214
Ground reducibility is EXPTIME-complete
Hubert Comon
,
Florent Jacquemard
Information and Computation
187
(1), 2003, pp. 123-153
Tree automata with one memory, set constraints, and ping-pong protocols
Hubert Comon
,
Véronique Cortier
,
John Mitchell
Lecture Notes in Computer Science
2076
, 2001, pp. 682-693
Induction =
I
-axiomatization + first-order consistency
Hubert Comon
,
Robert Nieuwenhuis
Information and Computation
159
(1-2), 2000, pp. 151-186
Sequentiality, monadic second-order logic and tree automata
Hubert Comon
Information and Computation
157
(1-2), 2000, pp. 25-51
Completion of rewrite systems with membership constraints - Part I: Deduction rules
Hubert Comon
Journal Symbolic Computation
25
(4), 1998, pp. 397-419
Completion of rewrite systems with membership constraints - Part II: Constraint solving
Hubert Comon
Journal Symbolic Computation
25
(4), 1998, pp. 421-453
The first-order theory of lexicographic path orderings is undecidable
Hubert Comon
,
Ralf Treinen
Theoretical Computer Science
176
(1-2), 1997, pp. 67-87
Pumping, cleaning and symbolic constraints solving
Anne-Cécile Caron
,
Hubert Comon
,
Jean-Luc Coquidé
,
Max Dauchet
,
Florent Jacquemard
Lecture Notes in Computer Science
820
, 1994, pp. 436-449
Equational formulae with membership constraints
Hubert Comon
,
Catherine Delor
Information and Computation
112
(2), 1994, August, pp. 167-216
Syntacticness, cycle-syntacticness, and shallow theories
Hubert Comon
,
Marianne Haberstrau
,
Jean-Pierre Jouannaud
Information and Computation
111
(1), 1994, May, pp. 154-191
Ground reducibility and automata with disequality constraints
Hubert Comon
,
Florent Jacquemard
Lecture Notes in Computer Science
775
, 1994, pp. 151-162
Complete axiomatizations of some quotient term algebras
Hubert Comon
Theoretical Computer Science
118
(2), 1993, pp. 167-191
Negation elimination in equational formulae
Hubert Comon
,
Maribel Fernández
Lecture Notes in Computer Science
629
, 1992, pp. 191-199
Completion of rewrite systems with membership constraints
Hubert Comon
Lecture Notes in Computer Science
623
, 1992, pp. 392-403
Solving symbolic ordering constraints
Hubert Comon
International Journal of Foundations of Computer Science
1
(4), 1990, pp. 387-411
Equational formulas in order-sorted algebras
Hubert Comon
Lecture Notes in Computer Science
443
, 1990, pp. 674-688
Equational problems and disunification
Hubert Comon
,
Pierre Lescanne
Journal Symbolic Computation
7
(3-4), 1989, pp. 371-425