Stop the war!Остановите войну!
for scientists:
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]