Paul M. B. Vitányi

Anne S. Hsu, Nick Chater, Paul M. B. Vitányi: Language learning from positive evidence, reconsidered: A simplicity-based approach. CoRR abs/1301.4432 (2013)

Luis Filipe Coelho Antunes, Andre Souto, A. Teixeira, Paul M. B. Vitányi: On the logical depth function. CoRR abs/1301.4451 (2013)

Steven de Rooij, Paul M. B. Vitányi: Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising. IEEE Trans. Computers 61(3): 395-407 (2012)

Paul M. B. Vitányi: Information Distance: New Developments. CoRR abs/1201.1221 (2012)

Paul M. B. Vitányi: Turing Machines and Understanding Computational Complexity. CoRR abs/1201.1223 (2012)

Paul M. B. Vitányi: Conditional Kolmogorov Complexity and Universal Probability. CoRR abs/1206.0983 (2012)

Paul M. B. Vitányi, Nick Chater: Identification of Probabilities of Languages. CoRR abs/1208.5003 (2012)

Andrew R. Cohen, Paul M. B. Vitányi: Normalized Compression Distance of Multiples. CoRR abs/1212.5711 (2012)

Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi: Nonapproximability of the normalized information distance. J. Comput. Syst. Sci. 77(4): 738-742 (2011)

Rudi Cilibrasi, Paul M. B. Vitányi: A Fast Quartet tree heuristic for hierarchical clustering. Pattern Recognition 44(3): 662-677 (2011)

Paul M. B. Vitányi: Information Distance in Multiples. IEEE Transactions on Information Theory 57(4): 2451-2456 (2011)

Paul M. B. Vitányi: Compression-Based Similarity. CCP 2011: 111-118

Paul M. B. Vitányi: On Empirical Entropy. CoRR abs/1103.5985 (2011)

Paul M. B. Vitányi: Compression-based Similarity. CoRR abs/1110.4544 (2011)

Paul M. B. Vitányi: Ray Solomonoff, Founding Father of Algorithmic Information Theory. Algorithms 3(3): 260-264 (2010)

Nikolai K. Vereshchagin, Paul M. B. Vitányi: Rate distortion and denoising of individual data using Kolmogorov complexity. IEEE Transactions on Information Theory 56(7): 3438-3454 (2010)

Anne S. Hsu, Nick Chater, Paul M. B. Vitányi: The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis. CoRR abs/1006.3271 (2010)

Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi: Normalized Information Distance is Not Semicomputable. CoRR abs/1006.3275 (2010)

Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek: Information Distance. CoRR abs/1006.3520 (2010)

Edgar G. Daylight, Wouter M. Koolen, Paul M. B. Vitányi: Time-bounded incompressibility of compressible strings and sequences. Inf. Process. Lett. 109(18): 1055-1059 (2009)

Luis Filipe Coelho Antunes, Armando Matos, Andre Souto, Paul M. B. Vitányi: Depth as Randomness Deficiency. Theory Comput. Syst. 45(4): 724-739 (2009)

Paul M. B. Vitányi: Turing machine. Scholarpedia 4(3): 6240 (2009)

Pieter W. Adriaans, Paul M. B. Vitányi: Approximation of the Two-Part MDL Code. IEEE Transactions on Information Theory 55(1): 444-457 (2009)

Paul M. B. Vitányi: Information Distance in Multiples. CoRR abs/0905.3347 (2009)

Rudi Cilibrasi, Paul M. B. Vitányi: Normalized Web Distance and Word Similarity. CoRR abs/0905.4039 (2009)

Paul M. B. Vitányi: Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey). CoRR abs/0905.4452 (2009)

Paul M. B. Vitányi: Distributed elections in an Archimedean ring of processors. CoRR abs/0906.0731 (2009)

Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi: Nonapproximablity of the Normalized Information Distance. CoRR abs/0910.4353 (2009)

Paul M. B. Vitányi: Registers. Encyclopedia of Algorithms 2008

Luis Antunes, Armando Matos, Andre Souto, Paul M. B. Vitányi: Depth as Randomness Deficiency. CoRR abs/0809.2546 (2008)

Paul M. B. Vitányi, Frank J. Balbach, Rudi Cilibrasi, Ming Li: Normalized Information Distance. CoRR abs/0809.2553 (2008)

Peter D. Grünwald, Paul M. B. Vitányi: Algorithmic information theory. CoRR abs/0809.2754 (2008)

Edgar G. Daylight, Wouter M. Koolen, Paul M. B. Vitányi: On Time-Bounded Incompressibility of Compressible Strings. CoRR abs/0809.2965 (2008)

Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi: Individual communication complexity. J. Comput. Syst. Sci. 73(6): 973-985 (2007)

Paul M. B. Vitányi: Andrey Nikolaevich Kolmogorov. Scholarpedia 2(2): 2798 (2007)

Ming Li, Paul M. B. Vitányi: Applications of algorithmic information theory. Scholarpedia 2(5): 2658 (2007)

Marcus Hutter, Shane Legg, Paul M. B. Vitányi: Algorithmic probability. Scholarpedia 2(8): 2572 (2007)

Rudi Cilibrasi, Paul M. B. Vitányi: The Google Similarity Distance. IEEE Trans. Knowl. Data Eng. 19(3): 370-383 (2007)

Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi: On the importance of having an identity or, is consensus really universal?. Distributed Computing 18(3): 167-176 (2006)

Paul M. B. Vitányi: Meaningful Information. IEEE Transactions on Information Theory 52(10): 4617-4626 (2006)

Cristina Costa-Santos, João Bernardes, Paul M. B. Vitányi, Luis Antunes: Clustering Fetal Heart Rate Tracings by Compression. CBMS 2006: 685-690

Rudi Cilibrasi, Paul M. B. Vitányi: A New Quartet Tree Heuristic for Hierarchical Clustering. Theory of Evolutionary Algorithms 2006

Rudi Cilibrasi, Paul M. B. Vitányi: Automatic Meaning Discovery Using Google. Kolmogorov Complexity and Applications 2006

Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi: 06051 Abstracts Collection -- Kolmogorov Complexity and Applications. Kolmogorov Complexity and Applications 2006

Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi: About the Lifespan of Peer to Peer Networks, . OPODIS 2006: 290-304

Rudi Cilibrasi, Paul M. B. Vitányi: Similarity of Objects and the Meaning of Words. TAMC 2006: 21-45

Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi (Eds.): Kolmogorov Complexity and Applications, 29.01. - 03.02.2006. Dagstuhl Seminar Proceedings 06051, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006

Rudi Cilibrasi, Paul M. B. Vitányi: Similarity of Objects and the Meaning of Words. CoRR abs/cs/0602065 (2006)

Rudi Cilibrasi, Paul M. B. Vitányi: A New Quartet Tree Heuristic for Hierarchical Clustering. CoRR abs/cs/0606048 (2006)

Steven de Rooij, Paul M. B. Vitányi: Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising. CoRR abs/cs/0609121 (2006)

Paul M. B. Vitányi: Registers. CoRR abs/cs/0612025 (2006)

Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes, Paul M. B. Vitányi: About the Lifespan of Peer to Peer Networks. CoRR abs/cs/0612043 (2006)

Pieter W. Adriaans, Paul M. B. Vitányi: The Power and Perils of MDL. CoRR abs/cs/0612095 (2006)

Paul M. B. Vitányi, Zvi Lotker: Tales of Huffman. CoRR abs/cs/0612133 (2006)

Cristina Costa-Santos, João Bernardes, Paul M. B. Vitányi, Luis Antunes: Clustering fetal heart rate tracings by compression. CoRR abs/q-bio/0612013 (2006)

Rudi Cilibrasi, Paul M. B. Vitányi: Clustering by compression. IEEE Transactions on Information Theory 51(4): 1523-1545 (2005)

Paul M. B. Vitányi: Time, space, and energy in reversible computing. Conf. Computing Frontiers 2005: 435-444

Paul M. B. Vitányi: Time, Space, and Energy in Reversible Computing. CoRR abs/cs/0504088 (2005)

Paul M. B. Vitányi: Universal Similarity. CoRR abs/cs/0504089 (2005)

Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi: The similarity metric. IEEE Transactions on Information Theory 50(12): 3250-3264 (2004)

Nikolai K. Vereshchagin, Paul M. B. Vitányi: Kolmogorov's structure functions and model selection. IEEE Transactions on Information Theory 50(12): 3265-3290 (2004)

Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi: Individual Communication Complexity: Extended Abstract. STACS 2004: 19-30

Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf: Algorithmic Clustering of Music. WEDELMUSIC 2004: 110-117

Rudi Cilibrasi, Paul M. B. Vitányi: The Google Similarity Distance. CoRR abs/cs/0412098 (2004)

Peter Grünwald, Paul M. B. Vitányi: Shannon Information and Kolmogorov Complexity. CoRR cs.IT/0410002 (2004)

Nikolai K. Vereshchagin, Paul M. B. Vitányi: A Theory of Lossy Compression for Individual Data. CoRR cs.IT/0411014 (2004)

Ming Li, John Tromp, Paul M. B. Vitányi: Sharpening Occam's razor. Inf. Process. Lett. 85(5): 267-274 (2003)

Peter Grünwald, Paul M. B. Vitányi: Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers. Journal of Logic, Language and Information 12(4): 497-529 (2003)

Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi: The similarity metric. SODA 2003: 863-872

Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi: Individual Communication Complexity. CoRR cs.CC/0304012 (2003)

Rudi Cilibrasi, Paul M. B. Vitányi: Clustering by compression. CoRR cs.CV/0312044 (2003)

Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf: Algorithmic Clustering of Music. CoRR cs.SD/0303025 (2003)

Paul M. B. Vitányi: Algorithmic Chaos. CoRR nlin.CD/0303016 (2003)

John Tromp, Paul M. B. Vitányi: Randomized two-process wait-free test-and-set. Distributed Computing 15(3): 127-135 (2002)

Sibsankar Haldar, Paul M. B. Vitányi: Bounded concurrent timestamp systems using vector clocks. J. ACM 49(1): 101-126 (2002)

Tao Jiang, Ming Li, Paul M. B. Vitányi: The average-case area of Heilbronn-type triangles. Random Struct. Algorithms 20(2): 206-219 (2002)

Paul M. B. Vitányi: Correction to "Quantum Kolmogorov complexity based on classical descriptions". IEEE Transactions on Information Theory 48(4): 1000 (2002)

Péter Gács, John Tromp, Paul M. B. Vitányi: Correction to "Algorithmic statistics". IEEE Transactions on Information Theory 48(8): 2427 (2002)

Ming Li, John Tromp, Paul M. B. Vitányi: Sharpening Occam's Razor. COCOON 2002: 411-419

Nikolai K. Vereshchagin, Paul M. B. Vitányi: Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection. FOCS 2002: 751-760

Paul M. B. Vitányi: Meaningful Information. ISAAC 2002: 588-599

John Tromp, Paul M. B. Vitányi: A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification. SIROCCO 2002: 275-291

Paul M. B. Vitányi: Simple Wait-Free Multireader Registers. DISC 2002: 118-132

Nikolai K. Vereshchagin, Paul M. B. Vitányi: Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection. CoRR cs.CC/0204037 (2002)

Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi: On the Importance of Having an Identity or, is Consensus really Universal? CoRR cs.DC/0201006 (2002)

Paul M. B. Vitányi: Simple Wait-free Multireader Registers. CoRR cs.DC/0202003 (2002)

Ming Li, John Tromp, Paul M. B. Vitányi: Sharpening Occam's Razor. CoRR cs.LG/0201005 (2002)

Péter Gács, John Tromp, Paul M. B. Vitányi: Algorithmic statistics. IEEE Transactions on Information Theory 47(6): 2443-2463 (2001)

Paul M. B. Vitányi: Quantum Kolmogorov complexity based on classical descriptions. IEEE Transactions on Information Theory 47(6): 2464-2479 (2001)

Paul M. B. Vitányi: The Quantum Computing Challenge. Informatics 2001: 219-233

Harry Buhrman, John Tromp, Paul M. B. Vitányi: Time and Space Bounds for Reversible Simulation. ICALP 2001: 1017-1027

Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe: On a Generalized Ruin Problem. RANDOM-APPROX 2001: 181-191

Joel I. Seiferas, Paul M. B. Vitányi: Counting is Easy. CoRR cs.CC/0110038 (2001)

Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Two heads are better than two tapes. CoRR cs.CC/0110039 (2001)

Ming Li, Paul M. B. Vitányi: A New Approach to Formal Language Theory by Kolmogorov Complexity. CoRR cs.CC/0110040 (2001)

Paul M. B. Vitányi: Meaningful Information. CoRR cs.CC/0111053 (2001)

Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi: The similarity metric. CoRR cs.CC/0111054 (2001)

Nick Chater, Paul M. B. Vitányi: The Generalized Universal Law of Generalization. CoRR cs.CV/0101036 (2001)

John Tromp, Paul M. B. Vitányi: Randomized Two-Process Wait-Free Test-and-Set. CoRR cs.DC/0106056 (2001)

Sibsankar Haldar, Paul M. B. Vitányi: Bounded Concurrent Timestamp Systems Using Vector Clocks. CoRR cs.DC/0108002 (2001)

Paul M. B. Vitányi: Randomness. CoRR math.PR/0110086 (2001)

Harry Buhrman, John Tromp, Paul M. B. Vitányi: Time and Space Bounds for Reversible Simulation. CoRR quant-ph/0101133 (2001)

Paul M. B. Vitányi: Quantum Kolmogorov Complexity Based on Classical Descriptions. CoRR quant-ph/0102108 (2001)

Qiong Gao, Ming Li, Paul M. B. Vitányi: Applying MDL to learn best model granularity. Artif. Intell. 121(1-2): 1-29 (2000)

Tao Jiang, Ming Li, Paul M. B. Vitányi: A lower bound on the average-case complexity of shellsort. J. ACM 47(5): 905-911 (2000)

Tao Jiang, Ming Li, Paul M. B. Vitányi: Average-Case Analysis of Algorithms Using Kolmogorov Complexity. J. Comput. Sci. Technol. 15(5): 402-408 (2000)

Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi: New applications of the incompressibility method: Part II. Theor. Comput. Sci. 235(1): 59-70 (2000)

Paul M. B. Vitányi: A discipline of evolutionary programming. Theor. Comput. Sci. 241(1-2): 3-23 (2000)

Paul M. B. Vitányi, Ming Li: Minimum description length induction, Bayesianism, and Kolmogorov complexity. IEEE Transactions on Information Theory 46(2): 446-464 (2000)

Péter Gács, John Tromp, Paul M. B. Vitányi: Towards an Algorithmic Statistics. ALT 2000: 41-55

Paul M. B. Vitányi: Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State. IEEE Conference on Computational Complexity 2000: 263-270

Tao Jiang, Ming Li, Paul M. B. Vitányi: The Incompressibility Method. SOFSEM 2000: 36-53

Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi: On the Importance of Having an Identity or is Consensus Really Universal? DISC 2000: 134-148

Péter Gács, John Tromp, Paul M. B. Vitányi: Algorithmic Statistics. CoRR math.PR/0006233 (2000)

Qiong Gao, Ming Li, Paul M. B. Vitányi: Applying MDL to Learning Best Model Granularity. CoRR physics/0005062 (2000)

Tao Jiang, Ming Li, Paul M. B. Vitányi: New Applications of the Incompressibility Method. Comput. J. 42(4): 287-293 (1999)

Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi: Mutual Search. J. ACM 46(4): 517-536 (1999)

Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi: Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method. SIAM J. Comput. 28(4): 1414-1432 (1999)

Harry Buhrman, Ming Li, John Tromp, Paul M. B. Vitányi: Kolmogorov Random Graphs and the Incompressibility Method. SIAM J. Comput. 29(2): 590-599 (1999)

Tao Jiang, Ming Li, Paul M. B. Vitányi: Some Examples of Average-case Analysis by the Imcompressibility Method. Jewels are Forever 1999: 250-261

Tao Jiang, Ming Li, Paul M. B. Vitányi: The Expected Size of Heilbronn's Triangles. IEEE Conference on Computational Complexity 1999: 105-113

Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi: New Applications of the Incompressibility Method. ICALP 1999: 220-229

Tao Jiang, Ming Li, Paul M. B. Vitányi: Average-Case Complexity of Shellsort. ICALP 1999: 453-462

Tao Jiang, Ming Li, Paul M. B. Vitányi: Average-Case Complexity of Shellsort (Preliminary version). CoRR cs.CC/9906008 (1999)

Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi: Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method. CoRR cs.DC/9903009 (1999)

Tao Jiang, Ming Li, Paul M. B. Vitányi: Average-Case Complexity of Shellsort. CoRR cs.DS/9901010 (1999)

Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi: Mutual Search. CoRR cs.DS/9902005 (1999)

Paul M. B. Vitányi, Ming Li: Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity. CoRR cs.LG/9901014 (1999)

Paul M. B. Vitányi: A Discipline of Evolutionary Programming. CoRR cs.NE/9902006 (1999)

Tao Jiang, Ming Li, Paul M. B. Vitányi: The Average-Case Area of Heilbronn-Type Triangles. CoRR math.CO/9902043 (1999)

Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi: Randomized Naming Using Wait-Free Shared Variables. Distributed Computing 11(3): 113-124 (1998)

Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek: Information Distance. IEEE Transactions on Information Theory 44(4): 1407-1423 (1998)

Ming Li, Paul M. B. Vitányi: Average-Case Analysis Using Kolgomorov Complexity (Abstract). CATS 1998: 1-4

Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi: Mutual Search (Extended Abstract). SODA 1998: 481-489

Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi: New Applications of the Incompressibility Method: Part II. CoRR cs.CC/9809060 (1998)

Tao Jiang, Ming Li, Paul M. B. Vitányi: New Applications of the Incompressibility Method: Part I. CoRR cs.CC/9809061 (1998)

Ming Li, Paul M. B. Vitányi: An introduction to Kolmogorov complexity and its applications (2. ed.). Graduate texts in computer science, Springer 1997, isbn 978-0-387-94868-3, pp. I-XXI, 1-637

Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Two heads are better than two tapes. J. ACM 44(2): 237-256 (1997)

Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Erratum: ``Two heads are better that two tapes''. J. ACM 44(4): 632 (1997)

Ming Li, Paul M. B. Vitányi: Average-Case Analysis Using Kolmogorov Complexity. Advances in Algorithms, Languages, and Complexity 1997: 157-169

Paul M. B. Vitányi: Mutual Search (abstract). COCOON 1997: 514

Paul M. B. Vitányi, Ming Li: On Prediction by Data Compression. ECML 1997: 14-30

Ming Li, Paul M. B. Vitányi: Average-Case Analysis via Incompressibility. FCT 1997: 38-50

Ming Li, John Tromp, Paul M. B. Vitányi: Reversible Simulation of Irreversible Computation by Pebble Games. CoRR quant-ph/9703009 (1997)

Ming Li, Paul M. B. Vitányi: Reversibility and Adiabatic Computation: Trading Time and Space for Energy. CoRR quant-ph/9703022 (1997)

Ming Li, John Tromp, Paul M. B. Vitányi: How to Share Concurrent Wait-Free Variables. J. ACM 43(4): 723-746 (1996)

Paul M. B. Vitányi: Genetic Fitness Optimization Using Rapidly Mixing Markov Chains. ALT 1996: 67-82

Ming Li, Paul M. B. Vitányi: Reversible Simulation of Irreversible Computation. IEEE Conference on Computational Complexity 1996: 301-306

Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi: Optimal Routing Tables. PODC 1996: 134-142

Ming Li, Paul M. B. Vitányi: A New Approach to Formal Language Theory by Kolmogorov Complexity. SIAM J. Comput. 24(2): 398-410 (1995)

Paul M. B. Vitányi: Physics and the New Computation. MFCS 1995: 106-128

Paul M. B. Vitányi, Ming Li: Algorithmic Arguments in Physics of Computation. WADS 1995: 315-333

Ming Li, Paul M. B. Vitányi: Computational Machine Learning in Theory and Praxis. Computer Science Today 1995: 518-535

Paul M. B. Vitányi (Ed.): Computational Learning Theory, Second European Conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995, Proceedings. Lecture Notes in Computer Science 904, Springer 1995, isbn 3-540-59119-2

Ming Li, Paul M. B. Vitányi: Kolmogorov Complexity Arguments in Combinatorics. J. Comb. Theory, Ser. A 66(2): 226-236 (1994)

Ming Li, Paul M. B. Vitányi: Statistical Properties of Finite Sequences with High Kolmogorov Complexity. Mathematical Systems Theory 27(4): 365-376 (1994)

Guido te Brake, Joost N. Kok, Paul M. B. Vitányi: Model selection for neural networks: comparing MDL and NIC. ESANN 1994

Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi: Randomized Wait-Free Naming. ISAAC 1994: 83-91

Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Two heads are better than two tapes. STOC 1994: 668-675

Gerard Tel, Paul M. B. Vitányi (Eds.): Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings. Lecture Notes in Computer Science 857, Springer 1994, isbn 3-540-58449-8

Ming Li, Paul M. B. Vitányi: An introduction to Kolmogorov complexity and its applications. Texts and monographs in computer science, Springer 1993, isbn 978-3-540-94053-1, pp. I-XX, 1-546

Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek: Thermodynamics of computation and information distance. STOC 1993: 21-30

Ming Li, Paul M. B. Vitányi: Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity. Inf. Process. Lett. 42(3): 145-149 (1992)

Ming Li, Paul M. B. Vitányi: Optimality of Wait-Free Atomic Multiwriter Variables. Inf. Process. Lett. 43(2): 107-112 (1992)

Ming Li, Paul M. B. Vitányi: Inductive Reasoning and Kolmogorov Complexity. J. Comput. Syst. Sci. 44(2): 343-384 (1992)

Evangelos Kranakis, Paul M. B. Vitányi: A Note on Weighted Distributed Match-Making. Mathematical Systems Theory 25(2): 123-140 (1992)

Ming Li, Luc Longpré, Paul M. B. Vitányi: The Power of the Queue. SIAM J. Comput. 21(4): 697-712 (1992)

Ming Li, Paul M. B. Vitányi: Philosophical Issues in Kolmogorov Complexity. ICALP 1992: 1-15

Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitányi: Wait-free Test-and-Set (Extended Abstract). WDAG 1992: 85-94

Ming Li, Paul M. B. Vitányi: An introduction to Kolmogorov - complexity and its applications ; part 1: theory. CWI 1991, pp. 1-340

Ming Li, Paul M. B. Vitányi: Learning Simple Concept Under Simple Distributions. SIAM J. Comput. 20(5): 911-935 (1991)

Ming Li, Paul M. B. Vitányi: Combinatorics and Kolmogorov Complexity. Structure in Complexity Theory Conference 1991: 154-163

Ming Li, Paul M. B. Vitányi: Kolmogorov Complexity and its Applications. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 187-254

Ming Li, Paul M. B. Vitányi: Inductive Reasoning and Komogorov Complexity. Structure in Complexity Theory Conference 1989: 165-185

Ming Li, Paul M. B. Vitányi: A Theory of Learning Simple Concepts Under Simple Distributions and Average Case Complexity for the Universal Distribution (Extended Abstract). FOCS 1989: 34-39

Ming Li, Paul M. B. Vitányi: How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version). ICALP 1989: 488-505

Ming Li, Paul M. B. Vitányi: A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version). ICALP 1989: 506-520

Sape J. Mullender, Paul M. B. Vitányi: Distributed Match-Making. Algorithmica 3: 367-391 (1988)

Ming Li, Paul M. B. Vitányi: Tape versus Queue and Stacks: The Lower Bounds. Inf. Comput. 78(1): 56-85 (1988)

Joel I. Seiferas, Paul M. B. Vitányi: Counting is easy. J. ACM 35(4): 985-1000 (1988)

Paul M. B. Vitányi: Locality, Communication, and Interconnect Length in Multicomputers. SIAM J. Comput. 17(4): 659-672 (1988)

Evangelos Kranakis, Paul M. B. Vitányi: Weighted Distributed Match-Making. AWOC 1988: 361-368

Ming Li, Paul M. B. Vitányi: Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87. Structure in Complexity Theory Conference 1988: 80-101

Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi: A Proof Technique for Register Automicity. FSTTCS 1988: 286-303

Paul M. B. Vitányi, Baruch Awerbuch: Errata to ``Atomic Shared Register Access by Asynchronous Hardware''. FOCS 1987: 487

Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi: Atomic Multireader Register. WDAG 1987: 278-296

Sape J. Mullender, Paul M. B. Vitányi: Distributed Match-Making for Processes in Computer Networks (Preliminary Version). Operating Systems Review 20(2): 54-64 (1986)

Paul M. B. Vitányi: Nonsequentail Computation and Laws of Nature. Aegean Workshop on Computing 1986: 108-120

Ming Li, Luc Longpré, Paul M. B. Vitányi: The Power of the Queue. Structure in Complexity Theory Conference 1986: 218-233

Paul M. B. Vitányi, Baruch Awerbuch: Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract). FOCS 1986: 233-243

Paul M. B. Vitányi: Logarithmic signal propagation delay and the efficiency of VLSI circuits. Bulletin of the EATCS 25: 37-39 (1985)

Paul M. B. Vitányi: Square Time is Optimal for Simulation of One Pushdown Store or One Queue by an Oblivious One-Head Tape Unit. Inf. Process. Lett. 21(2): 87-91 (1985)

Paul M. B. Vitányi: An n^1.618 Lower Bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape. Inf. Process. Lett. 21(3): 147-152 (1985)

Paul M. B. Vitányi: An Optimal Simulation of Counter Machines. SIAM J. Comput. 14(1): 1-33 (1985)

Paul M. B. Vitányi: An Optimal Simulation of Counter Machines: The ACM Case. SIAM J. Comput. 14(1): 34-40 (1985)

Paul M. B. Vitányi: Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary Version). FOCS 1985: 197-207

Sape J. Mullender, Paul M. B. Vitányi: Distributed Match-Making for Processes in Computer Networks (Preliminary Version). PODC 1985: 261-271

Paul M. B. Vitányi, Lambert G. L. T. Meertens: Big omega versus the wild functions. Bulletin of the EATCS 22: 14-19 (1984)

Walter J. Savitch, Paul M. B. Vitányi: On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps. Inf. Process. Lett. 19(1): 31-35 (1984)

Paul M. B. Vitányi: On Two-Tape Real-Time Computation and Queues. J. Comput. Syst. Sci. 29(3): 303-311 (1984)

Paul M. B. Vitányi: On the Simulation of Many Storage Heads by One. Theor. Comput. Sci. 34: 157-168 (1984)

Paul M. B. Vitányi: The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version). ICALP 1984: 486-489

Paul M. B. Vitányi: Distributed Elections in an Archimedean Ring of Processors (Preliminary Version). STOC 1984: 542-547

Paul M. B. Vitányi: On the Simulation of Many Storage Heads by a Single One (Extended Abstract). ICALP 1983: 687-694

Paul M. B. Vitányi: On Efficient Simulations of Multicounter Machines. Information and Control 55(1-3): 20-39 (1982)

Paul M. B. Vitányi: Efficient Simulations of Multicounter Machines. ICALP 1982: 546-560

Paul M. B. Vitányi: Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines. STOC 1982: 27-36

Paul M. B. Vitányi: How well can a graph be n-colored? Discrete Mathematics 34(1): 69-80 (1981)

Paul M. B. Vitányi: Achievable High Scores of epsilon-Moves and Running Times in DPDA Computations. Inf. Process. Lett. 10(2): 83-86 (1980)

Paul M. B. Vitányi: On the Power of Real-Time Machines Under Varying Specifications (Extended Abstract). ICALP 1980: 658-671

Paul M. B. Vitányi: Relativized Obliviousness. MFCS 1980: 665-672

Paul M. B. Vitányi, Adrian Walker: Stable String Languages of Lindenmayer Systems. Information and Control 37(2): 134-149 (1978)

Peter van Emde Boas, Paul M. B. Vitányi: A note on the recursive enumerability of some classes of recursively enumerable languages. Inf. Sci. 14(1): 89-91 (1978)

Paul M. B. Vitányi, Walter J. Savitch: On Inverse Deterministic Pushdown Transductions. J. Comput. Syst. Sci. 16(3): 423-444 (1978)

Paul M. B. Vitányi: Context Sensitive Table Lindenmayer Languages and a Relation to the LBA Problem. Information and Control 33(3): 217-226 (1977)

Walter J. Savitch, Paul M. B. Vitányi: Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps. ICALP 1977: 453-464

Paul M. B. Vitányi: Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms. Theor. Comput. Sci. 2(1): 49-71 (1976)

Paul M. B. Vitányi: On the Size of D0L Languages. L Systems 1974: 78-92

Paul M. B. Vitányi: Growth of Strings in Context Dependent Lindenmayer Systems. L Systems 1974: 104-126