Extending the loop language with higher-order procedural variables T Crolard, E Polonowski, P Valarcher ACM Transactions on Computational Logic (TOCL) 10 (4), 1-37, 2009 | 15 | 2009 |
Evolving MultiAlgebras unify all usual sequential computation models S Grigorieff, P Valarcher arXiv preprint arXiv:1001.2160, 2010 | 14 | 2010 |
On the expressive power of the Loop language T Crolard, S Lacas, P Valarcher Nord. J. Comput. 13 (1-2), 46-57, 2006 | 13 | 2006 |
Classes of algorithms: Formalization and comparison S Grigorieff, P Valarcher, Y Gurevich Bulletin of EATCS 2 (107), 2013 | 9 | 2013 |
Intensionality vs extensionality and primitive recursion P Valarcher ASIAN Computing Science Conference-LNCS 1179, 1996 | 8* | 1996 |
A representation theorem for primitive recursive algorithms P Andary, B Patrou, P Valarcher Fundamenta Informaticae 107 (4), 313-330, 2011 | 7 | 2011 |
Contribution à l'étude du comportement intentionnel des algorithmes: le cas de la récursion primitive P Valarcher | 7 | 1996 |
HFE and BDDs: A practical attempt at cryptanalysis JF Michon, P Valarcher, JB Yunés Coding, Cryptography and Combinatorics, 237-246, 2004 | 5 | 2004 |
A total functional programming language that computes APRA D Michel, P Valarcher Studies in Weak Arithmetic, CSLI Lecture Notes 196, 2011 | 4 | 2011 |
A complete characterization of primitive recursive intensional behaviours P Valarcher RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2008 | 4 | 2008 |
About implementation of primitive recursive algorithms P Andary, B Patrou, P Valarcher International Workshop on Abstract State Machine, 2005 | 4 | 2005 |
Functionals using Bounded Information and the Dynamics of Algorithms S Grigorieff, P Valarcher 2012 27th Annual IEEE Symposium on Logic in Computer Science, 345-354, 2012 | 2 | 2012 |
Traces of some primitive recursive schemata R David, P Valarcher preparation, 2010 | 2* | 2010 |
Mahler’s expansion and boolean functions JF Michon, P Valarcher, JB Yunes Journal of Integer Sequences 10 (3), 34, 2007 | 2 | 2007 |
On maximal QROBDD's of Boolean functions JF Michon, JB Yunès, P Valarcher RAIRO-Theoretical Informatics and Applications 39 (4), 677-686, 2005 | 2 | 2005 |
B-ASM: Specification of ASM à la B. D Michel, F Gervais, P Valarcher ASM, 391, 2010 | 1 | 2010 |
Corollary 1 from Proposition 2. The problem SDLP+ is NP-complete. This subclass is apparently much easier than the decision problem for an arbitrary basic divisibility family. P Cégielski, S Grigorieff, J Cervelle, P Valarcher JAF 37, 2018 | | 2018 |
BFCA'06: Boolean Functions: Cryptography and Applications: Proceedings of the Conference Organized at the Université de Rouen, March 13-15th, 2006 JF Michon, P Valarcher, JB Yunès Publications des Universités de Rouen et du Havre., 2006 | | 2006 |
Call-by-name vs call-by-value in Primitive Recursion: storage operator P Valarcher 5th International Workshop on Reduction Strategies in Rewriting and Programming, 2005 | | 2005 |
Fonctions booléennes/Boolean Functions: Cryptographie, applications/Cryptography, Applications vol. 2 JF Michon, P Valarcher, JB Yunès Presses universitaires de Rouen et du Havre, 2005 | | 2005 |