.:. Consultation > Liste par année > 2009 .:.

119 documents classés par : Date Titre Nom du premier auteur Type de documents Date de dépôt

1 - 2 - 3 - 4 - 5 - 6

Modelando Sistemas de Membranas en ntcc Villota A., Aranda J., Juan Francisco D. XXXV Latin American Informatics Conference, Brazil (2009) [inria-00430537 - version 1]

Festschrift for Mogens Nielsen's 60th Birthday Carbone M., Sobocinski P., Valencia F. D. (2009) 4001-4168 [hal-00779099 - version 1]

Real-time estimation of the switching signal for perturbed switched linear systems Fliess M., Join C., Perruquetti W. Dans 3rd IFAC Conference on Analysis and Design of Hybrid Systems, ADHS'09 - 3rd IFAC Conference on Analysis and Design of Hybrid Systems, ADHS'09, Espagne (2009) [inria-00430630 - version 1]

A Framework for Abstract Interpretation of Timed Concurrent Constraint Programs Falaschi M., Olarte C., Palamidessi C. Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (2009) 207-218 [inria-00426608 - version 1]

On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon Bokowski J., Pilaud V. 21st Canadian Conference on Computational Geometry (CCCG 2009), Canada (2009) [hal-00778490 - version 1]

From Self-Interpreters to Normalization by Evaluation Boespflug M. 2009 Workshop on Normalization by Evaluation, États-Unis (2009) [inria-00434284 - version 1]

Efficient normalization by evaluation Boespflug M. 2009 Workshop on Normalization by Evaluation, États-Unis (2009) [inria-00434283 - version 1]

From Deep Inference to Proof Nets via Cut Elimination Straßburger L. Journal of Logic and Computation 21, 4 (2009) 589-624 [hal-00772603 - version 1]

Implicit complexity in recursive analysis Bournez O., Gomaa W., Hainry E. Tenth International Workshop on Logic and Computational Complexity - LCC'09, États-Unis (2009) [inria-00429964 - version 1]

Complete reducibility candidates Cousineau D. Proof Search in Type Theory, Canada (2009) [inria-00433159 - version 1]

VARNA: Interactive drawing and editing of the RNA secondary structure. Darty K., Denise A., Ponty Y. Bioinformatics 25, 15 (2009) 1974-5 [hal-00432548 - version 1]

Towards an Implicit Calculus of Inductive Constructions. Extending the Implicit Calculus of Constructions with Union and Subset Types. Bernardo B. TPHOLs (Emerging trends), Germany (2009) [inria-00432649 - version 1]

Fast Arithmetics in Artin-Schreier Towers over Finite Fields De Feo L., Schost E. In Proceedings of the 2009 international symposium on Symbolic and algebraic computation - International Conference on Symbolic and Algebraic Computation, Korea, Republic Of (2009) [hal-00505795 - version 1]

A Declarative Language for Dynamic Multimedia Interaction Systems Olarte C., Rueda C. Mathematics and Computation in Music 38 (2009) [inria-00426607 - version 1]

An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems Aranda J., Assayag G., Olarte C., Rueda C., Mauricio T., Jorge P., Valencia F. D. Proc. of the 25th International Conference in Logic Programming ICLP'09 5649 (2009) 509-513 [inria-00426610 - version 1]

Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial Bassino F., Bouvel M., Pierrot A., Rossin D. In Proceedings of PP 2009 - Permutation Patterns 2009 (PP 2009), Italy (2009) [hal-00459647 - version 1]

Concurrent Constraint Calculi: a Declarative Paradigm for Modeling Music Systems. Olarte C., Rueda C., Valencia F. D. Dans New Computational Paradigms for Computer Music (2009) [inria-00429592 - version 1]

Uniformization of multivariate power series Van Der Hoeven J. [hal-00466469 - version 1] (23/03/2010)

Distributed Learning of Equilibria in a Routing Game Barth D., Cohen J., Bournez O., Boussaton O. Parallel Processing Letters 19, 2 (2009) 189-204 [inria-00432310 - version 1]

Asynchronous Process Calculi for Specification and Verification of Information Hiding Protocols Beauxis R. Ecole Polytechnique X (04/05/2009), Catuscia Palamidessi (Dir.) [tel-00772693 - version 1]