86-1		E.-R. OLDEROG K.R. APT	Fairness in Parallel Programs: The Transformational Approach (revised version)
86-2		K. APT N. FRANCEZ S. KATZ	Appraising Fairness in Languages for Distibuted Programming
86-3		G. COUSINEAU P.-L. CURIEN M. MAUNY	Combinateurs Categoriques et Implementation des Langages Fonctionnels
86-4		L. PUEL	Using Unavoidable Sets of Trees to Generalize Kruskal's Theorem
87-1		K.R. APT J-M. PUGIN	Maintenance of Statified Databases Viewed as a Belief Revision System
87-2		L. BOUGE	Modularite et Symetrie pour les Systemes Repartis; Application au langage $CSP$
87-3		P.-L. CURIEN A. OBTULOWICZ	Partiality, Cartesian Closedness and toposes
87-4		P-D. ALEVIZOS J-D. BOISSONNAT M. YVINEC	An Optimal O(nlog n) Algorithm for Contour Reconstruction from Rays
87-5		B. CHARRON	Symetrie et Systemes Electoraux Symetriques dans le Langage $CCS$
87-6		E. LEBRAS F. PREPARA C. PUECH M. TEILLAUD J. VITTER M. YVINEC	New Technique for Perspective Display of Isothetic three Dimensional Rectangles
87-7		C. MATHIEU J. VITTER	Maximum Queue Size and Hashing with Lazy Deletions
87-8		A. AGGARWAL J. VITTER	The Input/Output Complexity of Sorting and Related Problems
87-9		Ph. de REFFYE C. EDELIN J. FRANCON M. JAEGER C. PUECH	Plant Models Faithful to Botanical Structure and Development
87-10		K.R. APT L. BOUGE Ph. CLERMONT	Two Normal Form Theorems for $CSP$ Programs
87-11		R. PINO PEREZ	Le Lambda-Calcul Partiel
87-12		O. DEVILLERS C. PUECH F. SILLION	CIL : un modele d'Illumination Integrant les Reflexions Diffuse et Speculaire
87-13		L. BOUGE N. FRANCEZ	A Compositional Approach to Superimposition
87-14		M.P. CANI	Problemes de deformation et recollement de surfaces (rapport de stage DEA)
88-1		F.P. PREPARATA J.S. VITTER M. YVINEC	Commputational of the Axial View of a Set of Isothetic Parallelepipeds
88-2		O. DEVILLERS C. PUECH F. SILLION	Eficiency of Space Subdivision Structures for Ray Tracing
88-3		G. COUSINEAU G. HUET	The CAML Primer. Projet Formel INRIA-ENS
88-4		Ph. MATHERAT	Contribution a l'Augmentation de Puissance des Architectures de Visus Graphiques
88-5		O. DEVILLERS	Methodes d'Optimisation du Trace de Rayons (These)
88-6		L. BOUGE	Semantiques du Parallelisme : un Tour d'Horizon
88-7		C. MATHIEU	Comparaison de modeles Combinatoires et Probabilistes: Deux Exemples en Analyse d'Algorithmes (These)
88-8		B.CHARRON-BOST	Mesure du Parallelisme des Calculs Distribues
88-9		B.CHARRON-BOST	Measure of Parellelism of Distributed Computations
88-10		P.-L. CURIEN	The lambda\rho -calculus: an Abstract Framework for Environment Machines
88-11		P. ALEVIZOS J.D. BOISSONA M. YVINEC	On the Order Induced by a Set of Rays Application to T the Probing of Non Convex
88-12		M.P. GASCUEL	Recollement et Pincement de Surfaces Splines: Nouvelles Methodes pour la Creation Interactive d'Objets Complexes, et l'Habillage Automatique de Squelettes
88-13		O. DEVILLERS	The Macro-regions : an Efficient Space Subdivision Structure for Ray Tracing
89-1		D. ROLLER F. SCHONEK A. VERROUST	Dimension-driven Geometry in CAD : A Survey
89-2		F. SCHONEK A. VERROUST	A Rule Oriented Method to Parametrize CAD Designs
89-3		B.CHARRON-BOST	Combinatorics and Geometry of consistent cuts: Application to Concurrency Theory
89-4		G. BERNOT	A Formalism for Test with Oracle Based on Algebraic Specifications
89-5		M.P. GASCUEL A. VERROUST	Animation a l'Aide de la Dynamique : Etat de l'Art
89-6		N. PARIS	Developpement d'Outils de Conception de Circuits Integres et Application a la Realisation d'une Architecture de Visualisation (These)
89-7		F. SILLION	Simulation de l'Eclairage pour la Synthese d'Images: Realisme et Interactivite (These)
89-8		B.CHARRON-BOST	Mesures de la Concurrence du Parallelisme des Calculs Repartis (These)
89-9		J.D. BOISSONNAT M. YVINEC	Probing a Scene of non Convex Polyhedra
89-10		R. COLE B. MISHRA J. SCHMIDT A. SIEGEL	On the Dynamic Finger Conjecture for Splay Trees Part I: Splay Sorting log n-Block Sequences
89-11		R. COLE	On the Dynamic Finger Conjecture for Splay Trees Part II Finger Searching
89-12		L. FRIBOURG	Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction
89-13		E. KRANAKIS M. POCCHIOLA	Enumeration and Visibility Problems in Integer Lattices
90-1		M.P. GASCUEL A. VERROUST C. PUECH	Animation with Collisions of Deformable Articulated Bodies
90-2		B. VIROT	Parallelization of the Simulated Annealing Algorithm Application to the Placement Problem
90-3		J.P.THIRION	Tries : Data Structures Based on Boolean Representation for Ray Tracing
90-4		J.P. THIRION	Interval Arithmetic for High Resolution Ray Tracing
90-5		F.P. PREPARATA J.S. VITTER	Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds
90-6		L. BOUGE P. GARDA	Towards a Semantic Approach to SIMD Architectures and their languages
90-7		L. PUEL A. SUAREZ	Compiling Pattern Matching by Term Decomposition
90-8		D. DURE	Simulation Multi-Mode de Circuits VLSI (These)
90-9		P.L. CURIEN	Substitution up to Isomorphism
90-10		P.L. CURIEN G. GHELLI	Coherence of Subsumption
90-11		F. FAGES	A New Fixpoint Semantics for General Logic Programs Compared with the Well-Founded and the Stable Model Semantics
90-12		A. BOUVEROT	Pliage/Depliage et Extraction de Programmes Logiques: Presentation Comparee
90-13		L. BOUGE	On the Semantics of Languages for Massively Parallel SIMD Architectures
90-14		K. BRUCE R. DI COSMO G. LONGO	Provable Isomorphisms of Types
90-15		F. FAGES	Consistency of Clark's Completion and Existence of Stable Models
90-16		J.D. BOISSONNAT O. DEVILLERS R. SCHOTT M. TEILLAUD M. YVINEC	Applications of Random Sampling to On-line Algorithms in Computational Geometry
90-17		J.P. THIRION	Utilisation de la Coherence des Rayons Lumineux pour le Lancer de Rayons (These)
90-18		M. POCCHIOLA E. KRANAKIS	Camera Placement in Integer Lattices
90-19		R. M. AMADIO	Domains in a Realizability Framework
90-20		G. LONGO	Notes on the Foundation of Mathematics and of Computer Science
90-21		G. LONGO E. MOGGI	Constructive Natural Deduction and its "omega"-set Interpretation
90-22		M.P. GASCUEL	Deformations de Surfaces Complexes : Techniques de Haut Niveau pour la Modelisation et l'Animation (These)
90-23		M. POCCHIOLA	Trois Themes sur la Visibilite: Enumeration Optimisation et Graphique 2D (These)
90-24		Y. LAFONT A. PROUTE	Church-Rosser Property and Homology of Monoids
90-25		P.H. CHEONG	Compiling Lazy Narrowing into Prolog
90-26		P.H. CHEONG L. FRIBOURG	Efficient Integration of Simplification into Prolog
90-27		A. VERROUST	Etude de Problemes lies a la Definition la Visualisation et l'Animation d'Objets Complexes en Informatique Graphique (These d'Etat)
90-28		L. FRIBOURG	Generating Simplification Lemmas Using Extended Prolog Execution and Proof-Extraction
90-29		L. COLSON	Representation Intentionnelle d'Algorithmes dans les Systemes Fonctionnels : une Etude de Cas. (These)
91-1		G. BERNOT	Testing Against Formal Specifiations: a Theoretical View
91-2		A. BOUVEROT	Comparaison entre la Transformation et l'Extraction de Programmes Logiques.(These)
91-3		R. AMADIO	Bifinite Domains : Stable Case
91-4		A. BOUVEROT	Extracting and Transforming Logic Programs
91-5		P. HOOGVORST R. KERYELL P. MATHERAT N. PARIS	POMP or How to Design a Massively Parallel Machines with Small Developments
91-6		G. BERNOT M. BIDOIT T. KNAPIK	Observational Approaches in Algebraic Specifications: a Comparative Study
91-7		Y. LAFONT A. PROUTE	Church-Rosser Property and Homology of Monoids (revised version)
91-8		G. BERNOT M. BIDOIT	Proving the Correctness of Algebraically Specified Software: Modularity and Observability Issues
91-9		M. BIDOIT	Development of Modular Specifications by Stepwise Refinements Using the PLUSS Specification Language
91-10		R. Di COSMO	Invertibility of Terms and Valid Isomorphisms. A Proof Theoretic Study on Second Order lambda-calculus with Surjective Pairing and Terminal Object
91-11		R. Di COSMO P.L.CURIEN	A Confluent Reduction for the lambda-calculus with Surjective Pairing and Terminal Object and Terminal Object
91-12		P. CREGUT	Machines a Environnement pour la Reduction ymbolique et l' Evaluation Partielle (These)
91-13		L. CHILLAN	Typing with Type Relations and ML-Polymorphism
91-14		P.COUSOT R. COUSOT	Inductive Definitions, Semantics and Abstract Interpretation
91-15		A. ASPERTI	A Linguistic Approach to Deadlock
91-16		P.L. CURIEN T. HARDIN A. RIOS	Normalisation Forte du Calcul des Substitutions
91-17		N. PARIS	MOD2MAG User's Manual
91-18		A. BUCCIARELLI T. EHRHARD	A Theory of Sequentiality
91-19		P.L. CURIEN	Subtyping + Extensionality : Confluence of beta\eta\top<= Reduction in F<=
91-20		A.BUCCIARELLI Sequentiality and Strong Stability T. EHRHARD
91-21		A.BUCCIARELLI	Extensional Embedding of a Strongly Stable Model of PCF
91-22		T. EHRHARD P. MALACARIA	Stone Duality for Stable Functions
91-23		L. FRIBOURG	Mixing List Recursion and Arithmetic
91-24		E. KRANAKIS M. POCCHIOLA	A Brief Survey of Art Problems in Integer Lattice Systems
92-1		C. LAVATELLI	Coherence dans les Categories Fermees Sur un Resultat de G.E. Mints
92-2		G.BERNOT M. BIDOIT T. KNAPIK	Towards an Adequate Notion of Observation
92-3		G.BERNOT M. BIDOIT	Observational Specifications and the Indistinguishability Assumption
92-4		G. CASTAGNA G. GHELLI G. LONGO	A Calculus for Overloaded Functions with Subtyping
92-5		N. PARIS	Definition de POMPC (version 1.99)
92-5b		s N.PARIS	Definition of POMPC (version 1.99)
92-6		L. ALBERT R. CASAS F. FAGES	Average Case Analysis of Unification Algorithms
92-7		E. CHAILLOUX	Compilation des langages fonctionnels: CeML un Traducteur de ML vers C . (These).
92-8		J. BERSTEL M. POCCHIOLA	Average Cost of Duval's Algorithm for Generating Lyndon Words
92-9		M. DEZA V.P. GRISHUH	Hypermetric graphs KIN
92-10		A. SALIBRA G. SCOLLO	Compactness and Lowenheim-Skolem properties in pre-institution categories
92-11		G. CASTAGNA	Strong Typing in Object-Oriented Paradigms
92-12		P. COUSOT R. COUSOT	Abstract Interpretation and Application to Logic Programs
92-13		L. FRIBOURG VELOSO PEIXO	Bottom-up Evaluation of Datalog Programs with Arithmetic TO Constraints
92-14		T. KNAPIK	Specifications with Observable Formulae and Observational Satisfaction Relation
92-15		E. CHAILLOUX G. COUSINEAU	The ML:graph Primer
92-16		P. COUSOT R. COUSOT	Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
92-17		S. VAUDENAY	FFT-Hash-II is not yet Collision-free
92-18		M. DEZA M. LAURENT	Applications of Cut Polyhedra
92-19		B. HADIM	Virtualisation et Programmation Physique dans le Langage POMPC: Applications a l'Operation Prefixe
92-20		E. KRANAKIS M. POCCHIOLA	Camera Placement in Integer Lattices
92-21		J. BERSTEL M. POCCHIOLA	A Geometric Proof of the Enumeration Formula for Sturmian Words
92-22		S. VAUDENAY	One-Time Identification with Low Memory
92-23		M. BIDOIT R. HENNINCKE	How to Prove Observational Theorems with LP R
92-24		G. LONGO	Reflexions on Formalism and Reductionism in Logic and Computer Science
92-25		G. LONGO K. MILSTED S. SOLOVIEV	The Genericity Theorem and the Notion of Parametricity in the Polymorphic lambda -calculus
92-26		M. DEZA V.P. GRISHUKHI	L-Polytopes and Equiangular Lines N
92-27		V.P. GRISHUKHIN	Strongly Regular Graphs Related to a Regular Two-Graph
92-28		S. BONNIER L. FRIBOURG	A Proof Method based on Folding Lemmas: Applications to Algorithm Correctness
93-1		V.P. GRISHUKHIN	L-Polytopes, Even Unimodular Lattices, and Perfect Lattices
93-2		G. LONGO	Types as Parameters
93-3		M. DEZA V.P. GRISHUKHI	Cut Cones IV : Lattices Points N
93-4		M. DEZA V.P. GRISHUKHI M. LAURENT	Hypermetrics in Geometry of Numbers N
93-5		JM. COUVEIGNES	Calcul et Rationalite de Fonctions de Belyi en Genre 0
93-6		B. GERARDS M. LAURENT	A Characterization of Box 1/d-integral Binary Clutters
93-7		A. JOUX	La Reduction des Reseaux en Cryptographie. (These)
93-8		J. BERSTEL M. POCCHIOLA	Random Generation of Finite Sturmian Words
93-9		M. LAURENT	Hilbert Bases of Cuts
93-10		L. FRIBOURG M. VELOSO PEIXOT	Concurrent Constraint Automata O
93-11		R. DI COSMO D. KESNER	Simulating Expansions without Expansions
93-12		F. FAGES	On the semantics of Optimization Predicates in CLP Languages
93-13		G. CASTAGNA G. GHELLI G. LONGO	A Semantics for lambda &-early: a Calculus with Overloading and Early Binding
93-14		M. ABADI L. CARDELLI P-L. CURIEN	Formal Parametric Polymorphism
93-15		C. LAVATELLI	Non-deterministic Lazy lambda-calculus vs pi-calculus
93-16		M. LAURENT	Hypercube Embedding of Distances with Few Values
93-17		M. DEZA M. LAURENT	Measure Aspects of Cut Polyedra: l1-embeddability and Probability
93-18		A. SUAREZ	Une implementation de ML en ML. (These)
93-19		A. DEZA M. DEZA	The Ridge Graph of the Metric polytope and Some Relatives
93-20		C. VEDEL	Calcul de l'Illumination par des Sources Etendues : Espace Objet et Espace Image. (These)
93-21		G. LONGO	Parametric and Type-Dependent Polymorphism
93-22		R. HASEGAWA	Relational Limits in General Polymorphism
93-23		R. HASEGAWA	Well-Ordering of Algebra and Kruskal'Theorem
93-24		A. RIOS	Contributions a l'Etude des Lambda-calculs avec Substitutions Explicites. (These)
93-25		D. COPPERSMITH J. STERN S. VAUDENAY	Attacks on the Birational Permutation Signature Schemes
93-26		A. DEZA M. DEZA	On the Skeleton of the Dual Cut Polytope
93-27		M. LAURENT S. POLJAK	On a Positive Semidefinite Relaxation of the Cut Polytope
94-1		G. CASTAGNA	Surchage, Sous-typage et Liaison Tardive: Fondements Fonctionnels de la Programmation Orientee Objets (These)
94-2		J-M. COUVEIGNES L. GRANBOULAN	Dessins from a Geometric Point of View
94-3		F. CHABAUD S. VAUDENAY	Links between Differential and Linear Cryptanalysis
94-4		M. POCCHIOLA G. VEGTER	Order Types and Visibility Types of Configurations of of Disjoint Convex Plane Sets
94-5		M. DEZA V.P. GRISHUKHI	Odd Systems of Vectors and Related lattices N
94-6		M. LAURENT	Embeddings of Graphs
94-7		M. DEZA M. LAURENT	Hypercube Embeddings and Designs
94-8		M. DEZA V.P. GRISHUKHI	Cut Polytope and its Lattices N
94-8		M. DEZA V.P. GRISHUKHI	Cut Polytope and its Lattices N
94-9		L. FRIBOURG M. VELOSO PEIX	Bottom-up Evaluation of Datalog Programs with Arithmetic OTO Constraints: The Case of 3 Recursive Rules
94-10		M. BIDOIT R. HENNICKER M. WIRSING	Behavioural and Abstractor Specifications
94-11		M. BIDOIT R. HENNICKER	Proving Behavioural Theorems with Standard First-Order Logic
94-12		M. DEZA T. HUANG	Complementary l1-graph and Related Combinatorial Ressources
94-13		M. DEZA T. HUANG	l1-embeddability of Some Blocks Graphs and Cycloids
94-14		F. FAGES	Constructive negation by Prunning
94-15		F. FAGES P. RUET	Combining Explicit Negation and Negation by Failure via Belnap's Logic
94-16		A. DEZA M. DEZA	Skeletons of Some Relatives of the n-cube
94-17		M.DEZA V. GRISHUKHIN	Bounds on the Covering Radius of a Lattice
94-18		G. CASTAGNA	Covariance and Contravariance Conflict without a Cause
94-19		F. FAGES	Constructive Negation by Pruning and Optimization Higher-order Predicates for CLP and CC Languages
94-20		G. LONGO	Demonstrations et Programmes
94-21		G. LONGO	Memory in Mathematics
94-22		G. CASTAGNA G. GHELLI G. LONGO	A Semantics for Stratified lambda &-early (revised version of Liens-93-13)
94-23		S. VAUDENAY	On the Need for Multipermutations Cryptanalysis of MD4 and SAFER
95-1		A. DEZA M. DEZA	The Combinatorial Structure of Small Cut and Metric Polytopes
95-2		D. POINTCHEVAL	Les Reseaux de Neurones et leurs Applications cryptographiques
95-3		P. MATHERAT M.-T. JAEKEL	Dissipation Logique des Implementations d'Automates. Dissipation de Calcul
95-4		G. CASTAGNA	A Proposal for Making O2 More Type-safe
95-5		M. BIDOIT R. HENNICKER	Behavioural Theories and the Proof of Behavioural Properties
95-6		M. VELOSO PEIXOTO	Automates a Contraintes Arithmetiques et Procedures d'Evaluation Ascendante de Programmes Logiques. (These)
95-7		F. LABURTHE M. DEZA M. LAURENT	The Hilbert Basis of the Cut Cone over the Complete Graph on Six Vertices
95-8		M. DEZA V. GRISHUKHIN	Once More about 80 Steiner Triple Systems on 15 points
95-9		M. DEZA V. GRISHUKHIN	Two-graphs on 36 Points from the Even Unimodular Lattices $E_{8} \oplus E_{8}$ and $D_{16}^{+}$}
95-10		S. VAUDENAY	Securite des primitives cryptographiques (These)
95-11		M. DEZA S. SHPECTOTOV	Recognition of the l1-graph with complexity O(mn), or Football in a Hypercube
95-12		M. BIDOIT A. TARLECKI	Regular Agebras. A Framework for Observational Specifications with Recursive Definitions
95-13		J.M. COUVEIGNES	Quelques Revetements Definis sur Q
95-14		K. BRUCE L. CARDELLI G. CASTAGNA G. LEAVENS B. PIERCE The Hopkins Objects Groups	On Binary Methods
95-15		M. POCCHIOLA G. VEGTER	Computing Visibility Graphs via Pseudo-triangulations
95-16		A. BUCCIARELLI	Event Structure Representing Domains with Coherence
95-17		A. BUCCIARELLI	Degrees of Parallelism in the Continuous Type Hierarchy
95-18		C. LAVATELLI	Full-Abstraction for an Extended Ressource Language
95-19		R. BELLUCCI M. ABADI	A Model Tangent Visibility Graphs
95-20		M. POCCHIOLA G. VEGTER	Minimal Visibility Graphs
95-21		A. CANTEAUT F. CHABAUD	Improvements of the Attacks on Cryptosystems based on Error-correcting Codes
95-22		M. LUBY A. Wigderson	Pairwaise Independence and Derandomization
95-23		M. POCCHIOLA G. VEGTER	The Visibility Complex
95-24		F. FAGES	Constructive Negation by Pruning (revised version of Liens-94-14)
95-25		Y. CASEAU F. LABURTHE	Disjunctive Scheduling with Task Intervals
95-26		J. FRIBOURG H. OLSEN	Datalog Programs with Arithmetical Constraints: Hierarchic, Periodic and Spiralling Least Fixpoints
95-27		S. VAUDENAY	On the Weak Keys of Blowfish
95-28		C.P. SCHNORR S. VAUDENAY	Black Box Cryptanalysis of Cryptographic Primitives
95-29		S. VAUDENAY	An Experiment on DES Statistical Cryptanalysis
95-30		P.L. CURIEN	Algebre Universelle - Introduction au $\lambda$-calcul et aux logiques conbinatoires (Notes de cours)
95-31		G. LONGO K. MILSTED S. SOLOVIEV	A Logic Subtyping
95-32		G. LONGO	The Difference between Clocks and Turing
96-1		M. DEZA V.P. GRISHUHK	A Zoo of l1_embeddable Polytopal graphs IN
96-2		A. DEZA M. DEZA K. FUKUDA	On Skeletons, Diametres Volumes of Metric Polyhedra
96-3		L. FRIBOURG J. RICHARDSON	Symbolic Verification with gap-order Constraints
96-4		F. FAGES	Programmation Logique par Contraintes (Notes de Cours du Magistere MMFAI)
96-5		F. FAGES	Travaux Diriges de Programmation Logique par Contraintes (Notes de Cours du Magistere MMFAI)
96-6		M. DEZA V. GRISHUKHIN	The Skeleton of the 120-cell is not 5-gonal
96-7		U. de'IGUORO	PCF Definability via Kripke Logical Relations (after O'Hearn and Riecke)
96-8		F. BARBANERA M. FERNANDEZ H. GEUVERS	Modularity of Strong Normalization in the Algebraic-$\lambda$-cube
96-9		S. VAUDENAY	Hidden Collisions on DSS
96-10		N. GHANI	Eta Expansions in System F
96-11		V. CHEPOI M. DEZA V. GRISHUKHIN	Clin d'Oeil on l1-embeddable Planar Graphs
96-12		L. FRIBOURG H. Olsen	A Decompositional Approach for Computing Least Fixed-points of Datalog programs with Z-counters
96-12		L. FRIBOURG H. Olsen	A Decompositional Approach for Computing Least Fixed-points of Datalog programs with Z-counters
96-13		L. R. KNUDSEN	Why SAFER K Changed its Name
96-14		F. CHABAUD	Recherche de performance dans l'algorithmique des corps finis. Applications a la cryptographie (These)
96-15		F. LABURTHE Y. CASEAU	Introduction to the CLAIRE programming language
96-16		M. POCCHIOLA G. VEGTER	On Polygonal Covers
96-17		D. POINTCHEVAL S. VAUDENAY	On Provable Security for Digital Signature Algorithms
96-18		G. LONGO K. MILSTED S. SOLOVIEW	Coherence and Transitivity of Subtyping as Entailment
96-19		G. LONGO	Logica e Tempo in Informatica
96-20		D. POINTCHEVAL	Les Preuves de Connaissance et leurs Preuves de Securite (These)
96-21		G. CHEN G. LONGO	Subtyping Parametric and Dependent Types
96-22		T. FRUCHART G. LONGO	Carnap's remarks on Impredicative Definitions and the Genericity Theorem
96-23		G. LONGO	Le continu mathematiques, de l'intuition a la logique
96-24		L. FRIBOURG H. OLSEN	Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic
96-25		P. RUET F. FAGES	Concurrent Constraint Programming and Non-Commutative Linear Logic (Extended Abstract)
96-26		E. GOUBAULT	The Dynamics of Wait-Free Distributed Computations
96-27		G. CHEN	Dependent Type System with Subtyping Type level Transitivity Elimination
96-28		P. RUET	Complete Sets of Connectives and Complete Sequent Calculus for Belnap's Logic
96-29		C. LAVATELLI	Semantique du Lambda Calcul abec Ressources (These)
97-1		M. DEZA T. HUANG	Metrics on Permutations, a Survey
97-2		J.B. FISCHER	Etude des procedes assurant l'integrite des donnees transmises et l'authentification du porteur dans un environnement du type carte a puce - These
97-3		S. VAUDENAY	A Cheap Paradigm for Block Cipher Security Strengthening
97-4		J. STERN S. VAUDENAY	SVP : a Flexible Micropayment Scheme
97-5		M. DEZA V. GRISHUKHIN	Voronoi L-decomposition of ${PSD}_n$ and the hypermetric Correlation Cone
97-6		M. DEZA M. SHTOGRIN	Embedding of Skeletons of Voronoi and Delone Partitions into Cubic Lattices
97-7		H. PETERSEN G. POUPARD	Efficient Scalable Fair Cash with Off-line Extortion Prevention
97-8		M. DEZA V. GRISHUKHIN	Hypermetric Two-distance Spaces
97-9		M. DEZA V. GRISHUKHIN	A Zoo of $\ell_1$-embeddable Polyhedra II
97-10		M. DEZA V. GRISHUKHIN	Face-regular bifaced polyhedra
97-11		Y. CASEAU F. LABURTHE	SaLSA Specification language for search algorithm
97-12		G. LONGO	The continuum : foundations and applications
97-12		G. LONGO	The continuum : foundations and applications
97-13		M. DEZA T. HUANG	A generalization of strongly regular graphs
97-14		P. RUET	Phase semantics for mixed non-commutative classical linear logic
97-15		G. SANTINI	Theorie des domaines, espaces metriques et systemes dynamiques (Rapport de stage du DEA Semantique, Preuves et Programmation)
97-16		F. FAGES M. PALTRINIERI	A Generic Type System for CLP(X )
97-17		F.FAGES Analysis of normal CLP programs R. GORI
97-18		P. RUET	Logique non-commutative et programmation concurrente par contraintes - These
97-19		L. PERRON	CC(M), un noyau parallele pour l'implantation des langages de contraintes concurrents - These
97-20		L. GRANBOULAN	Calcul d'objets geometriques à l'aide de methodes algebriques et numeriques. Dessins d'Enfants - These
98-1		M. DANELUTTO R. DI COSMO X. LEROY S. PELAGATTI	OcamlP3l a functional parallel programming system
98-2		M. DEZA M. SHTOGRIN	Uniform partitions of 3-space, their relatives and embedding
98-3		M. DEZA V. GRISHUKHI	Hexagonal sequences N
98-4		J.-V. LODDO S. NICOLET	Theorie des jeux et langages de programmation Memoire de DEA
98-5		F. FAGES	Linear concurrent constraint programming: operational and phase semantics
98-6		O. DELGADO FRIEDRICHS M. DEZA	More icosahedral fulleroids
98-7		M. DEZA M. SHTOGRIN	Embedding of all regular tilings and star-honeycombs
98-8		S. VAUDENAY	Provable security for block Ciphers by decorrelation
98-9		M. DEZA M. SHTOGRIN	Toward 4-dimensional fullerenes
98-10		F. LABURTHE	Contraintes et algorithmes en optimisation combinatoire - Thèse
98-11		G. LONGO	De la cognition a la geometrie
98-12		Y. CASEAU F. LABURTHE	Introduction to the CLAIRE programming language
98-13		G. BRINKMANN M. DEZA	Lists of face-regular polyhedra
98-14		F. FAGES S. SOLIMA V. VIANU	Expressiveness and Complexity of Concurrent Constraint N Programming: a Finite Model Theoretic Approach
98-15		S. VAUDENAY	Vers une theorie du chiffrement symetrique (Habilitation)
98-16		M. DEZA I.G. ROSENBE	n-Semimetrics RG
98-17		G. LONGO	Prototype proofs in type theory
98-18		G. LONGO	De la logique a informatique
99-1		M. Deza E. PANTELEEVA	Quasi-semi-metrics, oriented multi-cuts and related polyhedra
99-2		S. VAUDENAY	Adaptive-attack norm for decorrelation and super- pseudorandomness
99-3		S. VAUDENAY	On the Lai-Massey scheme