Остановите войну!
for scientists:
default search action
Paul M. B. Vitányi
- > Home > Persons > Paul M. B. Vitányi
Publications
- 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 - 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) - 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 - [i51]Paul M. B. Vitányi, Frank J. Balbach, Rudi Cilibrasi, Ming Li:
Normalized Information Distance. CoRR abs/0809.2553 (2008) - 2007
- [j66]Ming Li, Paul M. B. Vitányi:
Applications of algorithmic information theory. Scholarpedia 2(5): 2658 (2007) - 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) - 2003
- [j57]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's razor. Inf. Process. Lett. 85(5): 267-274 (2003) - [c62]Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi:
The similarity metric. SODA 2003: 863-872 - 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) - [c61]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's Razor. COCOON 2002: 411-419 - [i25]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's Razor. CoRR cs.LG/0201005 (2002) - 2001
- [i22]Ming Li, Paul M. B. Vitányi:
A New Approach to Formal Language Theory by Kolmogorov Complexity. CoRR cs.CC/0110040 (2001) - [i20]Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi:
The similarity metric. CoRR cs.CC/0111054 (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) - [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) - [c51]Tao Jiang, Ming Li, Paul M. B. Vitányi:
The Incompressibility Method. SOFSEM 2000: 36-53 - [i12]Qiong Gao, Ming Li, Paul M. B. Vitányi:
Applying MDL to Learning Best Model Granularity. CoRR physics/0005062 (2000) - 1999
- [j42]Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method. Comput. J. 42(4): 287-293 (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) - [i9]Tao Jiang, Ming Li, Paul M. B. Vitányi:
Average-Case Complexity of Shellsort. CoRR cs.DS/9901010 (1999) - [i7]Paul M. B. Vitányi, Ming Li:
Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity. CoRR cs.LG/9901014 (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
- [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 - [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 - [c43]Ming Li, Paul M. B. Vitányi:
Average-Case Analysis Using Kolmogorov Complexity. Advances in Algorithms, Languages, and Complexity 1997: 157-169 - [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) - [c37]Ming Li, Paul M. B. Vitányi:
Reversible Simulation of Irreversible Computation. CCC 1996: 301-306 - 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) - [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 - 1994
- [j32]Ming Li, Paul M. B. Vitányi:
Kolmogorov Complexity Arguments in Combinatorics. J. Comb. Theory, Ser. 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) - 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) - [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 - 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 - 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
- [j23]Ming Li, Paul M. B. Vitányi:
Tape versus Queue and Stacks: The Lower Bounds. Inf. Comput. 78(1): 56-85 (1988) - [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 - 1986
- [c15]Ming Li, Luc Longpré, Paul M. B. Vitányi:
The Power of the Queue. SCT 1986: 218-233
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-05-02 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint