Author Description

Login to generate an author description

Ask a Question About This Mathematician

All published works (181)

Action Title Date Authors
The Cluster Structure Function 2023-04-05 Andrew R. Cohen Paul Vitányi
The cluster structure function 2022-01-01 Andrew R. Cohen Paul Vitányi
Web Similarity in Sets of Search Terms Using Database Queries 2020-05-01 Andrew R. Cohen Paul Vitányi
How Incomputable Is Kolmogorov Complexity? 2020-04-03 Paul Vitányi
Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines 2019-01-27 Paul Vitányi
+
An Introduction to Kolmogorov Complexity and Its Applications 2019-01-01 Ming Li Paul Vitányi
Algorithmic Probability 2019-01-01 Ming Li Paul Vitányi
+
Algorithmic Prefix Complexity 2019-01-01 Ming Li Paul Vitányi
On the average‐case complexity of Shellsort 2017-11-13 Paul Vitányi
Identification of Probabilities 2017-08-04 Paul Vitányi Nick Chater
Exact Expression For Information Distance 2017-03-25 Paul Vitányi
Identification of probabilities 2016-12-26 Paul Vitányi Nick Chater
Web Similarity 2015-02-20 Andrew R. Cohen Paul Vitányi
On The Average-Case Complexity of Shellsort 2015-01-26 Paul Vitányi
On The Average-Case Complexity of Shellsort 2015-01-01 Paul Vitányi
Normalized Compression Distance of Multisets with Applications 2014-11-26 Andrew R. Cohen Paul Vitányi
Exact Expression For Information Distance 2014-10-27 Paul Vitányi
Review of Expressions For Information Distance 2014-10-27 Paul Vitányi
A Fast Quartet Tree Heuristic for Hierarchical Clustering 2014-09-12 Rudi Cilibrasi Paul Vitányi
Exact Expression For Information Distance 2014-01-01 Paul Vitányi
A Fast Quartet Tree Heuristic for Hierarchical Clustering 2014-01-01 Rudi Cilibrasi Paul Vitányi
+
Conditional Kolmogorov complexity and universal probability 2013-07-18 Paul Vitányi
Language learning from positive evidence, reconsidered: A simplicity-based approach 2013-01-18 Anne Hsu Nick Chater Paul Vitányi
On the logical depth function 2013-01-01 Luís Antunes André Souto Andréia Teixeira Paul Vitányi
Normalized Google Distance of Multisets with Applications 2013-01-01 Andrew R. Cohen Paul Vitányi
Language Learning From Positive Evidence, Reconsidered: A Simplicity‐Based Approach 2013-01-01 Anne Hsu Nick Chater Paul Vitányi
Algorithmic Identification of Probabilities 2013-01-01 Paul Vitányi Nick Chater
Language learning from positive evidence, reconsidered: A simplicity-based approach 2013-01-01 Anne Hsu Nick Chater Paul Vitányi
On Logical Depth and the Running Time of Shortest Programs 2013-01-01 Luís Antunes André Souto Paul Vitányi
Normalized Compression Distance of Multiples 2012-12-22 Andrew R. Cohen Paul Vitányi
Tolstoy’s Mathematics in War and Peace 2012-12-05 Paul Vitányi
Conditional Kolmogorov Complexity and Universal Probability 2012-06-05 Paul Vitányi
Information Distance: New Developments 2012-01-05 Paul Vitányi
Turing Machines and Understanding Computational Complexity 2012-01-05 Paul Vitányi
Identification of Probabilities of Languages 2012-01-01 Paul Vitányi Nick Chater
Information Distance: New Developments 2012-01-01 Paul Vitányi
Conditional Kolmogorov Complexity and Universal Probability 2012-01-01 Paul Vitányi
Turing Machines and Understanding Computational Complexity 2012-01-01 Paul Vitányi
Compression-based Similarity 2011-10-20 Paul Vitányi
The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis 2011-06-08 Anne Hsu Nick Chater Paul Vitányi
On Empirical Entropy 2011-03-30 Paul Vitányi
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising 2011-02-11 Steven de Rooij Paul Vitányi
Compression-based Similarity 2011-01-01 Paul Vitányi
On Empirical Entropy 2011-01-01 Paul Vitányi
A Fast Quartet tree heuristic for hierarchical clustering 2010-10-07 Rudi Cilibrasi Paul Vitányi
Ray Solomonoff, Founding Father of Algorithmic Information Theory 2010-07-20 Paul Vitányi
Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity 2010-06-23 Nikolay Vereshchagin Paul Vitányi
Information Distance 2010-06-17 Charles H. Bennett Péter Gács Ming Li Paul Vitányi Wojciech H. Zurek
The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis 2010-06-16 Anne Hsu Nick Chater Paul Vitányi
Normalized Information Distance is Not Semicomputable 2010-01-01 Sebastiaan A. Terwijn Leen Torenvliet Paul Vitányi

Commonly Cited References

Action Title Date Authors # of times referenced
+
An Introduction to Kolmogorov Complexity and Its Applications 2019-01-01 Ming Li Paul Vitányi 70
Clustering by Compression 2005-04-01 Rudi Cilibrasi Paul Vitányi 23
+
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS 1970-12-31 Alexander K. Zvonkin Leonid A. Levin 19
+
The definition of random sequences 1966-12-01 Per Martin-Löf 15
Minimum description length induction, Bayesianism, and Kolmogorov complexity 2000-03-01 Paul Vitányi Ming Li 13
Kolmogorov's Structure Functions and Model Selection 2004-11-30 Nikolay Vereshchagin Paul Vitányi 12
Algorithmic statistics 2001-01-01 Péter Gács John Tromp Paul Vitányi 10
+
On the mathematical foundations of theoretical statistics 1922-01-01 Ronald Aylmer Fisher 9
+
On the Defect of Randomness of a Finite Object with Respect to Measures with Given Complexity Bounds 1988-01-01 Vladimir V. V’yugin 9
Language Trees and Zipping 2002-01-01 Dario Benedetto Emanuele Caglioti Vittorio Loreto 9
+
Kolmogorov Complexity, Data Compression, and Inference 1985-01-01 Thomas M. Cover 8
Reversibility and adiabatic computation: trading time and space for energy 1996-04-09 Ming Li Paul Vitányi 7
+
Combinatorial foundations of information theory and the calculus of probabilities 1983-08-31 A. N. Kolmogorov 7
+
Discussion on Kolmogorov Complexity and Statistical Analysis 1999-04-01 Alexander Shen 7
New applications of the incompressibility method: Part II 2000-03-01 Harry Buhrman Tao Jiang Ming Li Paul Vitányi 6
+
Shellsort with three increments 1997-01-01 Svante Janson Donald E. Knuth 6
+
Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences 1999-04-01 Vladimir V. V’yugin 6
+
Randomness conservation inequalities; information and independence in mathematical theories 1984-04-01 Leonid A. Levin 6
‘Ideal learning’ of natural language: Positive results about learning from positive evidence 2007-01-02 Nick Chater Paul Vitányi 6
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 1997-10-01 Peter W. Shor 6
A lower bound on the average-case complexity of shellsort 2000-09-01 Tao Jiang Ming Li Paul Vitányi 5
Analysis of Shellsort and related algorithms 1996-01-01 Robert Sedgewick 5
On the Google-fame of scientists and other populations 2005-01-01 James P. Bagrow 5
Sorting Using Networks of Queues and Stacks 1972-04-01 Robert E. Tarjan 5
Algorithmic statistics 2017-11-02 Alexander Shen Vladimir Uspensky Nikolay Vereshchagin 5
+
A variant of the Kolmogorov concept of complexity 1969-12-01 D.W. Loveland 5
+
The Ergodic Theory of Subadditive Stochastic Processes 1968-09-01 J. F. C. Kingmán 5
+
A variational problem for random Young tableaux 1977-11-01 Bill Logan L. A. Shepp 5
Reversible simulation of irreversible computation 1998-09-01 Ming Li John Tromp Paul Vitányi 4
+
Geometric Proofs of Some Recent Results of Yang Lu 1993-10-01 Grant Cairns Margaret McIntyre John Strantzen 4
+
On a Problem of Heilbronn, III 1972-09-01 K. F. Roth 4
+
Nonmetric multidimensional scaling: A numerical method 1964-06-01 Joseph B. Kruskal 4
Hierarchical Clustering Based on Mutual Information 2003-01-01 Alexander Kraskov Harald Stögbauer Ralph G. Andrzejak Peter Grassberger 4
+
Developments in Heilbronn's triangle problem 1976-12-01 K. F. Roth 4
+
On a Problem of Heilbronn 1951-07-01 K. F. Roth 4
Analyzing worms and network traffic using compression 2007-03-20 Stephanie Wehner 4
+
On Heilbronn's Triangle Problem 1981-12-01 János Komlós J. Pintz Endre Szemerédi 4
Kolmogorov complexity arguments in combinatorics 1994-05-01 Ming Li Paul Vitányi 4
Lecture notes on descriptional complexity and randomness 2021-01-01 Péter Gács 4
+
Maximizing the Smallest Triangle made by <i>N</i> Points in a Square 1972-05-01 Michael Goldberg 4
+
Partitions of planar sets into small triangles 1985-11-01 Andrew Odlyzko J. Pintz Kenneth B. Stolarsky 4
+
A Lower Bound for Heilbronn'S Problem 1982-02-01 János Komlós J. Pintz Endre Szemerédi 4
Shannon Information and Kolmogorov Complexity 2004-01-01 Peter Grünwald Paul Vitányi 4
+
On a Problem of Heilbronn† 1972-04-01 Wolfgang M. Schmidt 4
Statistical properties of finite sequences with high Kolmogorov complexity 1994-07-01 Ming Li Paul M. B. Vit�nyi 3
+
PROBLEMS AND RESULTS IN COMBINATORIAL GEOMETRY<i>a</i> 1985-05-01 Paul Erdős 3
A Fast Quartet tree heuristic for hierarchical clustering 2010-10-07 Rudi Cilibrasi Paul Vitányi 3
The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis 2011-06-08 Anne Hsu Nick Chater Paul Vitányi 3
+
Learning about the Parameter of the Bernoulli Model 1997-08-01 Vladimir Vovk 3
Normalized Compression Distance of Multisets with Applications 2014-11-26 Andrew R. Cohen Paul Vitányi 3