| Coopération généralisée et attracteurs au dilemme itéré du prisonnier. | 0 | 0.34 | 2021 |
| Experimental criteria to identify efficient probabilistic memory-one strategies for the iterated prisoner's dilemma. | 1 | 0.48 | 2019 |
| Stratégies probabilistes à mémoire de 1 coup au dilemme itéré du prisonnier. | 0 | 0.34 | 2018 |
| Human behavioral complexity peaks at age 25. | 4 | 0.44 | 2017 |
| Que valent les stratégies probabilistes au dilemme itéré des prisonniers ? | 0 | 0.34 | 2017 |
| Organized Complexity: is Big History a Big Computation? | 0 | 0.34 | 2016 |
| Méta-Stratégies pour le Dilemme Itéré du Prisonnier. | 0 | 0.34 | 2016 |
| Estimating the Algorithmic Complexity of Stock Markets | 0 | 0.34 | 2015 |
| Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility. | 13 | 0.96 | 2015 |
| Correspondence And Independence Of Numerical Evaluations Of Algorithmic Information Measures | 3 | 0.59 | 2013 |
| Calculating Kolmogorov Complexity From The Output Frequency Distributions Of Small Turing Machines | 32 | 2.07 | 2012 |
| Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility | 18 | 1.29 | 2012 |
| Image characterization and classification by physical complexity | 9 | 0.80 | 2012 |
| Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness | 10 | 0.72 | 2011 |
| Unpredictability and Computational Irreducibility | 1 | 0.41 | 2011 |
| Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas | 0 | 0.34 | 2011 |
| Assessing Cognitive Randomness: A Kolmogorov Complexity Approach | 2 | 0.45 | 2011 |
| An algorithmic information-theoretic approach to the behaviour of financial markets | 3 | 0.54 | 2010 |
| Image information content characterization and classification by physical complexity | 2 | 0.55 | 2010 |
| On the Algorithmic Nature of the World | 20 | 2.36 | 2009 |
| A CounterExample to Kahle-Conjecture, New Conjectures and Automated Proofs in Geometry | 1 | 0.37 | 2009 |
| Towards a stable definition of Kolmogorov-Chaitin complexity | 8 | 1.05 | 2008 |
| On the Kolmogorov-Chaitin Complexity for short sequences | 14 | 2.64 | 2007 |
| Ressemblance entre objets | 0 | 0.34 | 2003 |
| Transformation distances: a family of dissimilarity measures based on movements of segments. | 28 | 3.66 | 1999 |
| Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies | 1 | 0.39 | 1999 |
| Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma | 17 | 2.88 | 1998 |
| The transformation distance: A dissimilarity measure based an movements of segments | 13 | 7.52 | 1998 |
| Optimal representation in average using Kolmogorov complexity | 0 | 0.34 | 1998 |
| Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. | 24 | 3.86 | 1997 |
| A guaranteed compression scheme for repetitive DNA sequences | 38 | 2.79 | 1996 |
| A kind of logical compilation for knowledge bases | 6 | 0.71 | 1994 |
| A Kind of Achievement by Parts Method | 2 | 0.43 | 1994 |
| An achievement by part method to solve the incompleteness of forward chaining | 1 | 0.38 | 1993 |
| The grand loop semantics for logic programs. | 0 | 0.34 | 1992 |
| JFPL'92, 1ères Journées Francophones de Programmation Logique, 25-27 Mai 1992, Lille, France | 27 | 8.29 | 1992 |
| Unfolding, procedural and fixpoint semantics of logic programs | 15 | 0.72 | 1991 |
| Is there an axiomatic semantics for standard pure Prolog? | 0 | 0.34 | 1991 |
| The logical compilation of knowledge bases | 8 | 0.72 | 1990 |
| Operational semantics of Standard Prolog: an axiomatic approach | 1 | 0.35 | 1990 |
| A new model semantics for a program with negation | 0 | 0.34 | 1990 |
| Logique Partielle et Prolog | 0 | 0.34 | 1989 |
| Sémantique Logique Et Dénotationnelle Des Interpréteurs Prolog | 3 | 0.45 | 1988 |
| Stratégie générale d'exploration et coupe-choix. | 0 | 0.34 | 1988 |
| Différences entre la sémantique déclarative et la sémantique procédurale d'un programme Prolog avec coupe-choix | 0 | 0.34 | 1987 |
| Définitions de stratégies équitables en programmation logique | 0 | 0.34 | 1986 |
| Sur Quelques Limitations des Algorithmes Dans Le Traitement des Suites | 0 | 0.34 | 1985 |
