 |
 |
 |
 |
|
|
||
|---|---|---|
|
inria-00100450v1
Chapitre d'ouvrage
Denys Duchier, Claire Gardent. Tree Descriptions, Constraints and Incrementality H. Bunt, R. Muskens and E. Thijsse (eds). Computing Meaning, Kluwer Academic Publishers, 23 p, 2001, Studies in Linguistics and Philosophy Series |
||
|
inria-00100446v1
Article dans une revue
Rakesh Verma, Michael Rusinowitch, Denis Lugiez. Algorithms and Reductions for Rewriting Problems Fundamenta Informatica, 2001, 46 (3), pp.257-276 |
||
|
inria-00108114v1
Communication dans un congrès
Jean-Paul Gibson, Dominique Méry, Yassine Mokhtari. Animating formal specifications : a telephone simulation case study 13th European Simulation Multiconference - ESM'99, Jun 1999, Warsaw, Poland, II, pp.139--145, 1999 |
||
|
inria-00098906v1
Communication dans un congrès
Pascal Matsakis, James M. Keller, Laurent Wendling. F-histogrammes et relations spatiales directionnelles floues Rencontres Francophones sur la logique floue et ses applications - LFA'99, Oct 1999, Valenciennes, France, 1999 |
||
|
inria-00099166v1
Communication dans un congrès
Paliath Narendran, Michael Rusinowitch. The theory of total unary RPO is decidable John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber. First International Conference on Computational Logic - Cl'2000, 2000, Londres, UK, Springer-Verlag, 1861, pp.660-672, 2000, Lecture Notes in Computer Science |
||
|
inria-00098492v1
Communication dans un congrès
Laurent Vigneron, Anita Wasilewska. Rough Sets Congruences and Diagrams R. Slowinski. 16th European Conference on Operational Research (EURO XVI), session on Rough Sets, 1998, Brussels, Belgium, 1 p, 1998 |
||
|
inria-00098986v1
Article dans une revue
Miki Hermann, Phokion G. Kolaitis. Computational Complexity of Simultaneous Elementary Matching Problems Journal of Automated Reasoning, Springer Verlag, 1999, 23 (2), pp.107-136 |
||
|
inria-00098475v1
Chapitre d'ouvrage
Anita Wasilewska, Laurent Vigneron. Rough Algebras & Automated Deduction L. Polkowski & A. Skowron. Rough Sets in Knowledge Discovery, Springer Verlag, pp.261-275, 1998 |
||
|
inria-00098493v1
Communication dans un congrès
Laurent Vigneron, Anita Wasilewska. Rough Diagrams T.Y. Lin. 6th International Workshop on Rough Sets, Data Mining & Granular Computing (RSDMGrC'98) at the 4th Joint Conference on Information Sciences, 1998, Research Triangle Park, NC, 4 p, 1998 |
||
|
inria-00098998v1
Communication dans un congrès
Jean-Paul Gibson, Dominique Méry. Formal modelling of services for getting a better understanding of the feature interaction problem - multi-view approach D. Bjorner, M. Broy, A. Zamulin. Andrei Ershov Third International Conference, Perspectives of system Informatics - PSI'99, 1999, Novosibirsk, Russia, Springer-Verlag, 1755, pp.155-179, 1999, Lecture Notes in Computer Science |
||
|
inria-00098810v1
Communication dans un congrès
Taegyun Kim, Gyusang Shin, Nacer Boudjlida. Similarity in the Design and the Implementation of a Multi-Platform CASE Tool COnstructing Software Engineering Tools - COSET'99, ICSE'99 Workshop, 1999, Los Angeles, CA, pp.137-146, 1999 |
||
|
inria-00098565v1
Rapport
Miki Hermann, Laurent Juban, Phokion G. Kolaitis. On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System [Intern report] 98-R-281 || hermann98c, 1998, 16 p |
||
|
inria-00099077v1
Article dans une revue
Daniel Leivant, Jean-Yves Marion. Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space Information and Computation, Elsevier, 2000, 12 p |
||
|
inria-00098851v1
Article dans une revue
David Plaisted, Gregory Kucherov. The complexity of some complementation problems Information Processing Letters, Elsevier, 1999, 71 (3-4), pp.159-165 |
||
|
inria-00099078v1
Article dans une revue
Daniel Leivant, Jean-Yves Marion. A characterization of alternating log time by ramified recurrence Theoretical Computer Science, Elsevier, 2000, 236 (1-2), pp.192-208 |
||
|
inria-00100887v1
Article dans une revue
Pankaj K. Agarwal, Thérèse Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri et al. Curvature-Constrained Shortest Paths in a Convex Polygon SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2002, 31 (6), pp.1814-1851. <10.1137/S0097539700374550> |
||
|
|
||