12-Conférences

The design of Administrative Algorithm. Groupe ALGOCIT présenté par Mikaël Cozik (LIS, UPEC) Pierre Valarcher. Workshop Social Responsability of Algorithms, (PDF) LAMSADE, Université de Dauphine (2017)
Projet AlgoCit : le cas APB, Groupe ALGOCIT présenté par Sylvie Thoron (LIPHA, UPEC) et Pierre Valarcher. Workshop MSH Paris-Saclay: le pouvoir des algorithmes. Saclay (2017)
Des algorithmes pubics aux algorithmes administratifs Groupe ALGOCIT. Le Monde (2016)

Présentation Journées calculabilité. Exposé Orléans, (2017)
An algorithmic complete programming language for a large class of algorithms computable in polynomial time Yoann Marquer and Pierre Valarcher. DICE (2015)
Topological Characterization of Gurevich Modelization of Sequential Algorithms. Serge Grigorieff (LIAFA, Paris 7) and Pierre Valarcher. LICS (2012).
B-ASM: Specification of ASM à la B. David Michel, Frédéric Gervais, and Pierre Valarcher. ABZ2010 (2010)
Evolving Multialgebras unify all kinds of sequential computation models Serge Grigorieff (LIAFA, Paris 7) and Pierre Valarcher. STACS (2010)
On the expressive power of loop language. Tristan Crolard, Samuel Lacas and Pierre Valarcher. 17th Nordic workshop on Programming Theory, Copenhague (2005)
Call-by-value and call-by-name in primitive recursion : storage operator Pierre Valarcher. 5th International Workshop on Reduction Strategies in Rewriting and Programming, Nara (Japon) (2005)
Intensional semantics of system T of Godel. Pierre Valarcher. Workshop on Domain IV, Dagsthul, ENTCS, volume 35, 2000

Analysis of HFE from BDD point of view J.F. Michon (LITIS), P. Valarcher and J.-B. Yunès (LIAFA, Paris 7) CCC’03, Chine (2003)