Jean-Paul Delahaye | Academic Influence

Jean-Paul Delahaye's AcademicInfluence.com Rankings

Jean-Paul Delahaye

Computer Science

#1250

World Rank

#1290

Historical Rank

computer-science Degrees

Jean-Paul Delahaye

Mathematics

#2933

World Rank

#4421

Historical Rank

Measure Theory

#4184

World Rank

#4929

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Jean-Paul Delahaye Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jean-Paul Delahaye is a French computer scientist and mathematician. Career Delahaye has been a professor of computer science at the Lille University of Science and Technology since 1988 and a researcher in the school's computer sciences lab since 1983. Since 1991 he has written a monthly column in Pour la Science, the French version of Scientific American, dealing with mathematical games and recreations, logic, and computer science. He is a contributing author of the online scientific journal Interstices and a science and mathematics advisor to the Encyclopædia Britannica.

(See a Problem?)

Jean-Paul Delahaye's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines (2012) (149)
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness (2011) (125)
A guaranteed compression scheme for repetitive DNA sequences (1996) (123)
Sequence Transformations (1988) (84)
Our Meeting with Gradual, A Good Strategy for the Iterated Prisoner's Dilemma (1996) (74)
Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences (1997) (72)
The science behind Sudoku. (2006) (71)
Transformation distances: a family of dissimilarity measures based on movements of segments (1999) (71)
On the Algorithmic Nature of the World (2009) (53)
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures (2012) (49)
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility (2012) (47)
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility (2012) (47)
Annex 1 The continuities of the point-to-set maps, definitions and equivalences (1979) (46)
Algorithmic complexity for short binary strings applied to psychology: a primer (2011) (46)
Human behavioral complexity peaks at age 25 (2017) (42)
Compression and genetic sequence analysis. (1996) (40)
On the Kolmogorov-Chaitin Complexity for short sequences (2007) (40)
The Set of Logarithmically Convergent Sequences Cannot be Accelerated (1982) (39)
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma (1998) (37)
Image characterization and classification by physical complexity (2010) (32)
The transformation distance: A dissimilarity measure based an movements of segments (1998) (28)
French Roadmap for complex Systems 2008-2009 (2009) (28)
Unfolding, Procedural and Fixpoint Semantics of Logic Programs (1991) (26)
Formal methods in artificial intelligence (1987) (26)
Fast Discerning Repeats in DNA Sequences with a Compression Algorithm (1997) (25)
New Winning Strategies for the Iterated Prisoner's Dilemma (2015) (25)
An Algorithmic Information Theoretic Approach to the Behaviour of Financial Markets (2010) (23)
Convergence Acceleration by Extraction of Linear Subsequences (1983) (22)
Unpredictability and Computational Irreducibility (2011) (20)
Towards a stable definition of Kolmogorov-Chaitin complexity (2008) (16)
A first step toward chromosome analysis by compression algorithms (1995) (15)
Complex Strategies in the Iterated Prisoner's Dilemma (1994) (14)
Programming in Three-valued Logic (1991) (14)
Universal Ethics: Organized Complexity as an Intrinsic Value (2019) (14)
Algorithmic Complexity of Financial Motions (2014) (14)
Updated physics performance of the ESSnuSB experiment (2021) (13)
Automatic selection of sequence transformations (1981) (13)
Scatter and regularity imply Benford's law... and more (2009) (12)
Generalized Benford’s Law as a Lie Detector (2017) (12)
Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies (1999) (11)
Image information content characterization and classification by physical complexity (2010) (10)
A Kind of Logical Compilation for Knowledge Bases (1994) (10)
The Logical Compilation of Knowledge Bases (1990) (10)
Computational Conflicts: Conflict Modeling for Distributed Intelligent Systems (2000) (9)
Randomness, Unpredictability and Absence of Order: The Identification by the Theory of Recursivity of the Mathematical Notion of Random Sequence (1993) (7)
Organized Complexity: is Big History a Big Computation? (2016) (7)
Estimating the Algorithmic Complexity of Stock Markets (2011) (6)
Adaptive Behaviour in the Classical Iterated Prisoner's Dilemma (2001) (6)
The Transformation Distance (1997) (6)
The Iterated Lift Dilemma (2000) (5)
Experimental criteria to identify efficient probabilistic memory-one strategies for the iterated prisoner's dilemma (2019) (5)
The Set of Periodic Points (1981) (5)
Random Strategies in a Two Level Iterated Prisoner's Dilemma: How to Avoid Conflicts (1996) (4)
Doppler ultrasonography devices, including elastography, allow for accurate diagnosis of severe liver fibrosis. (2018) (4)
An Algorithmic Look at Financial Volatility (2018) (4)
A Counterexample Concerning Iteratively Generated Sequences (1980) (4)
The Martin-Löf Thesis: The Identification by Recursion Theory of the Mathematical Notion of Random Sequence (2011) (4)
Assessing Cognitive Randomness: A Kolmogorov Complexity Approach (2011) (4)
Automated Proofs in Geometry : Computing Upper Bounds for the Heilbronn Problem for Triangles (2009) (4)
La conjecture de Syracuse (1998) (3)
A Kind of Achievement by Parts Method (1994) (3)
Geometric and Artistic Graphics (1986) (3)
Sloane's Gap. Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS ? (2011) (3)
For which Bases Forward Chaining is Sufficient (1990) (3)
A computational definition of financial randomness (2014) (2)
A CounterExample to Kahle-Conjecture, New Conjectures and Automated Proofs in Geometry (2009) (2)
The Iterated Lift Dilemma: how to establish meta-cooperation with your opponent (2000) (2)
Networks of Communities and Evolution of Cooperation (2008) (1)
La malédiction de la mauvaise file (2012) (1)
On the Kolmogorov Complexity for Short Sequences (2007) (1)
An achievement by part method to solve the incompleteness of forward chaining (1993) (1)
Geometric and Artistic Graphics: Design Generation with Microcomputers (1986) (1)
Un algorithme à un million de dollars (2005) (1)
The Lift Dilemma or How to Establish Meta-Cooperation with your Opponent (1996) (1)
The Mathematics of (Hacking) Passwords (2019) (1)
Optimal Representation in Average Using Kolmogorov Complexity (1998) (1)
La importancia de ser imperfecto (1994) (1)
Automated Proof in Geometry: Computing Upper Bounds for the Heilbronn Problem for Triangle (2010) (1)
Operational semantics of Standard Prolog: an axiomatic approach (1990) (1)
Le fossé de Sloane (2011) (1)
Fast Discerning Repeats in DNA Sequenceswith a Compression (1997) (1)
Regular Polygons, Stars etc (1986) (0)
NewWinning Strategies for the Iterated Prisoner’s Dilemma (2017) (0)
Is there an Axiomatic Semantics for Standard Pure Prolog (1991) (0)
Folded Paper Dragons (1986) (0)
The Various Kinds of Algorithmic Sequence Transformations (1988) (0)
Freemasons and School Secularization: Myth and Reality (2006) (0)
Decisions taken at the 47th meeting held on 28 and 29 March 2000 (2000) (0)
Chance, Complexity and the Idea of a Universal Ethics (0)
Geometric & artistic graphics using BASIC (1986) (0)
Designs Using Data (1986) (0)
A new model semantics for a program with negation (1990) (0)
The Optimal Model of a Program with Negation (1990) (0)
P = NP, un problème à un million de dollars ? (2007) (0)
Abductive reasoning in three-valued logic for knowledge bases (1994) (0)
Accelerating The Convergence of Linear Sequences (1988) (0)
Aux origines de lautonomie des tablissements (2015) (0)
Reviewers for Volume 21 (2008) (0)
Non-Accelerable Families of Sequences (1988) (0)
CHAPTER 11 The Iterated Lift Dilemma (0)
Decisions taken at the 46th meeting held on 25 January 2000 (2000) (0)
The Partially Ordered Systems of Accelerable Families (1988) (0)
The Comprehensive School: A typical example of the difficulty in governing education (2007) (0)
Algorithmic complexity for short binary strings applied to psychology: a primer (2013) (0)
Softening and Hardening in the Iterated Prisoner’s Dilemma (2023) (0)
Imaginary Coloring (2006) (0)
Decidability and Undecidability in the Limit (1988) (0)
Algorithms for Extracting Convergent Subsequences (1988) (0)
Past Exhibitors ACSM ’ s 50 th Anniversary Year — (2006) (0)
A short note on number preference (2011) (0)
The Third Dimension (1986) (0)
Septembre / Octobre 2000 Shortcuts in Proof (2013) (0)
The grand loop semantics for logic programs (1992) (0)

This paper list is powered by the following services:

Other Resources About Jean-Paul Delahaye

en.wikipedia.org

What Schools Are Affiliated With Jean-Paul Delahaye?

Jean-Paul Delahaye is affiliated with the following schools:

Lille University of Science and Technology

Image Attributions

Image Source for Jean-Paul Delahaye