Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
- N. Absi, S. Kedad‑Sidhoum : “Multi-Item capacitated lot-Sizing problem with setup times and shortage costs : Polyhedral results.”, [Absi 2005c]
- J. Alvarez‑Hamelin, A. Viana, M. Dias De Amorim : “Architectural Considerations for a Self-Configuring Routing Scheme for Spontaneous Networks”, [Alvarez-Hamelin 2005]
- G. Antoniu, M. Bertier, L. Bougé, E. Caron, F. Desprez, M. Jan, S. Monnet, P. Sens : “GDS: an Architecture Proposal for a Grid Data-Sharing Service”, [Antoniu 2005a]
- G. Antoniu, M. Bertier, L. Bougé, E. Caron, F. Desprez, M. Jan, S. Monnet, P. Sens : “GDS: an Architecture Proposal for a Grid Data-Sharing Service”, [Antoniu 2005b]
- V. Beaudenon, E. Encrenaz, S. Taktak : “Data Decision Diagrams for ProMeLa Systems Analysis”, [Beaudenon 2005]
- C. Braunstein, E. Encrenaz : “CTL-property transformations along an incremental design process”, [Braunstein 2005]
- L. Dupont, D. Lazard, S. Lazard, S. Petitjean : “Near-Optimal Parameterization of the Intersection of Quadrics: I. The Generic Algorithm”, [Dupont 2005a]
- L. Dupont, D. Lazard, S. Lazard, S. Petitjean : “Near-Optimal Parameterization of the Intersection of Quadrics: II. A Classification of Pencils”, [Dupont 2005b]
- L. Dupont, D. Lazard, S. Lazard, S. Petitjean : “Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections”, [Dupont 2005c]
- S. Fechter : “Une nouvelle extension de ML avec des traits orientés objets de FOCAL”, [Fechter 2005]
- S. Fetcher, L. Liquori : “Mini-Foc A Kernel Calculus for Certified Computer Algebra [Ongoing work]”, [Fetcher 2005]
- J.‑G. Ganascia : “Rapport de l'atelier "Information, communication et connaissance" rédigé à la demande du département STIC (Sciences et Technologies de l'Information) du CNRS”, [Ganascia 2005g]
- N. Krishna, M. Shapiro, K. Bhargavan : “Exploring the consistency problem space”, [Krishna 2005b]
- A. Luna Almeida, S. Aknine, J.‑P. Briot, J. Malenfant : “Méthode de réplication basée sur les plans pour la tolérance aux pannes des systèmes multi-agents”, [Luna Almeida 2005]
- O. Marchetti, A. Munier‑Kordon : “A Sufficient Condition for the Liveness of Weighted Event Graphs”, [Marchetti 2005a]
- O. Marchetti, A. Munier‑Kordon : “Minimizing Places Storage Capacities of a Weighted Event Graph.”, [Marchetti 2005b]
- J. O'Brien, M. Shapiro : “An application Framework for Collaborative, Nomadic Applications”, 26 pages [O'Brien 2005]
- S. Orange, G. Renault, A. Valibouze : “A new tools for computing Galois Groups and Galois Ideals”, [Orange 2005a]
- M. Shapiro, Y. Berbers, W. Zwaenepoel, T. Harris : “Systems research, education and industry in Europe”, [Shapiro 2005b]
- V. Vafeiadis, M. Herlihy, T. Hoare, M. Shapiro : “Proving Correctness of Highly-Concurrent Linearisable Objects”, 20 pages [Vafeiadis 2005]
- A. Valibouze : “Corps de décomposition de groupe de Galois PSL(2,7)”, [Valibouze 2005a]
- F. Viger, M. Latapy : “Fast generation of random connected graphs with prescribed degrees”, [Viger 2005]