default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul M. B. Vitányi
Person information
- affiliation: National Research Institute for Mathematics and Computer Science, Amsterdam, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j90]Andrew R. Cohen
, Paul M. B. Vitányi:
The Cluster Structure Function. IEEE Trans. Pattern Anal. Mach. Intell. 45(9): 11309-11320 (2023)- 2022
- [j89]Rudi Cilibrasi, Paul M. B. Vitányi:
Fast Phylogeny of SARS-CoV-2 by Compression. Entropy 24(4): 439 (2022) - [i78]Andrew R. Cohen, Paul M. B. Vitányi:
The cluster structure function. CoRR abs/2201.01222 (2022) - 2020
- [j88]Paul M. B. Vitányi:
How Incomputable Is Kolmogorov Complexity? Entropy 22(4): 408 (2020) - [j87]Andrew R. Cohen, Paul M. B. Vitányi:
Web Similarity in Sets of Search Terms Using Database Queries. SN Comput. Sci. 1(3): 161 (2020)
2010 – 2019
- 2019
- [b5]Ming Li, Paul M. B. Vitányi:
An Introduction to Kolmogorov Complexity and Its Applications, 4th Edition. Texts in Computer Science, Springer 2019, ISBN 978-3-030-11297-4, pp. 1-761 - [j86]Paul M. B. Vitányi:
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. 770: 101 (2019) - [j85]Paul M. B. Vitányi:
Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines. Theor. Comput. Sci. 778: 78-80 (2019) - [i77]Paul M. B. Vitányi:
Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines. CoRR abs/1908.10805 (2019) - 2018
- [j84]Paul M. B. Vitányi:
On the average-case complexity of Shellsort. Random Struct. Algorithms 52(2): 354-363 (2018) - 2017
- [j83]Luis Filipe Coelho Antunes, Andre Souto, Paul M. B. Vitányi:
On the rate of decrease in logical depth. Theor. Comput. Sci. 702: 60-64 (2017) - [j82]Paul M. B. Vitányi:
Exact Expression For Information Distance. IEEE Trans. Inf. Theory 63(8): 4725-4728 (2017) - [i76]Paul M. B. Vitányi, Nick Chater:
Identification of Probabilities. CoRR abs/1708.01611 (2017) - 2016
- [r3]Paul M. B. Vitányi:
Registers. Encyclopedia of Algorithms 2016: 1808-1812 - 2015
- [j81]Andrew R. Cohen, Paul M. B. Vitányi:
Normalized Compression Distance of Multisets with Applications. IEEE Trans. Pattern Anal. Mach. Intell. 37(8): 1602-1614 (2015) - [i75]Paul M. B. Vitányi:
On The Average-Case Complexity of Shellsort. CoRR abs/1501.06461 (2015) - [i74]Andrew R. Cohen, Paul M. B. Vitányi:
Web Similarity. CoRR abs/1502.05957 (2015) - 2014
- [i73]Rudi Cilibrasi, Paul M. B. Vitányi:
A Fast Quartet Tree Heuristic for Hierarchical Clustering. CoRR abs/1409.4276 (2014) - [i72]Paul M. B. Vitányi:
Exact Expression For Information Distance. CoRR abs/1410.7328 (2014) - 2013
- [j80]Paul M. B. Vitányi:
Conditional Kolmogorov complexity and universal probability. Theor. Comput. Sci. 501: 93-100 (2013) - [j79]Anne S. Hsu, Nick Chater, Paul M. B. Vitányi:
Language Learning From Positive Evidence, Reconsidered: A Simplicity-Based Approach. Top. Cogn. Sci. 5(1): 35-55 (2013) - [i71]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) - [i70]Luis Filipe Coelho Antunes, Andre Souto, Andreia Teixeira, Paul M. B. Vitányi:
On the logical depth function. CoRR abs/1301.4451 (2013) - [i69]Andrew R. Cohen, Paul M. B. Vitányi:
Normalized Google Distance of Multisets with Applications. CoRR abs/1308.3177 (2013) - [i68]Luis Filipe Coelho Antunes, Andre Souto, Paul M. B. Vitányi:
On Logical Depth and the Running Time of Shortest Programs. CoRR abs/1310.6976 (2013) - [i67]Paul M. B. Vitányi, Nick Chater:
Algorithmic Identification of Probabilities. CoRR abs/1311.7385 (2013) - 2012
- [j78]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) - [i66]Paul M. B. Vitányi:
Information Distance: New Developments. CoRR abs/1201.1221 (2012) - [i65]Paul M. B. Vitányi:
Turing Machines and Understanding Computational Complexity. CoRR abs/1201.1223 (2012) - [i64]Paul M. B. Vitányi:
Conditional Kolmogorov Complexity and Universal Probability. CoRR abs/1206.0983 (2012) - [i63]Andrew R. Cohen, Paul M. B. Vitányi:
Normalized Compression Distance of Multiples. CoRR abs/1212.5711 (2012) - 2011
- [j77]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) - [j76]Rudi Cilibrasi, Paul M. B. Vitányi:
A Fast Quartet tree heuristic for hierarchical clustering. Pattern Recognit. 44(3): 662-677 (2011) - [j75]Paul M. B. Vitányi:
Information Distance in Multiples. IEEE Trans. Inf. Theory 57(4): 2451-2456 (2011) - [c73]Paul M. B. Vitányi:
Compression-Based Similarity. CCP 2011: 111-118 - [i62]Paul M. B. Vitányi:
On Empirical Entropy. CoRR abs/1103.5985 (2011) - [i61]Paul M. B. Vitányi:
Compression-based Similarity. CoRR abs/1110.4544 (2011) - 2010
- [j74]Paul M. B. Vitányi:
Ray Solomonoff, Founding Father of Algorithmic Information Theory. Algorithms 3(3): 260-264 (2010) - [j73]Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Rate distortion and denoising of individual data using Kolmogorov complexity. IEEE Trans. Inf. Theory 56(7): 3438-3454 (2010) - [r2]Paul M. B. Vitányi, Rudi Cilibrasi:
Normalized Web Distance and Word Similarity. Handbook of Natural Language Processing 2010: 293-314 - [i60]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) - [i59]Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi:
Normalized Information Distance is Not Semicomputable. CoRR abs/1006.3275 (2010) - [i58]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Information Distance. CoRR abs/1006.3520 (2010)
2000 – 2009
- 2009
- [j72]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) - [j71]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) - [j70]Paul M. B. Vitányi:
Turing machine. Scholarpedia 4(3): 6240 (2009) - [j69]Pieter W. Adriaans, Paul M. B. Vitányi:
Approximation of the Two-Part MDL Code. IEEE Trans. Inf. Theory 55(1): 444-457 (2009) - [i57]Paul M. B. Vitányi:
Information Distance in Multiples. CoRR abs/0905.3347 (2009) - [i56]Rudi Cilibrasi, Paul M. B. Vitányi:
Normalized Web Distance and Word Similarity. CoRR abs/0905.4039 (2009) - [i55]Paul M. B. Vitányi:
Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey). CoRR abs/0905.4452 (2009) - [i54]Paul M. B. Vitányi:
Distributed elections in an Archimedean ring of processors. CoRR abs/0906.0731 (2009) - [i53]Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi:
Nonapproximablity of the Normalized Information Distance. CoRR abs/0910.4353 (2009) - 2008
- [b4]Ming Li, Paul M. B. Vitányi:
An Introduction to Kolmogorov Complexity and Its Applications, Third Edition. Texts in Computer Science, Springer 2008, ISBN 978-0-387-33998-6, pp. i-xxiii, 1-790 - [r1]Paul M. B. Vitányi:
Registers. Encyclopedia of Algorithms 2008 - [i52]Luis Antunes, Armando Matos, Andre Souto, Paul M. B. Vitányi:
Depth as Randomness Deficiency. CoRR abs/0809.2546 (2008) - [i51]Paul M. B. Vitányi, Frank J. Balbach, Rudi Cilibrasi, Ming Li:
Normalized Information Distance. CoRR abs/0809.2553 (2008) - [i50]Peter D. Grünwald, Paul M. B. Vitányi:
Algorithmic information theory. CoRR abs/0809.2754 (2008) - [i49]Edgar G. Daylight, Wouter M. Koolen, Paul M. B. Vitányi:
On Time-Bounded Incompressibility of Compressible Strings. CoRR abs/0809.2965 (2008) - 2007
- [j68]Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Individual communication complexity. J. Comput. Syst. Sci. 73(6): 973-985 (2007) - [j67]Paul M. B. Vitányi:
Andrey Nikolaevich Kolmogorov. Scholarpedia 2(2): 2798 (2007) - [j66]Ming Li, Paul M. B. Vitányi:
Applications of algorithmic information theory. Scholarpedia 2(5): 2658 (2007) - [j65]Marcus Hutter, Shane Legg, Paul M. B. Vitányi:
Algorithmic probability. Scholarpedia 2(8): 2572 (2007) - [j64]Rudi Cilibrasi, Paul M. B. Vitányi:
The Google Similarity Distance. IEEE Trans. Knowl. Data Eng. 19(3): 370-383 (2007) - [c72]Pieter W. Adriaans, Paul M. B. Vitányi:
The Power and Perils of MDL. ISIT 2007: 2216-2220 - 2006
- [j63]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi:
On the importance of having an identity or, is consensus really universal?. Distributed Comput. 18(3): 167-176 (2006) - [j62]Paul M. B. Vitányi:
Meaningful Information. IEEE Trans. Inf. Theory 52(10): 4617-4626 (2006) - [c71]Cristina Costa-Santos, João Bernardes, Paul M. B. Vitányi, Luis Antunes:
Clustering Fetal Heart Rate Tracings by Compression. CBMS 2006: 685-690 - [c70]Nikolai K. Vereshchagin, Paul M. B. Vitányi:
On Algorithmic Rate-Distortion Function. ISIT 2006: 798-802 - [c69]Rudi Cilibrasi, Paul M. B. Vitányi:
Automatic Extraction of Meaning from the Web. ISIT 2006: 2309-2313 - [c68]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 - [c67]Rudi Cilibrasi, Paul M. B. Vitányi:
Similarity of Objects and the Meaning of Words. TAMC 2006: 21-45 - [e3]Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi:
Kolmogorov Complexity and Applications, 29.01. - 03.02.2006. Dagstuhl Seminar Proceedings 06051, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i48]Rudi Cilibrasi, Paul M. B. Vitányi:
A New Quartet Tree Heuristic for Hierarchical Clustering. Theory of Evolutionary Algorithms 2006 - [i47]Rudi Cilibrasi, Paul M. B. Vitányi:
Automatic Meaning Discovery Using Google. Kolmogorov Complexity and Applications 2006 - [i46]Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi:
06051 Abstracts Collection -- Kolmogorov Complexity and Applications. Kolmogorov Complexity and Applications 2006 - [i45]Rudi Cilibrasi, Paul M. B. Vitányi:
Similarity of Objects and the Meaning of Words. CoRR abs/cs/0602065 (2006) - [i44]Rudi Cilibrasi, Paul M. B. Vitányi:
A New Quartet Tree Heuristic for Hierarchical Clustering. CoRR abs/cs/0606048 (2006) - [i43]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) - [i42]Paul M. B. Vitányi:
Registers. CoRR abs/cs/0612025 (2006) - [i41]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) - [i40]Pieter W. Adriaans, Paul M. B. Vitányi:
The Power and Perils of MDL. CoRR abs/cs/0612095 (2006) - [i39]Paul M. B. Vitányi, Zvi Lotker:
Tales of Huffman. CoRR abs/cs/0612133 (2006) - [i38]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) - 2005
- [j61]Rudi Cilibrasi, Paul M. B. Vitányi:
Clustering by compression. IEEE Trans. Inf. Theory 51(4): 1523-1545 (2005) - [c66]Paul M. B. Vitányi:
Time, space, and energy in reversible computing. Conf. Computing Frontiers 2005: 435-444 - [c65]Paul M. B. Vitányi:
Universal similarity. ITW 2005: 238-243 - [i37]Paul M. B. Vitányi:
Time, Space, and Energy in Reversible Computing. CoRR abs/cs/0504088 (2005) - [i36]Paul M. B. Vitányi:
Universal Similarity. CoRR abs/cs/0504089 (2005) - 2004
- [j60]Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf:
Algorithmic Clustering of Music Based on String Compression. Comput. Music. J. 28(4): 49-67 (2004) - [j59]Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi:
The similarity metric. IEEE Trans. Inf. Theory 50(12): 3250-3264 (2004) - [j58]Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Kolmogorov's structure functions and model selection. IEEE Trans. Inf. Theory 50(12): 3265-3290 (2004) - [c64]Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Individual Communication Complexity: Extended Abstract. STACS 2004: 19-30 - [c63]Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf:
Algorithmic Clustering of Music. WEDELMUSIC 2004: 110-117 - [i35]Rudi Cilibrasi, Paul M. B. Vitányi:
The Google Similarity Distance. CoRR abs/cs/0412098 (2004) - [i34]Peter Grünwald, Paul M. B. Vitányi:
Shannon Information and Kolmogorov Complexity. CoRR cs.IT/0410002 (2004) - [i33]Nikolai K. Vereshchagin, Paul M. B. Vitányi:
A Theory of Lossy Compression for Individual Data. CoRR cs.IT/0411014 (2004) - 2003
- [j57]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's razor. Inf. Process. Lett. 85(5): 267-274 (2003) - [j56]Peter Grünwald, Paul M. B. Vitányi:
Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers. J. Log. Lang. Inf. 12(4): 497-529 (2003) - [c62]Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi:
The similarity metric. SODA 2003: 863-872 - [i32]Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Individual Communication Complexity. CoRR cs.CC/0304012 (2003) - [i31]Rudi Cilibrasi, Paul M. B. Vitányi:
Clustering by compression. CoRR cs.CV/0312044 (2003) - [i30]Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf:
Algorithmic Clustering of Music. CoRR cs.SD/0303025 (2003) - [i29]Paul M. B. Vitányi:
Algorithmic Chaos. CoRR nlin.CD/0303016 (2003) - 2002
- [j55]John Tromp, Paul M. B. Vitányi:
Randomized two-process wait-free test-and-set. Distributed Comput. 15(3): 127-135 (2002) - [j54]Sibsankar Haldar, Paul M. B. Vitányi:
Bounded concurrent timestamp systems using vector clocks. J. ACM 49(1): 101-126 (2002) - [j53]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) - [j52]Paul M. B. Vitányi:
Correction to "Quantum Kolmogorov complexity based on classical descriptions". IEEE Trans. Inf. Theory 48(4): 1000 (2002) - [j51]Péter Gács, John Tromp, Paul M. B. Vitányi:
Correction to "Algorithmic statistics". IEEE Trans. Inf. Theory 48(8): 2427 (2002) - [c61]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's Razor. COCOON 2002: 411-419 - [c60]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 - [c59]Paul M. B. Vitányi:
Meaningful Information. ISAAC 2002: 588-599 - [c58]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 - [c57]Paul M. B. Vitányi:
Simple Wait-Free Multireader Registers. DISC 2002: 118-132 - [i28]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) - [i27]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) - [i26]Paul M. B. Vitányi:
Simple Wait-free Multireader Registers. CoRR cs.DC/0202003 (2002) - [i25]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's Razor. CoRR cs.LG/0201005 (2002) - 2001
- [j50]Péter Gács, John Tromp, Paul M. B. Vitányi:
Algorithmic statistics. IEEE Trans. Inf. Theory 47(6): 2443-2463 (2001) - [j49]Paul M. B. Vitányi:
Quantum Kolmogorov complexity based on classical descriptions. IEEE Trans. Inf. Theory 47(6): 2464-2479 (2001) - [c56]Paul M. B. Vitányi:
The Quantum Computing Challenge. Informatics 2001: 219-233 - [c55]Harry Buhrman, John Tromp, Paul M. B. Vitányi:
Time and Space Bounds for Reversible Simulation. ICALP 2001: 1017-1027 - [c54]Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe:
On a Generalized Ruin Problem. RANDOM-APPROX 2001: 181-191 - [i24]Joel I. Seiferas, Paul M. B. Vitányi:
Counting is Easy. CoRR cs.CC/0110038 (2001) - [i23]Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi:
Two heads are better than two tapes. CoRR cs.CC/0110039 (2001) - [i22]Ming Li, Paul M. B. Vitányi:
A New Approach to Formal Language Theory by Kolmogorov Complexity. CoRR cs.CC/0110040 (2001) - [i21]Paul M. B. Vitányi:
Meaningful Information. CoRR cs.CC/0111053 (2001) - [i20]Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi:
The similarity metric. CoRR cs.CC/0111054 (2001) - [i19]Nick Chater, Paul M. B. Vitányi:
The Generalized Universal Law of Generalization. CoRR cs.CV/0101036 (2001) - [i18]John Tromp, Paul M. B. Vitányi:
Randomized Two-Process Wait-Free Test-and-Set. CoRR cs.DC/0106056 (2001) - [i17]Sibsankar Haldar, Paul M. B. Vitányi:
Bounded Concurrent Timestamp Systems Using Vector Clocks. CoRR cs.DC/0108002 (2001) - [i16]Paul M. B. Vitányi:
Randomness. CoRR math.PR/0110086 (2001) - [i15]Harry Buhrman, John Tromp, Paul M. B. Vitányi:
Time and Space Bounds for Reversible Simulation. CoRR quant-ph/0101133 (2001) - [i14]Paul M. B. Vitányi:
Quantum Kolmogorov Complexity Based on Classical Descriptions. CoRR quant-ph/0102108 (2001) - 2000
- [j48]Qiong Gao, Ming Li, Paul M. B. Vitányi:
Applying MDL to learn best model granularity. Artif. Intell. 121(1-2): 1-29 (2000) - [j47]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) - [j46]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) - [j45]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) - [j44]Paul M. B. Vitányi:
A discipline of evolutionary programming. Theor. Comput. Sci. 241(1-2): 3-23 (2000) - [j43]Paul M. B. Vitányi, Ming Li:
Minimum description length induction, Bayesianism, and Kolmogorov complexity. IEEE Trans. Inf. Theory 46(2): 446-464 (2000) - [c53]Péter Gács, John Tromp, Paul M. B. Vitányi:
Towards an Algorithmic Statistics. ALT 2000: 41-55 - [c52]Paul M. B. Vitányi:
Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State. CCC 2000: 263-270 - [c51]Tao Jiang, Ming Li, Paul M. B. Vitányi:
The Incompressibility Method. SOFSEM 2000: 36-53 - [c50]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 - [i13]Péter Gács, John Tromp, Paul M. B. Vitányi:
Algorithmic Statistics. CoRR math.PR/0006233 (2000) - [i12]Qiong Gao, Ming Li, Paul M. B. Vitányi:
Applying MDL to Learning Best Model Granularity. CoRR physics/0005062 (2000)
1990 – 1999
- 1999
- [j42]Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method. Comput. J. 42(4): 287-293 (1999) - [j41]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) - [j40]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) - [j39]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) - [c49]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 - [c48]Tao Jiang, Ming Li, Paul M. B. Vitányi:
The Expected Size of Heilbronn's Triangles. CCC 1999: 105-113 - [c47]Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method. ICALP 1999: 220-229 - [c46]Tao Jiang, Ming Li, Paul M. B. Vitányi:
Average-Case Complexity of Shellsort. ICALP 1999: 453-462 - [i11]Tao Jiang, Ming Li, Paul M. B. Vitányi:
Average-Case Complexity of Shellsort (Preliminary version). CoRR cs.CC/9906008 (1999) - [i10]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) - [i9]Tao Jiang, Ming Li, Paul M. B. Vitányi:
Average-Case Complexity of Shellsort. CoRR cs.DS/9901010 (1999) - [i8]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) - [i7]Paul M. B. Vitányi, Ming Li:
Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity. CoRR cs.LG/9901014 (1999) - [i6]Paul M. B. Vitányi:
A Discipline of Evolutionary Programming. CoRR cs.NE/9902006 (1999) - [i5]Tao Jiang, Ming Li, Paul M. B. Vitányi:
The Average-Case Area of Heilbronn-Type Triangles. CoRR math.CO/9902043 (1999) - 1998
- [j38]Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi:
Randomized Naming Using Wait-Free Shared Variables. Distributed Comput. 11(3): 113-124 (1998) - [j37]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Information Distance. IEEE Trans. Inf. Theory 44(4): 1407-1423 (1998) - [c45]Ming Li, Paul M. B. Vitányi:
Average-Case Analysis Using Kolgomorov Complexity (Abstract). CATS 1998: 1-4 - [c44]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 - [i4]Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method: Part II. CoRR cs.CC/9809060 (1998) - [i3]Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method: Part I. CoRR cs.CC/9809061 (1998) - 1997
- [b3]Ming Li, Paul M. B. Vitányi:
An introduction to Kolmogorov complexity and its applications, Second Edition. Graduate Texts in Computer Science, Springer 1997, ISBN 978-0-387-94868-3, pp. I-XXI, 1-637 - [j36]Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi:
Two heads are better than two tapes. J. ACM 44(2): 237-256 (1997) - [j35]Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi:
Erratum: "Two heads are better that two tapes". J. ACM 44(4): 632 (1997) - [c43]Ming Li, Paul M. B. Vitányi:
Average-Case Analysis Using Kolmogorov Complexity. Advances in Algorithms, Languages, and Complexity 1997: 157-169 - [c42]Paul M. B. Vitányi:
Mutual Search (abstract). COCOON 1997: 514 - [c41]Paul M. B. Vitányi, Ming Li:
On Prediction by Data Compression. ECML 1997: 14-30 - [c40]Ming Li, Paul M. B. Vitányi:
Average-Case Analysis via Incompressibility. FCT 1997: 38-50 - [c39]Harry Buhrman, Ming Li, Paul M. B. Vitányi:
Kolmogorov random graphs. SEQUENCES 1997: 78-96 - [i2]Ming Li, John Tromp, Paul M. B. Vitányi:
Reversible Simulation of Irreversible Computation by Pebble Games. CoRR quant-ph/9703009 (1997) - [i1]Ming Li, Paul M. B. Vitányi:
Reversibility and Adiabatic Computation: Trading Time and Space for Energy. CoRR quant-ph/9703022 (1997) - 1996
- [j34]Ming Li, John Tromp, Paul M. B. Vitányi:
How to Share Concurrent Wait-Free Variables. J. ACM 43(4): 723-746 (1996) - [c38]Paul M. B. Vitányi:
Genetic Fitness Optimization Using Rapidly Mixing Markov Chains. ALT 1996: 67-82 - [c37]Ming Li, Paul M. B. Vitányi:
Reversible Simulation of Irreversible Computation. CCC 1996: 301-306 - [c36]Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi:
Optimal Routing Tables. PODC 1996: 134-142 - 1995
- [j33]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) - [c35]Paul M. B. Vitányi:
Physics and the New Computation. MFCS 1995: 106-128 - [c34]Paul M. B. Vitányi, Ming Li:
Algorithmic Arguments in Physics of Computation. WADS 1995: 315-333 - [p2]Ming Li, Paul M. B. Vitányi:
Computational Machine Learning in Theory and Praxis. Computer Science Today 1995: 518-535 - [e2]Paul M. B. Vitányi:
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 [contents] - 1994
- [j32]Ming Li, Paul M. B. Vitányi:
Kolmogorov Complexity Arguments in Combinatorics. J. Comb. Theory A 66(2): 226-236 (1994) - [j31]Ming Li, Paul M. B. Vitányi:
Statistical Properties of Finite Sequences with High Kolmogorov Complexity. Math. Syst. Theory 27(4): 365-376 (1994) - [c33]Guido M. te Brake, Joost N. Kok, Paul M. B. Vitányi:
Model selection for neural networks: comparing MDL and NIC. ESANN 1994 - [c32]Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi:
Randomized Wait-Free Naming. ISAAC 1994: 83-91 - [c31]Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi:
Two heads are better than two tapes. STOC 1994: 668-675 - [e1]Gerard Tel, Paul M. B. Vitányi:
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 [contents] - 1993
- [b2]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 - [c30]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 - 1992
- [j30]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) - [j29]Ming Li, Paul M. B. Vitányi:
Optimality of Wait-Free Atomic Multiwriter Variables. Inf. Process. Lett. 43(2): 107-112 (1992) - [j28]Ming Li, Paul M. B. Vitányi:
Inductive Reasoning and Kolmogorov Complexity. J. Comput. Syst. Sci. 44(2): 343-384 (1992) - [j27]Evangelos Kranakis, Paul M. B. Vitányi:
A Note on Weighted Distributed Match-Making. Math. Syst. Theory 25(2): 123-140 (1992) - [j26]Ming Li, Luc Longpré, Paul M. B. Vitányi:
The Power of the Queue. SIAM J. Comput. 21(4): 697-712 (1992) - [c29]Ming Li, Paul M. B. Vitányi:
Inductive reasoning. Language Computations 1992: 127-148 - [c28]Ming Li, Paul M. B. Vitányi:
Philosophical Issues in Kolmogorov Complexity. ICALP 1992: 1-15 - [c27]Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitányi:
Wait-free Test-and-Set (Extended Abstract). WDAG 1992: 85-94 - 1991
- [b1]Ming Li, Paul M. B. Vitányi:
An introduction to Kolmogorov - complexity and its applications ; part 1: theory. CWI 1991, pp. 1-340 - [j25]Ming Li, Paul M. B. Vitányi:
Learning Simple Concept Under Simple Distributions. SIAM J. Comput. 20(5): 911-935 (1991) - [c26]Ming Li, Paul M. B. Vitányi:
Combinatorics and Kolmogorov Complexity. SCT 1991: 154-163 - 1990
- [p1]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
1980 – 1989
- 1989
- [c25]Ming Li, Paul M. B. Vitányi:
Inductive Reasoning and Komogorov Complexity. SCT 1989: 165-185 - [c24]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 - [c23]Ming Li, Paul M. B. Vitányi:
How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version). ICALP 1989: 488-505 - [c22]Ming Li, Paul M. B. Vitányi:
A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version). ICALP 1989: 506-520 - 1988
- [j24]Sape J. Mullender, Paul M. B. Vitányi:
Distributed Match-Making. Algorithmica 3: 367-391 (1988) - [j23]Ming Li, Paul M. B. Vitányi:
Tape versus Queue and Stacks: The Lower Bounds. Inf. Comput. 78(1): 56-85 (1988) - [j22]Joel I. Seiferas, Paul M. B. Vitányi:
Counting is easy. J. ACM 35(4): 985-1000 (1988) - [j21]Paul M. B. Vitányi:
Locality, Communication, and Interconnect Length in Multicomputers. SIAM J. Comput. 17(4): 659-672 (1988) - [c21]Evangelos Kranakis, Paul M. B. Vitányi:
Weighted Distributed Match-Making. AWOC 1988: 361-368 - [c20]Ming Li, Paul M. B. Vitányi:
Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87. SCT 1988: 80-101 - [c19]Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi:
A Proof Technique for Register Automicity. FSTTCS 1988: 286-303 - 1987
- [c18]Paul M. B. Vitányi, Baruch Awerbuch:
Errata to "Atomic Shared Register Access by Asynchronous Hardware". FOCS 1987: 487 - [c17]Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi:
Atomic Multireader Register. WDAG 1987: 278-296 - 1986
- [j20]Sape J. Mullender, Paul M. B. Vitányi:
Distributed Match-Making for Processes in Computer Networks (Preliminary Version). ACM SIGOPS Oper. Syst. Rev. 20(2): 54-64 (1986) - [c16]Paul M. B. Vitányi:
Nonsequentail Computation and Laws of Nature. Aegean Workshop on Computing 1986: 108-120 - [c15]Ming Li, Luc Longpré, Paul M. B. Vitányi:
The Power of the Queue. SCT 1986: 218-233 - [c14]Paul M. B. Vitányi, Baruch Awerbuch:
Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract). FOCS 1986: 233-243 - 1985
- [j19]Paul M. B. Vitányi:
Logarithmic signal propagation delay and the efficiency of VLSI circuits. Bull. EATCS 25: 37-39 (1985) - [j18]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) - [j17]Paul M. B. Vitányi:
An n1.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) - [j16]Paul M. B. Vitányi:
An Optimal Simulation of Counter Machines. SIAM J. Comput. 14(1): 1-33 (1985) - [j15]Paul M. B. Vitányi:
An Optimal Simulation of Counter Machines: The ACM Case. SIAM J. Comput. 14(1): 34-40 (1985) - [j14]Paul M. B. Vitányi, Lambert G. L. T. Meertens:
Big omega versus the wild functions. SIGACT News 16(4): 56-59 (1985) - [c13]Paul M. B. Vitányi:
Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary Version). FOCS 1985: 197-207 - [c12]Sape J. Mullender, Paul M. B. Vitányi:
Distributed Match-Making for Processes in Computer Networks (Preliminary Version). PODC 1985: 261-271 - 1984
- [j13]Paul M. B. Vitányi, Lambert G. L. T. Meertens:
Big omega versus the wild functions. Bull. EATCS 22: 14-19 (1984) - [j12]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) - [j11]Paul M. B. Vitányi:
On Two-Tape Real-Time Computation and Queues. J. Comput. Syst. Sci. 29(3): 303-311 (1984) - [j10]Paul M. B. Vitányi:
On the Simulation of Many Storage Heads by One. Theor. Comput. Sci. 34: 157-168 (1984) - [c11]Paul M. B. Vitányi:
The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version). ICALP 1984: 486-489 - [c10]Paul M. B. Vitányi:
Distributed Elections in an Archimedean Ring of Processors (Preliminary Version). STOC 1984: 542-547 - 1983
- [c9]Paul M. B. Vitányi:
On the Simulation of Many Storage Heads by a Single One (Extended Abstract). ICALP 1983: 687-694 - 1982
- [j9]Paul M. B. Vitányi:
On Efficient Simulations of Multicounter Machines. Inf. Control. 55(1-3): 20-39 (1982) - [c8]Paul M. B. Vitányi:
Efficient Simulations of Multicounter Machines. ICALP 1982: 546-560 - [c7]Paul M. B. Vitányi:
Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines. STOC 1982: 27-36 - 1981
- [j8]Paul M. B. Vitányi:
How well can a graph be n-colored? Discret. Math. 34(1): 69-80 (1981) - 1980
- [j7]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) - [c6]Paul M. B. Vitányi:
On the Power of Real-Time Machines Under Varying Specifications (Extended Abstract). ICALP 1980: 658-671 - [c5]Paul M. B. Vitányi:
Relativized Obliviousness. MFCS 1980: 665-672
1970 – 1979
- 1978
- [j6]Paul M. B. Vitányi, Adrian Walker:
Stable String Languages of Lindenmayer Systems. Inf. Control. 37(2): 134-149 (1978) - [j5]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) - [j4]Paul M. B. Vitányi, Walter J. Savitch:
On Inverse Deterministic Pushdown Transductions. J. Comput. Syst. Sci. 16(3): 423-444 (1978) - 1977
- [j3]Paul M. B. Vitányi:
Context Sensitive Table Lindenmayer Languages and a Relation to the LBA Problem. Inf. Control. 33(3): 217-226 (1977) - [c4]Walter J. Savitch, Paul M. B. Vitányi:
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps. ICALP 1977: 453-464 - 1976
- [j2]Paul M. B. Vitányi:
On a problem in the collective behavior of automata. Discret. Math. 14(1): 99-101 (1976) - [j1]Paul M. B. Vitányi:
Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms. Theor. Comput. Sci. 2(1): 49-71 (1976) - 1975
- [c3]Paul M. B. Vitányi:
Digraphs Associated with DOL Systems. Automata, Languages, Development 1975: 335-346 - 1974
- [c2]Paul M. B. Vitányi:
On the Size of D0L Languages. L Systems 1974: 78-92 - [c1]Paul M. B. Vitányi:
Growth of Strings in Context Dependent Lindenmayer Systems. L Systems 1974: 104-126
Coauthor Index
[b5] [i58] [b4] [i51] [j66] [j59] [j57] [c62] [j53] [c61] [i25] [i22] [i20] [j48] [j47] [j46] [j45] [j43] [c51] [i12] [j42] [j39] [c49] [c48] [c47] [c46] [i11] [i9] [i7] [i5] [j37] [c45] [i4] [i3] [b3] [c43] [c41] [c40] [c39] [i2] [i1] [j34] [c37] [j33] [c34] [p2] [j32] [j31] [b2] [c30] [j30] [j29] [j28] [j26] [c29] [c28] [b1] [j25] [c26] [p1] [c25] [c24] [c23] [c22] [j23] [c20] [c15]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
