Paul M. B. Vitányi

254 papers A* 24A 6B 17C 1Misc 3Journal 165Unranked 25

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	The Cluster Structure Function. IEEE Trans. Pattern Anal. Mach. Intell. Andrew R. Cohen, Paul M. B. Vitányi
2022	J	`jnl`	Fast Phylogeny of SARS-CoV-2 by Compression. Entropy Rudi Cilibrasi, Paul M. B. Vitányi
2022	J	`jnl`	The cluster structure function. CoRR Andrew R. Cohen, Paul M. B. Vitányi
2020	J	`jnl`	How Incomputable Is Kolmogorov Complexity? Entropy Paul M. B. Vitányi
2020	J	`jnl`	Web Similarity in Sets of Search Terms Using Database Queries. SN Comput. Sci. Andrew R. Cohen, Paul M. B. Vitányi
2019	—	`book`	An Introduction to Kolmogorov Complexity and Its Applications, 4th Edition Ming Li, Paul M. B. Vitányi
2019	J	`jnl`	Corrigendum to "On the rate of decrease in logical depth" [Theor. Comput. Sci. 702 (2017) 60-64] by L.F. Antunes, A. Souto, and P.M.B. Vitányi. Theor. Comput. Sci. Paul M. B. Vitányi
2019	J	`jnl`	Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines. CoRR Paul M. B. Vitányi
2019	J	`jnl`	Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines. Theor. Comput. Sci. Paul M. B. Vitányi
2018	J	`jnl`	On the average-case complexity of Shellsort. Random Struct. Algorithms Paul M. B. Vitányi
2017	J	`jnl`	Exact Expression For Information Distance. IEEE Trans. Inf. Theory Paul M. B. Vitányi
2017	J	`jnl`	Identification of Probabilities. CoRR Paul M. B. Vitányi, Nick Chater
2017	J	`jnl`	On the rate of decrease in logical depth. Theor. Comput. Sci. Luis Filipe Coelho Antunes, Andre Souto, Paul M. B. Vitányi
2016	—	`ch.`	Registers. Encyclopedia of Algorithms Paul M. B. Vitányi
2015	J	`jnl`	Normalized Compression Distance of Multisets with Applications. IEEE Trans. Pattern Anal. Mach. Intell. Andrew R. Cohen, Paul M. B. Vitányi
2015	J	`jnl`	On The Average-Case Complexity of Shellsort. CoRR Paul M. B. Vitányi
2015	J	`jnl`	Web Similarity. CoRR Andrew R. Cohen, Paul M. B. Vitányi
2014	J	`jnl`	A Fast Quartet Tree Heuristic for Hierarchical Clustering. CoRR Rudi Cilibrasi, Paul M. B. Vitányi
2014	J	`jnl`	Exact Expression For Information Distance. CoRR Paul M. B. Vitányi
2013	J	`jnl`	Algorithmic Identification of Probabilities. CoRR Paul M. B. Vitányi, Nick Chater
2013	J	`jnl`	Conditional Kolmogorov complexity and universal probability. Theor. Comput. Sci. Paul M. B. Vitányi
2013	J	`jnl`	Language Learning From Positive Evidence, Reconsidered: A Simplicity-Based Approach. Top. Cogn. Sci. Anne S. Hsu, Nick Chater, Paul M. B. Vitányi
2013	J	`jnl`	Language learning from positive evidence, reconsidered: A simplicity-based approach CoRR Anne S. Hsu, Nick Chater, Paul M. B. Vitányi
2013	J	`jnl`	Normalized Google Distance of Multisets with Applications. CoRR Andrew R. Cohen, Paul M. B. Vitányi
2013	J	`jnl`	On Logical Depth and the Running Time of Shortest Programs. CoRR Luis Filipe Coelho Antunes, Andre Souto, Paul M. B. Vitányi
2013	J	`jnl`	On the logical depth function CoRR Luis Filipe Coelho Antunes, Andre Souto, Andreia Teixeira, Paul M. B. Vitányi
2012	J	`jnl`	Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising. IEEE Trans. Computers Steven de Rooij, Paul M. B. Vitányi
2012	J	`jnl`	Conditional Kolmogorov Complexity and Universal Probability CoRR Paul M. B. Vitányi
2012	J	`jnl`	Information Distance: New Developments CoRR Paul M. B. Vitányi
2012	J	`jnl`	Normalized Compression Distance of Multiples CoRR Andrew R. Cohen, Paul M. B. Vitányi
2012	J	`jnl`	Turing Machines and Understanding Computational Complexity CoRR Paul M. B. Vitányi
2011	J	`jnl`	A Fast Quartet tree heuristic for hierarchical clustering. Pattern Recognit. Rudi Cilibrasi, Paul M. B. Vitányi
2011	—	`conf`	Compression-Based Similarity. CCP Paul M. B. Vitányi
2011	J	`jnl`	Compression-based Similarity CoRR Paul M. B. Vitányi
2011	J	`jnl`	Information Distance in Multiples. IEEE Trans. Inf. Theory Paul M. B. Vitányi
2011	J	`jnl`	Nonapproximability of the normalized information distance. J. Comput. Syst. Sci. Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi
2011	J	`jnl`	On Empirical Entropy CoRR Paul M. B. Vitányi
2010	J	`jnl`	Information Distance CoRR Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
2010	J	`jnl`	Normalized Information Distance is Not Semicomputable CoRR Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi
2010	—	`ch.`	Normalized Web Distance and Word Similarity. Handbook of Natural Language Processing Paul M. B. Vitányi, Rudi Cilibrasi
2010	J	`jnl`	Rate distortion and denoising of individual data using Kolmogorov complexity. IEEE Trans. Inf. Theory Nikolai K. Vereshchagin, Paul M. B. Vitányi
2010	J	`jnl`	Ray Solomonoff, Founding Father of Algorithmic Information Theory. Algorithms Paul M. B. Vitányi
2010	J	`jnl`	The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis CoRR Anne S. Hsu, Nick Chater, Paul M. B. Vitányi
2009	J	`jnl`	Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) CoRR Paul M. B. Vitányi
2009	J	`jnl`	Approximation of the Two-Part MDL Code. IEEE Trans. Inf. Theory Pieter W. Adriaans, Paul M. B. Vitányi
2009	J	`jnl`	Depth as Randomness Deficiency. Theory Comput. Syst. Luis Filipe Coelho Antunes, Armando Matos, Andre Souto, Paul M. B. Vitányi
2009	J	`jnl`	Distributed elections in an Archimedean ring of processors CoRR Paul M. B. Vitányi
2009	J	`jnl`	Information Distance in Multiples CoRR Paul M. B. Vitányi
2009	J	`jnl`	Nonapproximablity of the Normalized Information Distance CoRR Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi
2009	J	`jnl`	Normalized Web Distance and Word Similarity CoRR Rudi Cilibrasi, Paul M. B. Vitányi
2009	J	`jnl`	Time-bounded incompressibility of compressible strings and sequences. Inf. Process. Lett. Edgar G. Daylight, Wouter M. Koolen, Paul M. B. Vitányi
2009	J	`jnl`	Turing machine. Scholarpedia Paul M. B. Vitányi
2008	J	`jnl`	Algorithmic information theory CoRR Peter D. Grünwald, Paul M. B. Vitányi
2008	—	`book`	An Introduction to Kolmogorov Complexity and Its Applications, Third Edition. Ming Li, Paul M. B. Vitányi
2008	J	`jnl`	Depth as Randomness Deficiency CoRR Luis Antunes, Armando Matos, Andre Souto, Paul M. B. Vitányi
2008	J	`jnl`	Normalized Information Distance CoRR Paul M. B. Vitányi, Frank J. Balbach, Rudi Cilibrasi, Ming Li
2008	J	`jnl`	On Time-Bounded Incompressibility of Compressible Strings CoRR Edgar G. Daylight, Wouter M. Koolen, Paul M. B. Vitányi
2008	—	`ch.`	Registers. Encyclopedia of Algorithms Paul M. B. Vitányi
2007	J	`jnl`	Algorithmic probability. Scholarpedia Marcus Hutter, Shane Legg, Paul M. B. Vitányi
2007	J	`jnl`	Andrey Nikolaevich Kolmogorov. Scholarpedia Paul M. B. Vitányi
2007	J	`jnl`	Applications of algorithmic information theory. Scholarpedia Ming Li, Paul M. B. Vitányi
2007	J	`jnl`	Individual communication complexity. J. Comput. Syst. Sci. Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
2007	J	`jnl`	The Google Similarity Distance. IEEE Trans. Knowl. Data Eng. Rudi Cilibrasi, Paul M. B. Vitányi
2007	B	`conf`	The Power and Perils of MDL. ISIT Pieter W. Adriaans, Paul M. B. Vitányi
2006	—	`conf`	06051 Abstracts Collection -- Kolmogorov Complexity and Applications. Kolmogorov Complexity and Applications Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi
2006	J	`jnl`	A New Quartet Tree Heuristic for Hierarchical Clustering CoRR Rudi Cilibrasi, Paul M. B. Vitányi
2006	—	`conf`	A New Quartet Tree Heuristic for Hierarchical Clustering. Theory of Evolutionary Algorithms Rudi Cilibrasi, Paul M. B. Vitányi
2006	J	`jnl`	About the Lifespan of Peer to Peer Networks CoRR Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes, Paul M. B. Vitányi
2006	B	`conf`	About the Lifespan of Peer to Peer Networks, . OPODIS Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi
2006	J	`jnl`	Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising CoRR Steven de Rooij, Paul M. B. Vitányi
2006	B	`conf`	Automatic Extraction of Meaning from the Web. ISIT Rudi Cilibrasi, Paul M. B. Vitányi
2006	—	`conf`	Automatic Meaning Discovery Using Google. Kolmogorov Complexity and Applications Rudi Cilibrasi, Paul M. B. Vitányi
2006	B	`conf`	Clustering Fetal Heart Rate Tracings by Compression. CBMS Cristina Costa-Santos, João Bernardes, Paul M. B. Vitányi, Luis Antunes
2006	J	`jnl`	Clustering fetal heart rate tracings by compression CoRR Cristina Costa-Santos, João Bernardes, Paul M. B. Vitányi, Luis Antunes
2006	—	`ed.`	Kolmogorov Complexity and Applications, 29.01. - 03.02.2006 Kolmogorov Complexity and Applications Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi
2006	J	`jnl`	Meaningful Information. IEEE Trans. Inf. Theory Paul M. B. Vitányi
2006	B	`conf`	On Algorithmic Rate-Distortion Function. ISIT Nikolai K. Vereshchagin, Paul M. B. Vitányi
2006	J	`jnl`	On the importance of having an identity or, is consensus really universal?. Distributed Comput. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
2006	J	`jnl`	Registers CoRR Paul M. B. Vitányi
2006	J	`jnl`	Similarity of Objects and the Meaning of Words CoRR Rudi Cilibrasi, Paul M. B. Vitányi
2006	C	`conf`	Similarity of Objects and the Meaning of Words. TAMC Rudi Cilibrasi, Paul M. B. Vitányi
2006	J	`jnl`	Tales of Huffman CoRR Paul M. B. Vitányi, Zvi Lotker
2006	J	`jnl`	The Power and Perils of MDL CoRR Pieter W. Adriaans, Paul M. B. Vitányi
2005	J	`jnl`	Clustering by compression. IEEE Trans. Inf. Theory Rudi Cilibrasi, Paul M. B. Vitányi
2005	J	`jnl`	Time, Space, and Energy in Reversible Computing CoRR Paul M. B. Vitányi
2005	—	`conf`	Time, space, and energy in reversible computing. Conf. Computing Frontiers Paul M. B. Vitányi
2005	J	`jnl`	Universal Similarity CoRR Paul M. B. Vitányi
2005	B	`conf`	Universal similarity. ITW Paul M. B. Vitányi
2004	J	`jnl`	A Theory of Lossy Compression for Individual Data CoRR Nikolai K. Vereshchagin, Paul M. B. Vitányi
2004	J	`jnl`	Algorithmic Clustering of Music Based on String Compression. Comput. Music. J. Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
2004	—	`conf`	Algorithmic Clustering of Music. WEDELMUSIC Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
2004	A	`conf`	Individual Communication Complexity: Extended Abstract. STACS Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
2004	J	`jnl`	Kolmogorov's structure functions and model selection. IEEE Trans. Inf. Theory Nikolai K. Vereshchagin, Paul M. B. Vitányi
2004	J	`jnl`	Shannon Information and Kolmogorov Complexity CoRR Peter Grünwald, Paul M. B. Vitányi
2004	J	`jnl`	The Google Similarity Distance CoRR Rudi Cilibrasi, Paul M. B. Vitányi
2004	J	`jnl`	The similarity metric. IEEE Trans. Inf. Theory Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi
2003	J	`jnl`	Algorithmic Chaos CoRR Paul M. B. Vitányi
2003	J	`jnl`	Algorithmic Clustering of Music CoRR Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
2003	J	`jnl`	Clustering by compression CoRR Rudi Cilibrasi, Paul M. B. Vitányi
2003	J	`jnl`	Individual Communication Complexity CoRR Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
2003	J	`jnl`	Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers. J. Log. Lang. Inf. Peter Grünwald, Paul M. B. Vitányi
2003	J	`jnl`	Sharpening Occam's razor. Inf. Process. Lett. Ming Li, John Tromp, Paul M. B. Vitányi
2003	A*	`conf`	The similarity metric. SODA Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi
2002	B	`conf`	A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification. SIROCCO John Tromp, Paul M. B. Vitányi
2002	J	`jnl`	Bounded concurrent timestamp systems using vector clocks. J. ACM Sibsankar Haldar, Paul M. B. Vitányi
2002	J	`jnl`	Correction to "Algorithmic statistics". IEEE Trans. Inf. Theory Péter Gács, John Tromp, Paul M. B. Vitányi
2002	J	`jnl`	Correction to "Quantum Kolmogorov complexity based on classical descriptions". IEEE Trans. Inf. Theory Paul M. B. Vitányi
2002	J	`jnl`	Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection CoRR Nikolai K. Vereshchagin, Paul M. B. Vitányi
2002	A*	`conf`	Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection. FOCS Nikolai K. Vereshchagin, Paul M. B. Vitányi
2002	B	`conf`	Meaningful Information. ISAAC Paul M. B. Vitányi
2002	J	`jnl`	On the Importance of Having an Identity or, is Consensus really Universal? CoRR Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
2002	J	`jnl`	Randomized two-process wait-free test-and-set. Distributed Comput. John Tromp, Paul M. B. Vitányi
2002	J	`jnl`	Sharpening Occam's Razor CoRR Ming Li, John Tromp, Paul M. B. Vitányi
2002	Misc	`conf`	Sharpening Occam's Razor. COCOON Ming Li, John Tromp, Paul M. B. Vitányi
2002	A	`conf`	Simple Wait-Free Multireader Registers. DISC Paul M. B. Vitányi
2002	J	`jnl`	Simple Wait-free Multireader Registers CoRR Paul M. B. Vitányi
2002	J	`jnl`	The average-case area of Heilbronn-type triangles. Random Struct. Algorithms Tao Jiang, Ming Li, Paul M. B. Vitányi
2001	J	`jnl`	A New Approach to Formal Language Theory by Kolmogorov Complexity CoRR Ming Li, Paul M. B. Vitányi
2001	J	`jnl`	Algorithmic statistics. IEEE Trans. Inf. Theory Péter Gács, John Tromp, Paul M. B. Vitányi
2001	J	`jnl`	Bounded Concurrent Timestamp Systems Using Vector Clocks CoRR Sibsankar Haldar, Paul M. B. Vitányi
2001	J	`jnl`	Counting is Easy CoRR Joel I. Seiferas, Paul M. B. Vitányi
2001	J	`jnl`	Meaningful Information CoRR Paul M. B. Vitányi
2001	—	`conf`	On a Generalized Ruin Problem. RANDOM-APPROX Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe
2001	J	`jnl`	Quantum Kolmogorov Complexity Based on Classical Descriptions CoRR Paul M. B. Vitányi
2001	J	`jnl`	Quantum Kolmogorov complexity based on classical descriptions. IEEE Trans. Inf. Theory Paul M. B. Vitányi
2001	J	`jnl`	Randomized Two-Process Wait-Free Test-and-Set CoRR John Tromp, Paul M. B. Vitányi
2001	J	`jnl`	Randomness CoRR Paul M. B. Vitányi
2001	J	`jnl`	The Generalized Universal Law of Generalization CoRR Nick Chater, Paul M. B. Vitányi
2001	Misc	`conf`	The Quantum Computing Challenge. Informatics Paul M. B. Vitányi
2001	J	`jnl`	The similarity metric CoRR Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi
2001	J	`jnl`	Time and Space Bounds for Reversible Simulation CoRR Harry Buhrman, John Tromp, Paul M. B. Vitányi
2001	A*	`conf`	Time and Space Bounds for Reversible Simulation. ICALP Harry Buhrman, John Tromp, Paul M. B. Vitányi
2001	J	`jnl`	Two heads are better than two tapes CoRR Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
2000	J	`jnl`	A discipline of evolutionary programming. Theor. Comput. Sci. Paul M. B. Vitányi
2000	J	`jnl`	A lower bound on the average-case complexity of shellsort. J. ACM Tao Jiang, Ming Li, Paul M. B. Vitányi
2000	J	`jnl`	Algorithmic Statistics CoRR Péter Gács, John Tromp, Paul M. B. Vitányi
2000	J	`jnl`	Applying MDL to Learning Best Model Granularity CoRR Qiong Gao, Ming Li, Paul M. B. Vitányi
2000	J	`jnl`	Applying MDL to learn best model granularity. Artif. Intell. Qiong Gao, Ming Li, Paul M. B. Vitányi
2000	J	`jnl`	Average-Case Analysis of Algorithms Using Kolmogorov Complexity. J. Comput. Sci. Technol. Tao Jiang, Ming Li, Paul M. B. Vitányi
2000	J	`jnl`	Minimum description length induction, Bayesianism, and Kolmogorov complexity. IEEE Trans. Inf. Theory Paul M. B. Vitányi, Ming Li
2000	J	`jnl`	New applications of the incompressibility method: Part II. Theor. Comput. Sci. Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi
2000	A	`conf`	On the Importance of Having an Identity or is Consensus Really Universal? DISC Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
2000	B	`conf`	The Incompressibility Method. SOFSEM Tao Jiang, Ming Li, Paul M. B. Vitányi
2000	A	`conf`	Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State. CCC Paul M. B. Vitányi
2000	B	`conf`	Towards an Algorithmic Statistics. ALT Péter Gács, John Tromp, Paul M. B. Vitányi
1999	J	`jnl`	A Discipline of Evolutionary Programming CoRR Paul M. B. Vitányi
1999	J	`jnl`	Average-Case Complexity of Shellsort CoRR Tao Jiang, Ming Li, Paul M. B. Vitányi
1999	J	`jnl`	Average-Case Complexity of Shellsort (Preliminary version) CoRR Tao Jiang, Ming Li, Paul M. B. Vitányi
1999	A*	`conf`	Average-Case Complexity of Shellsort. ICALP Tao Jiang, Ming Li, Paul M. B. Vitányi
1999	J	`jnl`	Kolmogorov Random Graphs and the Incompressibility Method. SIAM J. Comput. Harry Buhrman, Ming Li, John Tromp, Paul M. B. Vitányi
1999	J	`jnl`	Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity CoRR Paul M. B. Vitányi, Ming Li
1999	J	`jnl`	Mutual Search CoRR Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi
1999	J	`jnl`	Mutual Search. J. ACM Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi
1999	A*	`conf`	New Applications of the Incompressibility Method. ICALP Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi
1999	J	`jnl`	New Applications of the Incompressibility Method. Comput. J. Tao Jiang, Ming Li, Paul M. B. Vitányi
1999	—	`conf`	Some Examples of Average-case Analysis by the Imcompressibility Method. Jewels are Forever Tao Jiang, Ming Li, Paul M. B. Vitányi
1999	J	`jnl`	Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method CoRR Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi
1999	J	`jnl`	Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method. SIAM J. Comput. Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi
1999	J	`jnl`	The Average-Case Area of Heilbronn-Type Triangles CoRR Tao Jiang, Ming Li, Paul M. B. Vitányi
1999	A	`conf`	The Expected Size of Heilbronn's Triangles. CCC Tao Jiang, Ming Li, Paul M. B. Vitányi
1998	—	`conf`	Average-Case Analysis Using Kolgomorov Complexity (Abstract). CATS Ming Li, Paul M. B. Vitányi
1998	J	`jnl`	Information Distance. IEEE Trans. Inf. Theory Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
1998	A*	`conf`	Mutual Search (Extended Abstract). SODA Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi
1998	J	`jnl`	New Applications of the Incompressibility Method: Part I CoRR Tao Jiang, Ming Li, Paul M. B. Vitányi
1998	J	`jnl`	New Applications of the Incompressibility Method: Part II CoRR Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi
1998	J	`jnl`	Randomized Naming Using Wait-Free Shared Variables. Distributed Comput. Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi
1997	—	`book`	An introduction to Kolmogorov complexity and its applications, Second Edition. Ming Li, Paul M. B. Vitányi
1997	—	`conf`	Average-Case Analysis Using Kolmogorov Complexity. Advances in Algorithms, Languages, and Complexity Ming Li, Paul M. B. Vitányi
1997	B	`conf`	Average-Case Analysis via Incompressibility. FCT Ming Li, Paul M. B. Vitányi
1997	J	`jnl`	Erratum: "Two heads are better that two tapes". J. ACM Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
1997	—	`conf`	Kolmogorov random graphs. SEQUENCES Harry Buhrman, Ming Li, Paul M. B. Vitányi
1997	Misc	`conf`	Mutual Search (abstract). COCOON Paul M. B. Vitányi
1997	—	`conf`	On Prediction by Data Compression. ECML Paul M. B. Vitányi, Ming Li
1997	J	`jnl`	Reversibility and Adiabatic Computation: Trading Time and Space for Energy CoRR Ming Li, Paul M. B. Vitányi
1997	J	`jnl`	Reversible Simulation of Irreversible Computation by Pebble Games CoRR Ming Li, John Tromp, Paul M. B. Vitányi
1997	J	`jnl`	Two heads are better than two tapes. J. ACM Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
1996	B	`conf`	Genetic Fitness Optimization Using Rapidly Mixing Markov Chains. ALT Paul M. B. Vitányi
1996	J	`jnl`	How to Share Concurrent Wait-Free Variables. J. ACM Ming Li, John Tromp, Paul M. B. Vitányi
1996	A*	`conf`	Optimal Routing Tables. PODC Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi
1996	A	`conf`	Reversible Simulation of Irreversible Computation. CCC Ming Li, Paul M. B. Vitányi
1995	J	`jnl`	A New Approach to Formal Language Theory by Kolmogorov Complexity. SIAM J. Comput. Ming Li, Paul M. B. Vitányi
1995	B	`conf`	Algorithmic Arguments in Physics of Computation. WADS Paul M. B. Vitányi, Ming Li
1995	—	`ed.`	Computational Learning Theory, Second European Conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995, Proceedings EuroCOLT Paul M. B. Vitányi
1995	—	`ch.`	Computational Machine Learning in Theory and Praxis. Computer Science Today Ming Li, Paul M. B. Vitányi
1995	B	`conf`	Physics and the New Computation. MFCS Paul M. B. Vitányi
1994	—	`ed.`	Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings WDAG Gerard Tel, Paul M. B. Vitányi
1994	J	`jnl`	Kolmogorov Complexity Arguments in Combinatorics. J. Comb. Theory A Ming Li, Paul M. B. Vitányi
1994	B	`conf`	Model selection for neural networks: comparing MDL and NIC. ESANN Guido M. te Brake, Joost N. Kok, Paul M. B. Vitányi
1994	B	`conf`	Randomized Wait-Free Naming. ISAAC Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi
1994	J	`jnl`	Statistical Properties of Finite Sequences with High Kolmogorov Complexity. Math. Syst. Theory Ming Li, Paul M. B. Vitányi
1994	A*	`conf`	Two heads are better than two tapes. STOC Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
1993	—	`book`	An introduction to Kolmogorov complexity and its applications. Ming Li, Paul M. B. Vitányi
1993	A*	`conf`	Thermodynamics of computation and information distance. STOC Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
1992	J	`jnl`	A Note on Weighted Distributed Match-Making. Math. Syst. Theory Evangelos Kranakis, Paul M. B. Vitányi
1992	J	`jnl`	Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity. Inf. Process. Lett. Ming Li, Paul M. B. Vitányi
1992	J	`jnl`	Inductive Reasoning and Kolmogorov Complexity. J. Comput. Syst. Sci. Ming Li, Paul M. B. Vitányi
1992	—	`conf`	Inductive reasoning. Language Computations Ming Li, Paul M. B. Vitányi
1992	J	`jnl`	Optimality of Wait-Free Atomic Multiwriter Variables. Inf. Process. Lett. Ming Li, Paul M. B. Vitányi
1992	A*	`conf`	Philosophical Issues in Kolmogorov Complexity. ICALP Ming Li, Paul M. B. Vitányi
1992	J	`jnl`	The Power of the Queue. SIAM J. Comput. Ming Li, Luc Longpré, Paul M. B. Vitányi
1992	—	`conf`	Wait-free Test-and-Set (Extended Abstract). WDAG Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitányi
1991	—	`book`	An introduction to Kolmogorov - complexity and its applications ; part 1: theory. Ming Li, Paul M. B. Vitányi
1991	—	`conf`	Combinatorics and Kolmogorov Complexity. SCT Ming Li, Paul M. B. Vitányi
1991	J	`jnl`	Learning Simple Concept Under Simple Distributions. SIAM J. Comput. Ming Li, Paul M. B. Vitányi
1990	—	`ch.`	Kolmogorov Complexity and its Applications. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) Ming Li, Paul M. B. Vitányi
1989	A*	`conf`	A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version). ICALP Ming Li, Paul M. B. Vitányi
1989	A*	`conf`	A Theory of Learning Simple Concepts Under Simple Distributions and Average Case Complexity for the Universal Distribution (Extended Abstract) FOCS Ming Li, Paul M. B. Vitányi
1989	A*	`conf`	How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version). ICALP Ming Li, Paul M. B. Vitányi
1989	—	`conf`	Inductive Reasoning and Komogorov Complexity. SCT Ming Li, Paul M. B. Vitányi
1988	—	`conf`	A Proof Technique for Register Automicity. FSTTCS Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi
1988	J	`jnl`	Counting is easy. J. ACM Joel I. Seiferas, Paul M. B. Vitányi
1988	J	`jnl`	Distributed Match-Making. Algorithmica Sape J. Mullender, Paul M. B. Vitányi
1988	J	`jnl`	Locality, Communication, and Interconnect Length in Multicomputers. SIAM J. Comput. Paul M. B. Vitányi
1988	J	`jnl`	Tape versus Queue and Stacks: The Lower Bounds Inf. Comput. Ming Li, Paul M. B. Vitányi
1988	—	`conf`	Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87. SCT Ming Li, Paul M. B. Vitányi
1988	—	`conf`	Weighted Distributed Match-Making. AWOC Evangelos Kranakis, Paul M. B. Vitányi
1987	—	`conf`	Atomic Multireader Register. WDAG Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi
1987	A*	`conf`	Errata to "Atomic Shared Register Access by Asynchronous Hardware" FOCS Paul M. B. Vitányi, Baruch Awerbuch
1986	A*	`conf`	Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract) FOCS Paul M. B. Vitányi, Baruch Awerbuch
1986	J	`jnl`	Distributed Match-Making for Processes in Computer Networks (Preliminary Version). ACM SIGOPS Oper. Syst. Rev. Sape J. Mullender, Paul M. B. Vitányi
1986	—	`conf`	Nonsequentail Computation and Laws of Nature. Aegean Workshop on Computing Paul M. B. Vitányi
1986	—	`conf`	The Power of the Queue. SCT Ming Li, Luc Longpré, Paul M. B. Vitányi
1985	J	`jnl`	An Optimal Simulation of Counter Machines. SIAM J. Comput. Paul M. B. Vitányi
1985	J	`jnl`	An Optimal Simulation of Counter Machines: The ACM Case. SIAM J. Comput. Paul M. B. Vitányi
1985	J	`jnl`	An n Inf. Process. Lett. Paul M. B. Vitányi
1985	A*	`conf`	Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary Version) FOCS Paul M. B. Vitányi
1985	J	`jnl`	Big omega versus the wild functions. SIGACT News Paul M. B. Vitányi, Lambert G. L. T. Meertens
1985	A*	`conf`	Distributed Match-Making for Processes in Computer Networks (Preliminary Version). PODC Sape J. Mullender, Paul M. B. Vitányi
1985	J	`jnl`	Logarithmic signal propagation delay and the efficiency of VLSI circuits. Bull. EATCS Paul M. B. Vitányi
1985	J	`jnl`	Square Time is Optimal for Simulation of One Pushdown Store or One Queue by an Oblivious One-Head Tape Unit. Inf. Process. Lett. Paul M. B. Vitányi
1984	J	`jnl`	Big omega versus the wild functions. Bull. EATCS Paul M. B. Vitányi, Lambert G. L. T. Meertens
1984	A*	`conf`	Distributed Elections in an Archimedean Ring of Processors (Preliminary Version) STOC Paul M. B. Vitányi
1984	J	`jnl`	On Two-Tape Real-Time Computation and Queues. J. Comput. Syst. Sci. Paul M. B. Vitányi
1984	J	`jnl`	On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps. Inf. Process. Lett. Walter J. Savitch, Paul M. B. Vitányi
1984	J	`jnl`	On the Simulation of Many Storage Heads by One. Theor. Comput. Sci. Paul M. B. Vitányi
1984	A*	`conf`	The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version). ICALP Paul M. B. Vitányi
1983	A*	`conf`	On the Simulation of Many Storage Heads by a Single One (Extended Abstract). ICALP Paul M. B. Vitányi
1982	A*	`conf`	Efficient Simulations of Multicounter Machines. ICALP Paul M. B. Vitányi
1982	J	`jnl`	On Efficient Simulations of Multicounter Machines Inf. Control. Paul M. B. Vitányi
1982	A*	`conf`	Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines STOC Paul M. B. Vitányi
1981	J	`jnl`	How well can a graph be n-colored? Discret. Math. Paul M. B. Vitányi
1980	J	`jnl`	Achievable High Scores of epsilon-Moves and Running Times in DPDA Computations. Inf. Process. Lett. Paul M. B. Vitányi
1980	A*	`conf`	On the Power of Real-Time Machines Under Varying Specifications (Extended Abstract). ICALP Paul M. B. Vitányi
1980	B	`conf`	Relativized Obliviousness. MFCS Paul M. B. Vitányi
1978	J	`jnl`	A note on the recursive enumerability of some classes of recursively enumerable languages. Inf. Sci. Peter van Emde Boas, Paul M. B. Vitányi
1978	J	`jnl`	On Inverse Deterministic Pushdown Transductions. J. Comput. Syst. Sci. Paul M. B. Vitányi, Walter J. Savitch
1978	J	`jnl`	Stable String Languages of Lindenmayer Systems Inf. Control. Paul M. B. Vitányi, Adrian Walker
1977	J	`jnl`	Context Sensitive Table Lindenmayer Languages and a Relation to the LBA Problem Inf. Control. Paul M. B. Vitányi
1977	A*	`conf`	Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps. ICALP Walter J. Savitch, Paul M. B. Vitányi
1976	J	`jnl`	Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms. Theor. Comput. Sci. Paul M. B. Vitányi
1976	J	`jnl`	On a problem in the collective behavior of automata. Discret. Math. Paul M. B. Vitányi
1975	—	`conf`	Digraphs Associated with DOL Systems. Automata, Languages, Development Paul M. B. Vitányi
1974	—	`conf`	Growth of Strings in Context Dependent Lindenmayer Systems. L Systems Paul M. B. Vitányi
1974	—	`conf`	On the Size of D0L Languages. L Systems Paul M. B. Vitányi