The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Paul M. B. Vitányi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul M. B. Vitányi
    On the Size of D0L Languages. [Citation Graph (0, 0)][DBLP]
    L Systems, 1974, pp:78-92 [Conf]
  2. Paul M. B. Vitányi
    Growth of Strings in Context Dependent Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    L Systems, 1974, pp:104-126 [Conf]
  3. Péter Gács, John Tromp, Paul M. B. Vitányi
    Towards an Algorithmic Statistics. [Citation Graph (0, 0)][DBLP]
    ALT, 2000, pp:41-55 [Conf]
  4. Paul M. B. Vitányi
    Genetic Fitness Optimization Using Rapidly Mixing Markov Chains. [Citation Graph (0, 0)][DBLP]
    ALT, 1996, pp:67-82 [Conf]
  5. Evangelos Kranakis, Paul M. B. Vitányi
    Weighted Distributed Match-Making. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:361-368 [Conf]
  6. Paul M. B. Vitányi
    Nonsequentail Computation and Laws of Nature. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:108-120 [Conf]
  7. Ming Li, Paul M. B. Vitányi
    Average-Case Analysis Using Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:157-169 [Conf]
  8. Tao Jiang, Ming Li, Paul M. B. Vitányi
    Some Examples of Average-case Analysis by the Imcompressibility Method. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:250-261 [Conf]
  9. C. Costa Santos, J. Bernardes, Paul M. B. Vitányi, L. Antunes
    Clustering Fetal Heart Rate Tracings by Compression. [Citation Graph (0, 0)][DBLP]
    CBMS, 2006, pp:685-690 [Conf]
  10. Paul M. B. Vitányi
    Time, space, and energy in reversible computing. [Citation Graph (0, 0)][DBLP]
    Conf. Computing Frontiers, 2005, pp:435-444 [Conf]
  11. Ming Li, Paul M. B. Vitányi
    Inductive Reasoning and Komogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:165-185 [Conf]
  12. Ming Li, Paul M. B. Vitányi
    Combinatorics and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:154-163 [Conf]
  13. Ming Li, Paul M. B. Vitányi
    Reversible Simulation of Irreversible Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:301-306 [Conf]
  14. Tao Jiang, Ming Li, Paul M. B. Vitányi
    The Expected Size of Heilbronn's Triangles. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:105-113 [Conf]
  15. Ming Li, Luc Longpré, Paul M. B. Vitányi
    The Power of the Queue. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:218-233 [Conf]
  16. Paul M. B. Vitányi
    Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:263-270 [Conf]
  17. Ming Li, John Tromp, Paul M. B. Vitányi
    Sharpening Occam's Razor. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:411-419 [Conf]
  18. Paul M. B. Vitányi
    Mutual Search (abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:514- [Conf]
  19. Paul M. B. Vitányi
    The Quantum Computing Challenge. [Citation Graph (0, 0)][DBLP]
    Informatics, 2001, pp:219-233 [Conf]
  20. Paul M. B. Vitányi, Ming Li
    On Prediction by Data Compression. [Citation Graph (0, 0)][DBLP]
    ECML, 1997, pp:14-30 [Conf]
  21. Ming Li, Paul M. B. Vitányi
    Average-Case Analysis via Incompressibility. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:38-50 [Conf]
  22. 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) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:34-39 [Conf]
  23. Nikolai K. Vereshchagin, Paul M. B. Vitányi
    Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:751-760 [Conf]
  24. Paul M. B. Vitányi
    Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:197-207 [Conf]
  25. Paul M. B. Vitányi, Baruch Awerbuch
    Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:233-243 [Conf]
  26. Paul M. B. Vitányi, Baruch Awerbuch
    Errata to ``Atomic Shared Register Access by Asynchronous Hardware'' [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:487- [Conf]
  27. Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi
    A Proof Technique for Register Automicity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:286-303 [Conf]
  28. Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi
    New Applications of the Incompressibility Method. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:220-229 [Conf]
  29. Harry Buhrman, John Tromp, Paul M. B. Vitányi
    Time and Space Bounds for Reversible Simulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:1017-1027 [Conf]
  30. Ming Li, Paul M. B. Vitányi
    How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:488-505 [Conf]
  31. Ming Li, Paul M. B. Vitányi
    Philosophical Issues in Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:1-15 [Conf]
  32. Tao Jiang, Ming Li, Paul M. B. Vitányi
    Average-Case Complexity of Shellsort. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:453-462 [Conf]
  33. Ming Li, Paul M. B. Vitányi
    A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:506-520 [Conf]
  34. Walter J. Savitch, Paul M. B. Vitányi
    Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:453-464 [Conf]
  35. Paul M. B. Vitányi
    Efficient Simulations of Multicounter Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:546-560 [Conf]
  36. Paul M. B. Vitányi
    On the Power of Real-Time Machines Under Varying Specifications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:658-671 [Conf]
  37. Paul M. B. Vitányi
    On the Simulation of Many Storage Heads by a Single One (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:687-694 [Conf]
  38. Paul M. B. Vitányi
    The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:486-489 [Conf]
  39. Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi
    Randomized Wait-Free Naming. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:83-91 [Conf]
  40. Paul M. B. Vitányi
    Meaningful Information. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:588-599 [Conf]
  41. Paul M. B. Vitányi
    Relativized Obliviousness. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:665-672 [Conf]
  42. Paul M. B. Vitányi
    Physics and the New Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:106-128 [Conf]
  43. Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi
    About the Lifespan of Peer to Peer Networks, . [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:290-304 [Conf]
  44. Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi
    Optimal Routing Tables. [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:134-142 [Conf]
  45. Sape J. Mullender, Paul M. B. Vitányi
    Distributed Match-Making for Processes in Computer Networks (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:261-271 [Conf]
  46. Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe
    On a Generalized Ruin Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:181-191 [Conf]
  47. John Tromp, Paul M. B. Vitányi
    A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:275-291 [Conf]
  48. Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi
    Mutual Search (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:481-489 [Conf]
  49. Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi
    The similarity metric. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:863-872 [Conf]
  50. Tao Jiang, Ming Li, Paul M. B. Vitányi
    The Incompressibility Method. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:36-53 [Conf]
  51. Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
    Individual Communication Complexity: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:19-30 [Conf]
  52. Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
    Thermodynamics of computation and information distance. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:21-30 [Conf]
  53. Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
    Two heads are better than two tapes. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:668-675 [Conf]
  54. Paul M. B. Vitányi
    Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:27-36 [Conf]
  55. Paul M. B. Vitányi
    Distributed Elections in an Archimedean Ring of Processors (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:542-547 [Conf]
  56. Rudi Cilibrasi, Paul M. B. Vitányi
    Similarity of Objects and the Meaning of Words. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:21-45 [Conf]
  57. Paul M. B. Vitányi, Ming Li
    Algorithmic Arguments in Physics of Computation. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:315-333 [Conf]
  58. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
    On the Importance of Having an Identity or is Consensus Really Universal? [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:134-148 [Conf]
  59. Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitányi
    Wait-free Test-and-Set (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1992, pp:85-94 [Conf]
  60. Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi
    Atomic Multireader Register. [Citation Graph (0, 0)][DBLP]
    WDAG, 1987, pp:278-296 [Conf]
  61. Paul M. B. Vitányi
    Simple Wait-Free Multireader Registers. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:118-132 [Conf]
  62. Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
    Algorithmic Clustering of Music. [Citation Graph (0, 0)][DBLP]
    WEDELMUSIC, 2004, pp:110-117 [Conf]
  63. Qiong Gao, Ming Li, Paul M. B. Vitányi
    Applying MDL to learn best model granularity. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:121, n:1-2, pp:1-29 [Journal]
  64. Sape J. Mullender, Paul M. B. Vitányi
    Distributed Match-Making. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:367-391 [Journal]
  65. Tao Jiang, Ming Li, Paul M. B. Vitányi
    New Applications of the Incompressibility Method. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1999, v:42, n:4, pp:287-293 [Journal]
  66. Joel I. Seiferas, Paul M. B. Vitányi
    Counting is Easy [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  67. Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
    Two heads are better than two tapes [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  68. Ming Li, Paul M. B. Vitányi
    A New Approach to Formal Language Theory by Kolmogorov Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  69. Paul M. B. Vitányi
    Meaningful Information [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  70. Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi
    The similarity metric [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  71. Nikolai K. Vereshchagin, Paul M. B. Vitányi
    Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  72. Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
    Individual Communication Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  73. Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi
    New Applications of the Incompressibility Method: Part II [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  74. Tao Jiang, Ming Li, Paul M. B. Vitányi
    New Applications of the Incompressibility Method: Part I [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  75. Tao Jiang, Ming Li, Paul M. B. Vitányi
    Average-Case Complexity of Shellsort (Preliminary version) [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  76. Nick Chater, Paul M. B. Vitányi
    The Generalized Universal Law of Generalization [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  77. Rudi Cilibrasi, Paul M. B. Vitányi
    Clustering by compression [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  78. John Tromp, Paul M. B. Vitányi
    Randomized Two-Process Wait-Free Test-and-Set [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  79. Sibsankar Haldar, Paul M. B. Vitányi
    Bounded Concurrent Timestamp Systems Using Vector Clocks [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  80. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
    On the Importance of Having an Identity or, is Consensus really Universal? [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  81. Paul M. B. Vitányi
    Simple Wait-free Multireader Registers [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  82. Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi
    Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  83. Tao Jiang, Ming Li, Paul M. B. Vitányi
    Average-Case Complexity of Shellsort [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  84. Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi
    Mutual Search [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  85. Peter Grünwald, Paul M. B. Vitányi
    Shannon Information and Kolmogorov Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  86. Nikolai K. Vereshchagin, Paul M. B. Vitányi
    A Theory of Lossy Compression for Individual Data [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  87. Ming Li, John Tromp, Paul M. B. Vitányi
    Sharpening Occam's Razor [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  88. Paul M. B. Vitányi, Ming Li
    Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  89. Paul M. B. Vitányi
    A Discipline of Evolutionary Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  90. Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
    Algorithmic Clustering of Music [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  91. Tao Jiang, Ming Li, Paul M. B. Vitányi
    The Average-Case Area of Heilbronn-Type Triangles [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  92. Péter Gács, John Tromp, Paul M. B. Vitányi
    Algorithmic Statistics [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  93. Paul M. B. Vitányi
    Randomness [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  94. Paul M. B. Vitányi
    Algorithmic Chaos [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  95. Qiong Gao, Ming Li, Paul M. B. Vitányi
    Applying MDL to Learning Best Model Granularity [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  96. Harry Buhrman, John Tromp, Paul M. B. Vitányi
    Time and Space Bounds for Reversible Simulation [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  97. Paul M. B. Vitányi
    Quantum Kolmogorov Complexity Based on Classical Descriptions [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  98. Ming Li, John Tromp, Paul M. B. Vitányi
    Reversible Simulation of Irreversible Computation by Pebble Games [Citation Graph (0, 0)][DBLP]
    CoRR, 1997, v:0, n:, pp:- [Journal]
  99. Ming Li, Paul M. B. Vitányi
    Reversibility and Adiabatic Computation: Trading Time and Space for Energy [Citation Graph (0, 0)][DBLP]
    CoRR, 1997, v:0, n:, pp:- [Journal]
  100. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
    On the importance of having an identity or, is consensus really universal?. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:167-176 [Journal]
  101. Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi
    Randomized Naming Using Wait-Free Shared Variables. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1998, v:11, n:3, pp:113-124 [Journal]
  102. John Tromp, Paul M. B. Vitányi
    Randomized two-process wait-free test-and-set. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:3, pp:127-135 [Journal]
  103. Paul M. B. Vitányi
    Logarithmic signal propagation delay and the efficiency of VLSI circuits. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:25, n:, pp:37-39 [Journal]
  104. Paul M. B. Vitányi, Lambert G. L. T. Meertens
    Big omega versus the wild functions. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:22, n:, pp:14-19 [Journal]
  105. Ming Li, Paul M. B. Vitányi
    Tape versus Queue and Stacks: The Lower Bounds [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:78, n:1, pp:56-85 [Journal]
  106. Paul M. B. Vitányi
    Context Sensitive Table Lindenmayer Languages and a Relation to the LBA Problem [Citation Graph (0, 0)][DBLP]
    Information and Control, 1977, v:33, n:3, pp:217-226 [Journal]
  107. Paul M. B. Vitányi
    On Efficient Simulations of Multicounter Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:55, n:1-3, pp:20-39 [Journal]
  108. Paul M. B. Vitányi, Adrian Walker
    Stable String Languages of Lindenmayer Systems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:37, n:2, pp:134-149 [Journal]
  109. Ming Li, John Tromp, Paul M. B. Vitányi
    Sharpening Occam's razor. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:5, pp:267-274 [Journal]
  110. Ming Li, Paul M. B. Vitányi
    Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:3, pp:145-149 [Journal]
  111. Ming Li, Paul M. B. Vitányi
    Optimality of Wait-Free Atomic Multiwriter Variables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:2, pp:107-112 [Journal]
  112. Walter J. Savitch, Paul M. B. Vitányi
    On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:31-35 [Journal]
  113. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:2, pp:87-91 [Journal]
  114. Paul M. B. Vitányi
    Achievable High Scores of epsilon-Moves and Running Times in DPDA Computations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:2, pp:83-86 [Journal]
  115. Paul M. B. Vitányi
    An n1.618 Lower Bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:3, pp:147-152 [Journal]
  116. Peter van Emde Boas, Paul M. B. Vitányi
    A note on the recursive enumerability of some classes of recursively enumerable languages. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1978, v:14, n:1, pp:89-91 [Journal]
  117. Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi
    Mutual Search. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:4, pp:517-536 [Journal]
  118. Sibsankar Haldar, Paul M. B. Vitányi
    Bounded concurrent timestamp systems using vector clocks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:1, pp:101-126 [Journal]
  119. Tao Jiang, Ming Li, Paul M. B. Vitányi
    A lower bound on the average-case complexity of shellsort. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:5, pp:905-911 [Journal]
  120. Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
    Two heads are better than two tapes. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:2, pp:237-256 [Journal]
  121. Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
    Erratum: ``Two heads are better that two tapes''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:4, pp:632- [Journal]
  122. Ming Li, John Tromp, Paul M. B. Vitányi
    How to Share Concurrent Wait-Free Variables. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:4, pp:723-746 [Journal]
  123. Joel I. Seiferas, Paul M. B. Vitányi
    Counting is easy. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:985-1000 [Journal]
  124. Ming Li, Paul M. B. Vitányi
    Inductive Reasoning and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:343-384 [Journal]
  125. Paul M. B. Vitányi
    On Two-Tape Real-Time Computation and Queues. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:29, n:3, pp:303-311 [Journal]
  126. Paul M. B. Vitányi, Walter J. Savitch
    On Inverse Deterministic Pushdown Transductions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:3, pp:423-444 [Journal]
  127. Tao Jiang, Ming Li, Paul M. B. Vitányi
    Average-Case Analysis of Algorithms Using Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Sci. Technol., 2000, v:15, n:5, pp:402-408 [Journal]
  128. Ming Li, Paul M. B. Vitányi
    Kolmogorov Complexity Arguments in Combinatorics. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:66, n:2, pp:226-236 [Journal]
  129. Peter Grünwald, Paul M. B. Vitányi
    Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2003, v:12, n:4, pp:497-529 [Journal]
  130. Evangelos Kranakis, Paul M. B. Vitányi
    A Note on Weighted Distributed Match-Making. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:2, pp:123-140 [Journal]
  131. Ming Li, Paul M. B. Vitányi
    Statistical Properties of Finite Sequences with High Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:4, pp:365-376 [Journal]
  132. Tao Jiang, Ming Li, Paul M. B. Vitányi
    The average-case area of Heilbronn-type triangles. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:2, pp:206-219 [Journal]
  133. Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi
    Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1414-1432 [Journal]
  134. Harry Buhrman, Ming Li, John Tromp, Paul M. B. Vitányi
    Kolmogorov Random Graphs and the Incompressibility Method. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:590-599 [Journal]
  135. Ming Li, Paul M. B. Vitányi
    Learning Simple Concept Under Simple Distributions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:5, pp:911-935 [Journal]
  136. Ming Li, Paul M. B. Vitányi
    A New Approach to Formal Language Theory by Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:398-410 [Journal]
  137. Ming Li, Luc Longpré, Paul M. B. Vitányi
    The Power of the Queue. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:4, pp:697-712 [Journal]
  138. Paul M. B. Vitányi
    An Optimal Simulation of Counter Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:1-33 [Journal]
  139. Paul M. B. Vitányi
    An Optimal Simulation of Counter Machines: The ACM Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:34-40 [Journal]
  140. Paul M. B. Vitányi
    Locality, Communication, and Interconnect Length in Multicomputers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:659-672 [Journal]
  141. Sape J. Mullender, Paul M. B. Vitányi
    Distributed Match-Making for Processes in Computer Networks (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Operating Systems Review, 1986, v:20, n:2, pp:54-64 [Journal]
  142. Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi
    New applications of the incompressibility method: Part II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:235, n:1, pp:59-70 [Journal]
  143. Paul M. B. Vitányi
    A discipline of evolutionary programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:241, n:1-2, pp:3-23 [Journal]
  144. Paul M. B. Vitányi
    Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:1, pp:49-71 [Journal]
  145. Paul M. B. Vitányi
    On the Simulation of Many Storage Heads by One. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:34, n:, pp:157-168 [Journal]
  146. Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
    Information Distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1407-1423 [Journal]
  147. Rudi Cilibrasi, Paul M. B. Vitányi
    Clustering by compression. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:4, pp:1523-1545 [Journal]
  148. Péter Gács, John Tromp, Paul M. B. Vitányi
    Algorithmic statistics. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2443-2463 [Journal]
  149. Péter Gács, John Tromp, Paul M. B. Vitányi
    Correction to "Algorithmic statistics". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2427- [Journal]
  150. Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi
    The similarity metric. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3250-3264 [Journal]
  151. Nikolai K. Vereshchagin, Paul M. B. Vitányi
    Kolmogorov's structure functions and model selection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3265-3290 [Journal]
  152. Paul M. B. Vitányi
    Quantum Kolmogorov complexity based on classical descriptions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2464-2479 [Journal]
  153. Paul M. B. Vitányi
    Correction to "Quantum Kolmogorov complexity based on classical descriptions". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:1000- [Journal]
  154. Paul M. B. Vitányi, Ming Li
    Minimum description length induction, Bayesianism, and Kolmogorov complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:446-464 [Journal]
  155. Paul M. B. Vitányi
    Meaningful Information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:10, pp:4617-4626 [Journal]
  156. Rudi Cilibrasi, Paul M. B. Vitányi
    The Google Similarity Distance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2007, v:19, n:3, pp:370-383 [Journal]
  157. Paul M. B. Vitányi
    Registers [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  158. Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes, Paul M. B. Vitányi
    About the Lifespan of Peer to Peer Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  159. Pieter W. Adriaans, Paul M. B. Vitányi
    The Power and Perils of MDL [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  160. Paul M. B. Vitányi, Zvi Lotker
    Tales of Huffman [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  161. C. Costa Santos, J. Bernardes, Paul M. B. Vitányi, L. Antunes
    Clustering fetal heart rate tracings by compression [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  162. Steven de Rooij, Paul M. B. Vitányi
    Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  163. Rudi Cilibrasi, Paul M. B. Vitányi
    Similarity of Objects and the Meaning of Words [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  164. Rudi Cilibrasi, Paul M. B. Vitányi
    A New Quartet Tree Heuristic for Hierarchical Clustering [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  165. Paul M. B. Vitányi
    Time, Space, and Energy in Reversible Computing [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  166. Paul M. B. Vitányi
    Universal Similarity [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  167. Rudi Cilibrasi, Paul M. B. Vitányi
    The Google Similarity Distance [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  168. Paul M. B. Vitányi
    How well can a graph be n-colored? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:1, pp:69-80 [Journal]
  169. Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
    Individual communication complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:6, pp:973-985 [Journal]

  170. Average-Case Analysis Using Kolgomorov Complexity (Abstract). [Citation Graph (, )][DBLP]


  171. A New Quartet Tree Heuristic for Hierarchical Clustering. [Citation Graph (, )][DBLP]


  172. 06051 Abstracts Collection -- Kolmogorov Complexity and Applications. [Citation Graph (, )][DBLP]


  173. Automatic Meaning Discovery Using Google. [Citation Graph (, )][DBLP]


  174. Depth as Randomness Deficiency [Citation Graph (, )][DBLP]


  175. Normalized Information Distance [Citation Graph (, )][DBLP]


  176. Algorithmic information theory [Citation Graph (, )][DBLP]


  177. On Time-Bounded Incompressibility of Compressible Strings [Citation Graph (, )][DBLP]


  178. Information Distance in Multiples [Citation Graph (, )][DBLP]


  179. Normalized Web Distance and Word Similarity [Citation Graph (, )][DBLP]


  180. Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) [Citation Graph (, )][DBLP]


  181. Distributed elections in an Archimedean ring of processors [Citation Graph (, )][DBLP]


  182. Nonapproximablity of the Normalized Information Distance [Citation Graph (, )][DBLP]


  183. The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis [Citation Graph (, )][DBLP]


  184. Normalized Information Distance is Not Semicomputable [Citation Graph (, )][DBLP]


  185. Information Distance [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002