Sur Quelques Limitations des Algorithmes Dans Le Traitement des Suites. - Jean-Paul Delahaye (RAIRO Theor. Informatics Appl., 1985)

Définitions de stratégies équitables en programmation logique. - Jean-Paul Delahaye; P. Paradinas (SPLT, 1986)

Différences entre la sémantique déclarative et la sémantique procédurale d'un programme Prolog avec coupe-choix. - Jean-Paul Delahaye (SPLT, 1987)

Stratégie générale d'exploration et coupe-choix. - Jean-Paul Delahaye (SPLT, 1988)

Sémantique Logique Et Dénotationnelle Des Interpréteurs Prolog. - Jean-Paul Delahaye (RAIRO Theor. Informatics Appl., 1988)

Logique Partielle et Prolog. - Jean-Paul Delahaye; Philippe Mathieu (SPLT, 1989)

The Optimal Model of a Program with Negation. - Jean-Paul Delahaye; V. Thibau (JELIA, 1990)

The Logical Compilation of Knowledge Bases. - Philippe Mathieu; Jean-Paul Delahaye (JELIA, 1990)

Operational semantics of Standard Prolog: an axiomatic approach. - Jean-Paul Delahaye; François Denis (SPLT, 1990)

A new model semantics for a program with negation. - Jean-Paul Delahaye; V. Thibau (SPLT, 1990)

Unfolding, Procedural and Fixpoint Semantics of Logic Programs. - François Denis; Jean-Paul Delahaye (STACS, 1991)

Programming in Three-valued Logic. - Jean-Paul Delahaye; V. Thibau (Theor. Comput. Sci., 1991)

Is there an Axiomatic Semantics for Standard Pure Prolog. - François Denis; Jean-Paul Delahaye (Theor. Comput. Sci., 1991)

The grand loop semantics for logic programs. - Eric Wegrzynowski; Jean-Paul Delahaye (CNKBS, 1992)

An achievement by part method to solve the incompleteness of forward chaining. - Jean-Paul Delahaye; Philippe Mathieu (JFPL, 1993)

A Kind of Achievement by Parts Method. - Philippe Mathieu; Jean-Paul Delahaye (LPAR, 1994)

A Kind of Logical Compilation for Knowledge Bases. - Philippe Mathieu; Jean-Paul Delahaye (Theor. Comput. Sci., 1994)

A Guaranteed Compression Scheme for Repetitive DNA Sequences. - Eric Rivals; Jean-Paul Delahaye; Max Dauchet; Olivier Delgrange (Data Compression Conference, 1996)

Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. - Eric Rivals; Olivier Delgrange; Jean-Paul Delahaye; Max Dauchet; Marie-Odile Delorme; Alain Hénaut; Emmanuelle Ollivier (Comput. Appl. Biosci., 1997)

Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma. - Bruno Beaufils; Jean-Paul Delahaye; Philippe Mathieu (Evolutionary Programming, 1998)

The transformation distance: A dissimilarity measure based an movements of segments. - Jean-Stéphane Varré; Jean-Paul Delahaye; Eric Rivals (German Conference on Bioinformatics, 1998)

Optimal Representation in Average Using Kolmogorov Complexity. - Eric Rivals; Jean-Paul Delahaye (Theor. Comput. Sci., 1998)

Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies. - Philippe Mathieu; Bruno Beaufils; Jean-Paul Delahaye (Artificial Evolution, 1999)

Transformation distances: a family of dissimilarity measures based on movements of segments. - Jean-Stéphane Varré; Jean-Paul Delahaye; Eric Rivals (Bioinform., 1999)

The Iterated Lift Dilemma. - Jean-Paul Delahaye; Philippe Mathieu; Bruno Beaufils (Computational Conflicts, 2000)

A Stamping Technique to Increase the Error Correction Capacity of the (127, k, d) RS Code. - T. Vallino; Abbas Dandache; Jean-Paul Delahaye; Fabrice Monteiro; Bernard Lepley (IOLTW, 2000)

On the Kolmogorov-Chaitin Complexity for short sequences - Jean-Paul Delahaye; Héctor Zenil (CoRR, 2007)

Towards a stable definition of Kolmogorov-Chaitin complexity - Jean-Paul Delahaye; Hector Zenil (CoRR, 2008)

Networks of Communities and Evolution of Cooperation. - Rémi Dorat; Jean-Paul Delahaye (Int. J. Bifurc. Chaos, 2008)

On the Algorithmic Nature of the World - Hector Zenil; Jean-Paul Delahaye (CoRR, 2009)

A CounterExample to Kahle-Conjecture, New Conjectures and Automated Proofs in Geometry - Francesco De Comité; Jean-Paul Delahaye (CoRR, 2009)

Image information content characterization and classification by physical complexity - Hector Zenil; Jean-Paul Delahaye; Cédric Gaucherel (CoRR, 2010)

An algorithmic information-theoretic approach to the behaviour of financial markets - Hector Zenil; Jean-Paul Delahaye (CoRR, 2010)

Assessing Cognitive Randomness: A Kolmogorov Complexity Approach - Nicolas Gauvrit; Hector Zenil; Jean-Paul Delahaye (CoRR, 2011)

Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas - Hector Zenil; Jean-Paul Delahaye (CoRR, 2011)

Unpredictability and Computational Irreducibility - Hervé Zwirn; Jean-Paul Delahaye (CoRR, 2011)

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness. - Jean-Paul Delahaye; Hector Zenil (Appl. Math. Comput., 2012)

Image characterization and classification by physical complexity. - Hector Zenil; Jean-Paul Delahaye; Cédric Gaucherel (Complex., 2012)

Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines - Fernando Soler-Toscano; Hector Zenil; Jean-Paul Delahaye; Nicolas Gauvrit (CoRR, 2012)

Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility - Hector Zenil; Fernando Soler-Toscano; Jean-Paul Delahaye; Nicolas Gauvrit (CoRR, 2012)

Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. - Fernando Soler-Toscano; Hector Zenil; Jean-Paul Delahaye; Nicolas Gauvrit (Comput., 2013)

Estimating the algorithmic complexity of stock markets. - Olivier Brandouy; Jean-Paul Delahaye; Lin Ma 005 (Algorithmic Finance, 2015)

Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility. - Héctor Zenil; Fernando Soler-Toscano; Jean-Paul Delahaye; Nicolas Gauvrit (PeerJ Comput. Sci., 2015)

Méta-Stratégies pour le Dilemme Itéré du Prisonnier. - Jean-Paul Delahaye; Philippe Mathieu (JFSMA, 2016)

Organized Complexity: is Big History a Big Computation? - Jean-Paul Delahaye; Clement Vidal (CoRR, 2016)

Que valent les stratégies probabilistes au dilemme itéré des prisonniers ? - Jean-Paul Delahaye; Philippe Mathieu (JFSMA, 2017)

New Winning Strategies for the Iterated Prisoner's Dilemma. - Philippe Mathieu; Jean-Paul Delahaye (J. Artif. Soc. Soc. Simul., 2017)

Human behavioral complexity peaks at age 25. - Nicolas Gauvrit; Hector Zenil; Fernando Soler-Toscano; Jean-Paul Delahaye; Peter C. Brugger (PLoS Comput. Biol., 2017)

An Algorithmic Look at Financial Volatility. - Lin Ma 005; Jean-Paul Delahaye (Algorithms, 2018)

Stratégies probabilistes à mémoire de 1 coup au dilemme itéré du prisonnier. - Jean-Paul Delahaye; Philippe Mathieu (Rev. d'Intelligence Artif., 2018)

Experimental criteria to identify efficient probabilistic memory-one strategies for the iterated prisoner's dilemma. - Philippe Mathieu; Jean-Paul Delahaye (Simul. Model. Pract. Theory, 2019)

Coopération généralisée et attracteurs au dilemme itéré du prisonnier. - Jean-Paul Delahaye; Philippe Mathieu (JFSMA, 2021)

Être ou ne pas être individualiste, quelles conséquences ? - Jean-Paul Delahaye; Philippe Mathieu (Rev. Ouverte Intell. Artif., 2023)

Softening and Hardening in the Iterated Prisoner's Dilemma. - Philippe Mathieu; Jean-Paul Delahaye (IEEE Trans. Syst. Man Cybern. Syst., 2023)

Avons nous toujours besoin de stochasticité pour la simulation évolutionnaire ? - Philippe Mathieu; Jean-Paul Delahaye (JFSMA, 2024)