Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Paul M. B. Vitányi
2010 – today
- 2013
[j76]Paul M. B. Vitányi: Conditional Kolmogorov complexity and universal probability. Theor. Comput. Sci. 501: 93-100 (2013)
[i67]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)
[i66]Luis Filipe Coelho Antunes, Andre Souto, A. Teixeira, Paul M. B. Vitányi: On the logical depth function. CoRR abs/1301.4451 (2013)
[i65]Andrew R. Cohen, Paul M. B. Vitányi: Normalized Google Distance of Multisets with Applications. CoRR abs/1308.3177 (2013)- 2012
[j75]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)
[i64]
[i63]Paul M. B. Vitányi: Turing Machines and Understanding Computational Complexity. CoRR abs/1201.1223 (2012)
[i62]Paul M. B. Vitányi: Conditional Kolmogorov Complexity and Universal Probability. CoRR abs/1206.0983 (2012)
[i61]Paul M. B. Vitányi, Nick Chater: Identification of Probabilities of Languages. CoRR abs/1208.5003 (2012)
[i60]Andrew R. Cohen, Paul M. B. Vitányi: Normalized Compression Distance of Multiples. CoRR abs/1212.5711 (2012)- 2011
[j74]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)
[j73]Rudi Cilibrasi, Paul M. B. Vitányi: A Fast Quartet tree heuristic for hierarchical clustering. Pattern Recognition 44(3): 662-677 (2011)
[j72]Paul M. B. Vitányi: Information Distance in Multiples. IEEE Transactions on Information Theory 57(4): 2451-2456 (2011)
[c69]
[i59]
[i58]- 2010
[j71]Paul M. B. Vitányi: Ray Solomonoff, Founding Father of Algorithmic Information Theory. Algorithms 3(3): 260-264 (2010)
[j70]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)
[i57]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)
[i56]Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi: Normalized Information Distance is Not Semicomputable. CoRR abs/1006.3275 (2010)
[i55]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
[j69]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)
[j68]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)
[j67]
[j66]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)
[i54]
[i53]Rudi Cilibrasi, Paul M. B. Vitányi: Normalized Web Distance and Word Similarity. CoRR abs/0905.4039 (2009)
[i52]Paul M. B. Vitányi: Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey). CoRR abs/0905.4452 (2009)
[i51]Paul M. B. Vitányi: Distributed elections in an Archimedean ring of processors. CoRR abs/0906.0731 (2009)
[i50]Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi: Nonapproximablity of the Normalized Information Distance. CoRR abs/0910.4353 (2009)- 2008
[r1]
[i49]Luis Antunes, Armando Matos, Andre Souto, Paul M. B. Vitányi: Depth as Randomness Deficiency. CoRR abs/0809.2546 (2008)
[i48]Paul M. B. Vitányi, Frank J. Balbach, Rudi Cilibrasi, Ming Li: Normalized Information Distance. CoRR abs/0809.2553 (2008)
[i47]
[i46]Edgar G. Daylight, Wouter M. Koolen, Paul M. B. Vitányi: On Time-Bounded Incompressibility of Compressible Strings. CoRR abs/0809.2965 (2008)- 2007
[j65]Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi: Individual communication complexity. J. Comput. Syst. Sci. 73(6): 973-985 (2007)
[j64]
[j63]Ming Li, Paul M. B. Vitányi: Applications of algorithmic information theory. Scholarpedia 2(5): 2658 (2007)
[j62]Marcus Hutter, Shane Legg, Paul M. B. Vitányi: Algorithmic probability. Scholarpedia 2(8): 2572 (2007)
[j61]Rudi Cilibrasi, Paul M. B. Vitányi: The Google Similarity Distance. IEEE Trans. Knowl. Data Eng. 19(3): 370-383 (2007)- 2006
[j60]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)
[j59]Paul M. B. Vitányi: Meaningful Information. IEEE Transactions on Information Theory 52(10): 4617-4626 (2006)
[c68]Cristina Costa-Santos, João Bernardes, Paul M. B. Vitányi, Luis Antunes: Clustering Fetal Heart Rate Tracings by Compression. CBMS 2006: 685-690
[c67]Rudi Cilibrasi, Paul M. B. Vitányi: A New Quartet Tree Heuristic for Hierarchical Clustering. Theory of Evolutionary Algorithms 2006
[c66]Rudi Cilibrasi, Paul M. B. Vitányi: Automatic Meaning Discovery Using Google. Kolmogorov Complexity and Applications 2006
[c65]Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi: 06051 Abstracts Collection -- Kolmogorov Complexity and Applications. Kolmogorov Complexity and Applications 2006
[c64]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
[c63]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 (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
[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]
[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]
[i39]
[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
[j58]Rudi Cilibrasi, Paul M. B. Vitányi: Clustering by compression. IEEE Transactions on Information Theory 51(4): 1523-1545 (2005)
[c62]Paul M. B. Vitányi: Time, space, and energy in reversible computing. Conf. Computing Frontiers 2005: 435-444
[i37]
[i36]- 2004
[j57]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)
[j56]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)
[c61]Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi: Individual Communication Complexity: Extended Abstract. STACS 2004: 19-30
[c60]Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf: Algorithmic Clustering of Music. WEDELMUSIC 2004: 110-117
[i35]
[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
[j55]Ming Li, John Tromp, Paul M. B. Vitányi: Sharpening Occam's razor. Inf. Process. Lett. 85(5): 267-274 (2003)
[j54]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)
[c59]
[i32]Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi: Individual Communication Complexity. CoRR cs.CC/0304012 (2003)
[i31]
[i30]Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf: Algorithmic Clustering of Music. CoRR cs.SD/0303025 (2003)
[i29]- 2002
[j53]John Tromp, Paul M. B. Vitányi: Randomized two-process wait-free test-and-set. Distributed Computing 15(3): 127-135 (2002)
[j52]Sibsankar Haldar, Paul M. B. Vitányi: Bounded concurrent timestamp systems using vector clocks. J. ACM 49(1): 101-126 (2002)
[j51]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)
[j50]Paul M. B. Vitányi: Correction to "Quantum Kolmogorov complexity based on classical descriptions". IEEE Transactions on Information Theory 48(4): 1000 (2002)
[j49]Péter Gács, John Tromp, Paul M. B. Vitányi: Correction to "Algorithmic statistics". IEEE Transactions on Information Theory 48(8): 2427 (2002)
[c58]
[c57]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
[c56]
[c55]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
[c54]
[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]
[i25]- 2001
[j48]Péter Gács, John Tromp, Paul M. B. Vitányi: Algorithmic statistics. IEEE Transactions on Information Theory 47(6): 2443-2463 (2001)
[j47]Paul M. B. Vitányi: Quantum Kolmogorov complexity based on classical descriptions. IEEE Transactions on Information Theory 47(6): 2464-2479 (2001)
[c53]
[c52]Harry Buhrman, John Tromp, Paul M. B. Vitányi: Time and Space Bounds for Reversible Simulation. ICALP 2001: 1017-1027
[c51]Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe: On a Generalized Ruin Problem. RANDOM-APPROX 2001: 181-191
[i24]
[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]
[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]
[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
[j46]Qiong Gao, Ming Li, Paul M. B. Vitányi: Applying MDL to learn best model granularity. Artif. Intell. 121(1-2): 1-29 (2000)
[j45]
[j44]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)
[j43]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)
[j42]Paul M. B. Vitányi: A discipline of evolutionary programming. Theor. Comput. Sci. 241(1-2): 3-23 (2000)
[j41]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)
[c50]
[c49]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
[c48]
[c47]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]
[i12]Qiong Gao, Ming Li, Paul M. B. Vitányi: Applying MDL to Learning Best Model Granularity. CoRR physics/0005062 (2000)
1990 – 1999
- 1999
[j40]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, 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)
[j38]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)
[j37]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)
[c46]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
[c45]Tao Jiang, Ming Li, Paul M. B. Vitányi: The Expected Size of Heilbronn's Triangles. IEEE Conference on Computational Complexity 1999: 105-113
[c44]Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi: New Applications of the Incompressibility Method. ICALP 1999: 220-229
[c43]
[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]
[i5]Tao Jiang, Ming Li, Paul M. B. Vitányi: The Average-Case Area of Heilbronn-Type Triangles. CoRR math.CO/9902043 (1999)- 1998
[j36]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)
[j35]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)
[c42]
[c41]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 (2. ed.). Graduate texts in computer science, Springer 1997, ISBN 978-0-387-94868-3, pp. I-XXI, 1-637
[j34]Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Two heads are better than two tapes. J. ACM 44(2): 237-256 (1997)
[j33]Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Erratum: ``Two heads are better that two tapes''. J. ACM 44(4): 632 (1997)
[c40]Ming Li, Paul M. B. Vitányi: Average-Case Analysis Using Kolmogorov Complexity. Advances in Algorithms, Languages, and Complexity 1997: 157-169
[c39]
[c38]
[c37]
[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
[j32]Ming Li, John Tromp, Paul M. B. Vitányi: How to Share Concurrent Wait-Free Variables. J. ACM 43(4): 723-746 (1996)
[c36]Paul M. B. Vitányi: Genetic Fitness Optimization Using Rapidly Mixing Markov Chains. ALT 1996: 67-82
[c35]Ming Li, Paul M. B. Vitányi: Reversible Simulation of Irreversible Computation. IEEE Conference on Computational Complexity 1996: 301-306
[c34]- 1995
[j31]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)
[c33]
[c32]
[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 (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- 1994
[j30]Ming Li, Paul M. B. Vitányi: Kolmogorov Complexity Arguments in Combinatorics. J. Comb. Theory, Ser. A 66(2): 226-236 (1994)
[j29]Ming Li, Paul M. B. Vitányi: Statistical Properties of Finite Sequences with High Kolmogorov Complexity. Mathematical Systems Theory 27(4): 365-376 (1994)
[c31]Guido te Brake, Joost N. Kok, Paul M. B. Vitányi: Model selection for neural networks: comparing MDL and NIC. ESANN 1994
[c30]Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi: Randomized Wait-Free Naming. ISAAC 1994: 83-91
[c29]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 (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- 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
[c28]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
[j28]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)
[j27]Ming Li, Paul M. B. Vitányi: Optimality of Wait-Free Atomic Multiwriter Variables. Inf. Process. Lett. 43(2): 107-112 (1992)
[j26]Ming Li, Paul M. B. Vitányi: Inductive Reasoning and Kolmogorov Complexity. J. Comput. Syst. Sci. 44(2): 343-384 (1992)
[j25]Evangelos Kranakis, Paul M. B. Vitányi: A Note on Weighted Distributed Match-Making. Mathematical Systems Theory 25(2): 123-140 (1992)
[j24]Ming Li, Luc Longpré, Paul M. B. Vitányi: The Power of the Queue. SIAM J. Comput. 21(4): 697-712 (1992)
[c27]
[c26]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
[j23]Ming Li, Paul M. B. Vitányi: Learning Simple Concept Under Simple Distributions. SIAM J. Comput. 20(5): 911-935 (1991)
[c25]Ming Li, Paul M. B. Vitányi: Combinatorics and Kolmogorov Complexity. Structure in Complexity Theory Conference 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
[c24]Ming Li, Paul M. B. Vitányi: Inductive Reasoning and Komogorov Complexity. Structure in Complexity Theory Conference 1989: 165-185
[c23]
[c22]Ming Li, Paul M. B. Vitányi: How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version). ICALP 1989: 488-505
[c21]Ming Li, Paul M. B. Vitányi: A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version). ICALP 1989: 506-520- 1988
[j22]
[j21]Ming Li, Paul M. B. Vitányi: Tape versus Queue and Stacks: The Lower Bounds. Inf. Comput. 78(1): 56-85 (1988)
[j20]
[j19]Paul M. B. Vitányi: Locality, Communication, and Interconnect Length in Multicomputers. SIAM J. Comput. 17(4): 659-672 (1988)
[c20]
[c19]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
[c18]Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi: A Proof Technique for Register Automicity. FSTTCS 1988: 286-303- 1987
[c17]Paul M. B. Vitányi, Baruch Awerbuch: Errata to ``Atomic Shared Register Access by Asynchronous Hardware''. FOCS 1987: 487
[c16]Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi: Atomic Multireader Register. WDAG 1987: 278-296- 1986
[j18]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)
[c15]Paul M. B. Vitányi: Nonsequentail Computation and Laws of Nature. Aegean Workshop on Computing 1986: 108-120
[c14]Ming Li, Luc Longpré, Paul M. B. Vitányi: The Power of the Queue. Structure in Complexity Theory Conference 1986: 218-233
[c13]Paul M. B. Vitányi, Baruch Awerbuch: Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract). FOCS 1986: 233-243- 1985
[j17]Paul M. B. Vitányi: Logarithmic signal propagation delay and the efficiency of VLSI circuits. Bulletin of the EATCS 25: 37-39 (1985)
[j16]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)
[j15]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)
[j14]
[j13]Paul M. B. Vitányi: An Optimal Simulation of Counter Machines: The ACM Case. SIAM J. Comput. 14(1): 34-40 (1985)
[c12]Paul M. B. Vitányi: Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary Version). FOCS 1985: 197-207
[c11]Sape J. Mullender, Paul M. B. Vitányi: Distributed Match-Making for Processes in Computer Networks (Preliminary Version). PODC 1985: 261-271- 1984
[j12]Paul M. B. Vitányi, Lambert G. L. T. Meertens: Big omega versus the wild functions. Bulletin of the EATCS 22: 14-19 (1984)
[j11]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)
[j10]Paul M. B. Vitányi: On Two-Tape Real-Time Computation and Queues. J. Comput. Syst. Sci. 29(3): 303-311 (1984)
[j9]Paul M. B. Vitányi: On the Simulation of Many Storage Heads by One. Theor. Comput. Sci. 34: 157-168 (1984)
[c10]Paul M. B. Vitányi: The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version). ICALP 1984: 486-489
[c9]Paul M. B. Vitányi: Distributed Elections in an Archimedean Ring of Processors (Preliminary Version). STOC 1984: 542-547- 1983
[c8]Paul M. B. Vitányi: On the Simulation of Many Storage Heads by a Single One (Extended Abstract). ICALP 1983: 687-694- 1982
[j8]Paul M. B. Vitányi: On Efficient Simulations of Multicounter Machines. Information and Control 55(1-3): 20-39 (1982)
[c7]
[c6]Paul M. B. Vitányi: Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines. STOC 1982: 27-36- 1981
[j7]- 1980
[j6]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)
[c5]Paul M. B. Vitányi: On the Power of Real-Time Machines Under Varying Specifications (Extended Abstract). ICALP 1980: 658-671
[c4]
1970 – 1979
- 1978
[j5]Paul M. B. Vitányi, Adrian Walker: Stable String Languages of Lindenmayer Systems. Information and Control 37(2): 134-149 (1978)
[j4]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)
[j3]Paul M. B. Vitányi, Walter J. Savitch: On Inverse Deterministic Pushdown Transductions. J. Comput. Syst. Sci. 16(3): 423-444 (1978)- 1977
[j2]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)
[c3]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
[j1]Paul M. B. Vitányi: Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms. Theor. Comput. Sci. 2(1): 49-71 (1976)- 1974
[c2]
[c1]Paul M. B. Vitányi: Growth of Strings in Context Dependent Lindenmayer Systems. L Systems 1974: 104-126
Coauthor Index
[i55] [i48] [j63] [j57] [j55] [c59] [j51] [c58] [i25] [i22] [i20] [j46] [j45] [j44] [j43] [j41] [c48] [i12] [j40] [j37] [c46] [c45] [c44] [c43] [i11] [i9] [i7] [i5] [j35] [c42] [i4] [i3] [b3] [c40] [c38] [c37] [i2] [i1] [j32] [c35] [j31] [c32] [p2] [j30] [j29] [b2] [c28] [j28] [j27] [j26] [j24] [c27] [b1] [j23] [c25] [p1] [c24] [c23] [c22] [c21] [j21] [c19] [c14]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:04 CEST by the dblp team



