- Review by Paul M.B.Vitanyi, CWI, Amsterdam, The Netherlands.
- Distrib. Comput. (2002) 15: 127135 c Springer-Verlag 2002
- AverageCase Complexity of Shellsort (Preliminary Version)
- Reversible Simulation of Irreversible Computation Ming Li \Lambda Paul Vit'anyi y
- New Applications of the Incompressibility Method Tao Jiang \Lambda
- Counting Is Easy y Joel I. Seiferas
- Two Heads are Better than Two Tapes Tao Jiang, Joel I. Seiferas, and Paul M. B. Vit anyi
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 4, JULY 1998 1407 Information Distance
- Average Case Complexity under the Universal Distribution Equals Worst Case Complexity
- AverageCase Analysis Using Kolmogorov Ming Li \Lambda
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Distributed MatchMaking Sape J. Mullender
- NonSequential Computation and Laws of Nature Paul M.B. Vit
- IEEE TRANSACTIONS ON INFORMATION THEORY 1 Quantum Kolmogorov Complexity Based on
- Scientific American: Chain Letters and Evolutionary Histories ... http://www.sciam.com/article.cfm?articleID=0003D4761852... 1 of 1 06/26/2003 03:03 PM
- The Miraculous Universal Distribution Walter Kirchherr \Lambda
- This article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the
- AN OPTIMAL SIMULATION OF COUNTER MACHINES: THE ACM CASE Paul M.B. Vitanyi
- Kolmogorov Complexity Arguments in Combinatorics
- Randomized WaitFree Naming Alessandro Panconesi
- KOLMOGOROV RANDOM GRAPHS AND THE INCOMPRESSIBILITY METHOD
- The Average-Case Area of Heilbronn-Type Triangles
- CORRECTED VERSION OF: IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO 4, APRIL 2005, 15231545 1 Clustering by Compression
- Errata to "Atomic Shared Register Access by asynchronous Hardware," Paul M.B. Vitanyi
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Reversibility and Adiabatic Computation: Trading Time and Space for Energy \Lambda
- Waitfree TestandSet (Extended Abstract)
- Computational Depth of Infinite Strings Revisited Luis Antunes
- Mathematical Theory of Thermodynamics of Computation
- AverageCase Analysis of Algorithms Using Kolmogorov Complexity \Lambda
- Algorithms 2010, 3, 260-264; doi:10.3390/algor3030260 ISSN 1999-4893
- Distrib. Comput. (1998) 11: 113124 c Springer-Verlag 1998
- The Power of the Queue Ming Li, \Lambda Luc Longpr'e y and Paul Vit'anyi z
- March 2011 IEEE Information Theory Society Newsletter Raymond J. Solomonoff 19262009
- Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 4, APRIL 2011 2451 Information Distance in Multiples
- Probabilistic language acquisition 1 Running Head: PROBABILISTIC ANALYSIS OF LANGUAGE ACQUISITION
- 3438 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 7, JULY 2010 Rate Distortion and Denoising of Individual
- ARTICLE IN PRESS IPL:4146 Please cite this article in press as: E.G. Daylight et al., Time-bounded incompressibility of compressible strings and sequences, Information Processing
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 1, JANUARY 2009 1 Approximation of the Two-Part MDL Code
- Theory Comput Syst (2009) 45: 724739 DOI 10.1007/s00224-009-9171-0
- Digital Object Identifier (DOI) 10.1007/s00446-005-0121-z Distrib. Comput. (2005)
- Shannon Information and Kolmogorov Complexity Peter Grunwald and Paul Vitanyi
- Sharpening Occam's Razor Department of Computer Science, Univ. California Santa Barbara, CA 93106,
- Simplicity: A unifying principle in cognitive science? Nick Chater
- International Journal of Pharmaceutics 257 (2003) 3339 Drug output of unvented jet nebulizers as a function of time
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 6, SEPTEMBER 2001 2443 Algorithmic Statistics
- 2464 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 6, SEPTEMBER 2001 Quantum Kolmogorov Complexity Based on
- 446 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 2, MARCH 2000 Minimum Description Length Induction,
- Automatic Extraction of Meaning from the Web Rudi Cilibrasi
- UncorrectedProof BookID 158270 ChapID 03 Proof# 1 -24/09/08
- 1 Algorithmic Chaos and the Incompressibility Method 3 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
- Algorithmic Information Theory Peter D. Grunwald
- Kao: Encyclopedia of Algorithms --Entry --// --: --page --LE-TEX Registers 1
- LE CHAOS ALGORITHMIQUE ET LA MTHODE
- Advances in Minimum Description Length: Theory and Applications
- Preface to the First Edition : : : : : : : : : : : : : : : : : : : : v How to Use This Book : : : : : : : : : : : : : : : : : : : viii
- The Power and Perils of MDL Pieter Adriaans
- A Great Mind Paul Vitanyi
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Statistical Properties of Finite Sequences with High Kolmogorov Complexity
- Philosophical Issues in Kolmogorov Complexity Ming Li \Lambda
- Time and Space Bounds for Reversible Simulation ?
- Multiprocessor Architectures and Physical Law Paul Vit'anyi \Lambda
- Towards an Algorithmic Statistics (Extended Abstract)
- Mutual Search [Extended Abstract]
- Randomized Naming Using WaitFree Shared Variables \Lambda Alessandro Panconesi y
- SPACE-EFFICIENT ROUTING TABLES FOR ALMOST ALL NETWORKS AND THE INCOMPRESSIBILITY METHOD
- IEEE Information Theory Society Newsletter March 2011 March 2011 IEEE Information Theory Society Newsletter
- Locality, Communication, and Interconnect Length in Multicomputers (Revised & Expanded)
- Theory of Thermodynamics of Computation Ming Li \Lambda Paul Vit'anyi y
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. XX, NO Y, MONTH 2001 1 Algorithmic Statistics
- AverageCase Analysis Using Kolmogorov Ming Li \Lambda
- Optimality of WaitFree Atomic Multiwriter Computer Science Department, Waterloo University
- The Erdos Graph and the Beast Paul M.B. Vitanyi
- Model Selection for Neural Networks: Comparing MDL and NIC
- Simple Multireader Registers using TimeStamp (Extended Abstract)
- 49Cilibrasi, Vitanyi, and de Wolf Computer Music Journal, 28:4, pp. 4967, Winter 2004
- Automatic Meaning Discovery Using Google Rudi Cilibrasi
- Bibliography Cloninger C R, Sigvardsson S, Bohman M 1996 Type I and type
- Kolmogorov Complexity and Information Theory with an interpretation in terms of questions and answers
- Inductive Reasoning and Kolmogorov Complexity University of Waterloo, Department of Computer Science
- The Expected Size of Heilbronn's Triangles Tao Jiang \Lambda
- The Incompressibility Method ? Tao Jiang 1 , Ming Li 2 , and Paul Vit'anyi 3
- The Quantum Computing Challenge Paul Vit'anyi ?
- A Discipline of Evolutionary Programming 1 Paul Vit'anyi 2
- On Prediction by Data Compression ? Paul Vit'anyi 1 and Ming Li 2
- Kolmogorov Random Graphs \Lambda Harry Buhrman y
- Simplicity, Information, Kolmogorov Complexity, and Prediction
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 12, DECEMBER 2004 3265 Kolmogorov's Structure Functions
- Similarity of Objects and the Meaning of Words Rudi Cilibrasi and Paul Vitanyi
- ON TWOTAPE REALTIME COMPUTATION AND QUEUES* Paul M.B. Vitanyi
- Theories of Learning Ming Li \Lambda
- How to Share Concurrent WaitFree Variables Ming Li \Lambda
- Turing Machines and Understanding Computational Paul M.B.Vitanyi
- On Algorithmic Rate-Distortion Function Nikolai Vereshchagin
- Learning OnLine Handwritten Characters \Lambda Qiong Gao y
- A Randomized Algorithm for TwoProcess WaitFree TestandSet
- New Applications of the Incompressibility Method: Part II Harry Buhrman \Lambda
- Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection
- Ideal MDL and Its Relation To Bayesianism 1 Paul Vit'anyi
- On a Generalized Ruin Problem Kazuyuki Amano 1 , John Tromp 2 , Paul M.B. Vit anyi 3 , and Osamu Watanabe 4
- Computational Machine Learning in Theory and Praxis ?
- A Discipline of Evolutionary Programming 1 Paul Vitanyi 2
- Physics and the New Computation Paul Vit'anyi ?
- Information Distance \Lambda Charles H. Bennett y P'eter G'acs z Ming Li x
- Tape versus Queue and Stacks: The Lower Bounds
- Time, Space, and Energy in Reversible Computing Paul Vitanyi
- Journal of Mathematical Psychology 51 (2007) 135163 `Ideal learning' of natural language: Positive results about
- Distributed Elections In An Archimedean Ring Of Processors* (Preliminary Version)
- Atomic Multireader Register L.M. Kirousis 1, 2 , E. Kranakis 1 and P.M.B. Vit (fmanyi 1
- POUR LA SCIENCE -N 316 FVRIER 2004 orsque vous rptez une histoire qu'on vient de
- ITW 2005, Rotorua, New Zealand, 29th Aug. -1st Sept. 2005 Universal Similarity
- Rudi L. Cilibrasi and Paul M.B. Vitanyi 1 Normalized Web Distance
- Area Penalty for Sublinear Signal Propagation Delay on Chip* (Preliminary Version)
- Paul Vit'anyi \Lambda CWI and Universiteit van Amsterdam
- Learning Simple Concepts Under Simple Distributions Computer Science Department, University of Waterloo
- MATHEMATICAL BIOSCIENCES 18, 23-54 (1973) 23 Sexually Reproducing Cellular Automata *
- Mutual Search HARRY BUHRMAN
- About the Lifespan of Peer to Peer Networks Rudi Cilibrasi1
- Atomic Shared Register Access by Asynchronous Hardware
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 10, OCTOBER 2006 4617 Correspondence
- Preface to the First Edition
- Artificial Intelligence 121 (2000) 129 Applying MDL to learn best model granularity 6
- Algorithmic Arguments in Physics of Computation
- Reversible Simulation of Irreversible Computation ? Department of Computer Science, University of Waterloo, Waterloo, Ont. N2L
- A New Approach to Formal Language Theory by Kolmogorov Complexity \Lambda
- Individual Communication Complexity Harry Buhrman Hartmut Klauck y Nikolai Vereshchagin z Paul Vit anyi x
- BOLYAI SOCIETY Entropy, Search, Complexity, pp. 209232. MATHEMATICAL STUDIES, 16
- A Lower Bound on the Average-Case Complexity of University of California, Riverside, California
- The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis
- Compression-based Similarity Paul M.B. Vitanyi
- Information Distance: New Developments Paul M.B. Vitanyi
- Similarity and Denoising Paul M.B. Vitanyi
