• 
  Stéphane Devismes, Pascal Lafourcade. Un jour sans fin. ALGOTEL 2021 — 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2021, La Rochelle, France. ⟨hal-03205279⟩
• 
  E. Elyasi, A. Perrier, M. Bailet, Yohan Payan. Techniques to Reduce The Computational Cost of Finite Element Models of the Lower Limb Muscles. 14th World Congress in Computational Mechani WCCM-ECCOMAS Congress, Jan 2021, Paris (virtual), France. ⟨10.23967/wccm-eccomas.2020.332⟩. ⟨hal-03204176⟩
• 
  Jean-Claude Bermond, Philippe Michallon, Denis Trystram. Broadcasting in wraparound meshes with parallel monodirectional links. Parallel Computing, Elsevier, 1992, 18 (6), pp.639-648. ⟨10.1016/0167-8191(92)90004-Q⟩. ⟨hal-03203497⟩
• 
  Stéphane Demri, Ph. Schnoebelen. The complexity of propositional linear temporal logics in simple cases. Annual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Jan 1998, Paris, France. pp.61-72, ⟨10.1007/BFb0028549⟩. ⟨hal-03199998⟩
• 
  Stéphane Demri, Rajeev Goré. Cut-Free Display Calculi for Nominal Tense Logics. Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX '99, Saratoga Springs, NY, Neil Murray, Jun 1999, Saratoga Springs, United States. pp.155-170, ⟨10.1007/3-540-48754-9_16⟩. ⟨hal-03201530⟩
• 
  Stéphane Demri, Rajeev Goré. Tractable Transformations from Modal Provability Logics into First-Order Logic. 16th International Conference on Automated Deduction Trento, Italy, Harald Ganzinger, Jul 1999, Trento, Italy. pp.16-30, ⟨10.1007/3-540-48660-7_2⟩. ⟨hal-03201407⟩
• 
  Stéphane Demri, Ewa Orlowska. Informational representability: Abstract models versus concrete models.. Didier Dubois; Henri Prade; Erich Peter Klement. Fuzzy sets, Logics and Reasoning about Knowledge, 15, Springer, pp.301--314, 1999, Applied Logic Series, 978-94-017-1652-9. ⟨10.1007/978-94-017-1652-9_20⟩. ⟨hal-03201138⟩
• 
  Chantal Dumestre-Pérard, Nicole Thielens. Anti-Ficolin-2 and Anti-Ficolin-3 Autoantibody Detection by ELISA. Methods in Molecular Biology, Humana Press/Springer Imprint, 2021, 2227, pp.121-132. ⟨10.1007/978-1-0716-1016-9_12⟩. ⟨hal-03200976⟩
• 
  Cyril Six, Léo Gourdin, Sylvain Boulmé, David Monniaux. Verified Superblock Scheduling with Related Optimizations. 2021. ⟨hal-03200774⟩
• 
  Stéphane Demri, Ewa Orlowska. Complementarity Relations: Reduction of Decision Rules and Informational Representability. Lech Polkowski; Andrzej Skowron. Rough Sets in Knowledge Discovery 1 -- Methodology and Applications, pp.99-106, 1998, 978-3-7908-1884-0. ⟨hal-03195328⟩
• 
  Stéphane Demri, Ewa Orlowska. Informational representability of models for information logics. Ewa Orlowska. Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, Physica Verlag, pp.383-409, 1999, 978-3-7908-1864-2. ⟨hal-03195297⟩
• 
  Sebastian Altmeyer, Björn Lisper, Claire Maiza, Jan Reineke, Christine Rochange. WCET and Mixed-criticality: How to Quantify the Confidence in WCET Estimations?. Workshop on Worst-Case Execution Time Analysis, Jul 2015, Lund, Sweden. pp.65--74, ⟨10.4230/OASIcs.WCET.2015.65⟩. ⟨hal-03193103⟩
• 
  Stéphane Demri. Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?. International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX'99), Jun 1999, Saratoga Springs, United States. pp.140-155, ⟨10.1007/3-540-48754-9_15⟩. ⟨hal-03195331⟩
• 
  Stéphane Demri, Beata Konikowska. Relative Similarity Logics are Decidable: Reduction to FO2 with Equality. European Workshop on Logics in Artificial Intelligence (JELIA'98), Jurgen Dix; Luis Farinas del Cerro; Ulrich Furbach, Oct 1998, Dagstuhl, Germany. pp.279-293, ⟨10.1007/3-540-49545-2_19⟩. ⟨hal-03195324⟩
• 
  Stéphane Demri, Jaroslaw Stepaniuk. Computational Complexity of Multimodal Logics Based on Rough Sets. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2000, 44 (4), pp.373-396. ⟨hal-03195322⟩
• 
  Philippe Balbiani, Stéphane Demri. Prefixed Tableaux Systems for Modal Logics with Enriched Languages. 15th International Joint Conference on Artificial Intelligence (IJCAI'97), Aug 1997, Nagoya, Japan. pp.190-195. ⟨hal-03195295⟩
• 
  Stéphane Demri. Complexity of Simple Dependent Bimodal Logics. International Conference, TABLEAUX 2000, St Andrews, Scotland, Roy Dyckhoff, Jul 2000, St Andrews, United Kingdom. pp.190-204, ⟨10.1007/10722086_17⟩. ⟨hal-03195235⟩
• 
  Stéphane Demri. A simple tableau system for the logic of elsewhere. 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX '96), May 1996, Palerme, Italy. pp.177-192, ⟨10.1007/3-540-61208-4_12⟩. ⟨hal-03195223⟩
• 
  Stéphane Demri, Rajeev Goré. An O((n.log n) 3 )-time transformation from Grz into decidable fragments of classical first-order logic. International Workshop on First order Theorem Proving (FTP'98), Ricardo Caferra; Gernot Salzer, Nov 1998, Vienna, Austria. pp.153-167. ⟨hal-03195009⟩
• 
  Stéphane Demri, Rajeev Goré. Display Calculi for Logics with Relative Accessibility Relations. Journal of Logic, Language and Information, Springer Verlag, 2000, 9 (2), pp.213-236. ⟨10.1023/A:1008341521750⟩. ⟨hal-03194849⟩

3 824

3 543