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

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

1 - 2 - 3

Fast Computation of Special Resultants Bostan A., Flajolet P., Salvy B., Schost E. Journal of Symbolic Computation 41, 1 (2006) 1-29 [inria-00000960 - version 2]

Universally Convertible Directed Signatures Laguillaumie F., Paillier P., Vergnaud D. Asiacrypt 2005, (2005) [inria-00001121 - version 1]

Réflexions sur la question fréquentielle en traitement du signal Fliess M. Rapport de recherche (0000) 7 [inria-00000461 - version 1]

On optimal hybrid ARQ control schemes for HSDPA with 16QAM Bliudze S., Billy N., Krob D. In Proc. of the IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005) - International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), Canada (2005) [hal-00283000 - version 1]

Les K-rois : une métaphore du problème d'ordonnancement spatio-temporel des avions autour d'un aéroport Artiouchine K., Baptiste P., Mattioli J. Premières Journées Francophones de Programmation par Contraintes, (2005) [inria-00000060 - version 1]

A Simple Address Autoconfiguration Mechanism for OLSR Clausen T. H., Baccelli E. IEEE International Symposium on Circuits and Systems (ISCAS), Japon (2005) [hal-00781778 - version 1]

Constructing free Boolean categories Lamarche F., Straßburger L. 20th Annual IEEE Symposium on Logic in Computer Science - LICS 2005, United States (2005) [inria-00130516 - version 1]

ROUTE OPTIMIZATION IN NESTED MOBILE NETWORKS (NEMO) USING OLSR Clausen T. H., Baccelli E., Wakikawa R. IASTED International Conference on Networks and Communication Systems, Thailand (2005) [hal-00654548 - version 1]

Implementing the asymptotically fast version of the elliptic curve primality proving algorithm Morain F. [hal-00004136 - version 2] (04/02/2005)

What is a logic, and what is a proof ? Straßburger L. In Logica Universalis (2005) 135-145 [inria-00130523 - version 1]

Separation with streams in the $\Lambda\mu$-calculus Saurin A. In 20th IEEE Symposium on Logic in Computer Science (LICS 2005) - 20th Annual IEEE Symposium on Logic In Computer Science - LICS 2005, United States (2005) [hal-00527871 - version 1]

Toward the use of a proof assistant to teach mathematics Narboux J. The Seventh International Conference on Technology in Mathematics Teaching (ICTMT7), United Kingdom (2005) [inria-00495952 - version 1]

The arithmetic of Jacobian groups of superelliptic cubics Basiri A., Enge A., Faugère J.-C., Gürel N. Mathematics of Computation 74, 249 (2005) 389-410 [inria-00071967 - version 2]

Modular Curves of Composite Level Enge A., Schertz R. Acta Arithmetica 118, 2 (2005) 129-141 [inria-00386309 - version 1]

Building curves with arbitrary small MOV degree over finite prime fields Dupont R., Enge A., Morain F. Journal of Cryptology 18, 2 (2005) 79-89 [inria-00386299 - version 1]

Recursion vs Replication in Process Calculi: Expressiveness Palamidessi C., Valencia F. D. Bulletin of the European Association for Theoretical Computer Science 87 (2005) 105-125 [inria-00201158 - version 1]

Axiomatizations for probabilistic finite-state behaviors Deng Y., Palamidessi C. 8th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2005), United Kingdom (2005) [inria-00201123 - version 1]

A Framework for Analyzing Probabilistic Protocols and its Application to the Partial Secrets Exchange Chatzikokolakis K., Palamidessi C. First Symposium on Trustworthy Global Computing, United Kingdom (2005) [inria-00201111 - version 1]

Separation of synchronous and asynchronous communication via testing Cacciagrano D., Corradini F., Palamidessi C. Proceedings of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS 2005), United States (2005) [inria-00201107 - version 1]

A randomized encoding of the pi-calculus with mixed choice Palamidessi C., Herescu O. M. Theoretical Computer Science 335, 2-3 (2005) 373-404 [inria-00201105 - version 1]