Pierre Valarcher

Publication Activity (10 Years)

Years Active: 1996-2012
Publications (10 Years): 0

Top Topics

Computationally Efficient

Orders Of Magnitude

Knowledge Representation

Simulated Annealing

Top Venues

Publications

Serge Grigorieff, Pierre Valarcher
Classes of Algorithms: Formalization and Comparison. Bull. EATCS 107 (2012)
Serge Grigorieff, Pierre Valarcher
Functionals Using Bounded Information and the Dynamics of Algorithms. LICS (2012)
Philippe Andary, Bruno Patrou, Pierre Valarcher
A Representation Theorem for Primitive Recursive Algorithms. Fundam. Informaticae 107 (4) (2011)
Serge Grigorieff, Pierre Valarcher
Evolving Multialgebras Unify All Usual Sequential Computation Models. STACS (2010)
David Michel, Frédéric Gervais, Pierre Valarcher
B-ASM: Specification of ASM à la B. ASM (2010)
Serge Grigorieff, Pierre Valarcher
Evolving MultiAlgebras unify all usual sequential computation models CoRR (2010)
Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher
Extending the loop language with higher-order procedural variables. ACM Trans. Comput. Log. 10 (4) (2009)
Pierre Valarcher
A complete characterization of primitive recursive intensional behaviours. RAIRO Theor. Informatics Appl. 42 (1) (2008)
Tristan Crolard, Samuel Lacas, Pierre Valarcher
On the Expressive Power of the Loop Language. Nord. J. Comput. 13 (1-2) (2006)
Philippe Andary, Bruno Patrou, Pierre Valarcher
About Implementation of Primitive Recursive Algorithms. Abstract State Machines (2005)
Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher
On maximal QROBDD's of Boolean functions. RAIRO Theor. Informatics Appl. 39 (4) (2005)
Pierre Valarcher
Intensional semantics of system T of Gödel. Electron. Notes Theor. Comput. Sci. 35 (2000)
Pierre Valarcher
Intensionality versus Extensionality and Primitive Recursion. ASIAN (1996)