11-Journaux

An Imperative Language Characterizing PTIME Algorithms. Yoann Marquer and Pierre Valarcher. CSLI (2016)
Classes of Algorithms: Formalization and Comparison. Serge Grigorieff (IRIF, Paris 7), Pierre Valarcher. European Association for Theoretical Computer Science. (2012)
A theorem of representation for primitive recursive algorithms. Philippe Andary, Bruno Patrou (LITIS, Rouen) and Pierre Valarcher. Fundamenta Informaticae (2011)
A total functional programming language that computes Primitive Recursive Algorithms. David Michel and Pierre Valarcher. Special issues of Weak Arithmetics Day (CSLI) (2009)
Extending the loop language with higher-order procedural variables. Tristan Crolard, Emmanuel Polonovsky and Pierre Valarcher. ACM Transactions on Computational Logic (Volume 10 - Number 4) (2009)
A complete characterization of primitive recursive intensional behaviours. Pierre Valarcher. RAIRO Theoretical Informatics and Applications (2008)
On the expressive power of Loop language. Tristan Crolard, Samuel Lacas and Pierre Valarcher. Nordic Journal of Computing (Volume 13) (2006)
Intensional semantics of system T of Godel. Pierre Valarcher. Workshop on Domain IV, Dagsthul, ENTCS, volume 35, (2000)

Mahler’s expansion and boolean functions. Jean-Francis Michon (LITIS, Rouen), Pierre Valarcher and Jean-Baptiste Yunès (LIAFA, Paris 7). Journal of Integer Sequences (Volume 10) (2007)
On maximal QROBDD’s boolean functions. Jean-Francis Michon (LITIS, Rouen), Pierre Valarcher and Jean-Baptiste Yunès (LIAFA, Paris 7). RAIRO - Theoretical Informatics and Applications, 39 (2005)
HFE and BDDs : A practical attempt at cryptanalysis. Jean-Francis Michon (LITIS, Rouen), Pierre Valarcher and Jean-Baptiste Yunès (LIAFA, Paris 7). Progress in Computer Science and Applied Logic (2003)