| 2009 |
|---|
| 187 | EE | 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) |
| 2008 |
|---|
| 186 | EE | Paul M. B. Vitányi:
Registers.
Encyclopedia of Algorithms 2008 |
| 185 | EE | Luis Antunes,
Armando Matos,
Andre Souto,
Paul M. B. Vitányi:
Depth as Randomness Deficiency
CoRR abs/0809.2546: (2008) |
| 184 | EE | Paul M. B. Vitányi,
Frank J. Balbach,
Rudi Cilibrasi,
Ming Li:
Normalized Information Distance
CoRR abs/0809.2553: (2008) |
| 183 | EE | Peter D. Grünwald,
Paul M. B. Vitányi:
Algorithmic information theory
CoRR abs/0809.2754: (2008) |
| 182 | EE | Edgar G. Daylight,
Wouter M. Koolen,
Paul M. B. Vitányi:
On Time-Bounded Incompressibility of Compressible Strings
CoRR abs/0809.2965: (2008) |
| 2007 |
|---|
| 181 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi:
The Google Similarity Distance.
IEEE Trans. Knowl. Data Eng. 19(3): 370-383 (2007) |
| 180 | EE | Harry Buhrman,
Hartmut Klauck,
Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
Individual communication complexity.
J. Comput. Syst. Sci. 73(6): 973-985 (2007) |
| 179 | EE | Paul M. B. Vitányi:
Andrey Nikolaevich Kolmogorov.
Scholarpedia 2(2): 2798 (2007) |
| 178 | EE | Ming Li,
Paul M. B. Vitányi:
Applications of algorithmic information theory.
Scholarpedia 2(5): 2658 (2007) |
| 177 | EE | Marcus Hutter,
Shane Legg,
Paul M. B. Vitányi:
Algorithmic probability.
Scholarpedia 2(8): 2572 (2007) |
| 2006 |
|---|
| 176 | | Marcus Hutter,
Wolfgang Merkle,
Paul M. B. Vitányi:
Kolmogorov Complexity and Applications, 29.01. - 03.02.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 175 | EE | C. Costa Santos,
J. Bernardes,
Paul M. B. Vitányi,
Luis Antunes:
Clustering Fetal Heart Rate Tracings by Compression.
CBMS 2006: 685-690 |
| 174 | EE | Marcus Hutter,
Wolfgang Merkle,
Paul M. B. Vitányi:
06051 Abstracts Collection -- Kolmogorov Complexity and Applications.
Kolmogorov Complexity and Applications 2006 |
| 173 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi:
Automatic Meaning Discovery Using Google.
Kolmogorov Complexity and Applications 2006 |
| 172 | EE | 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 |
| 171 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi:
Similarity of Objects and the Meaning of Words.
TAMC 2006: 21-45 |
| 170 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi:
A New Quartet Tree Heuristic for Hierarchical Clustering.
Theory of Evolutionary Algorithms 2006 |
| 169 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi:
Similarity of Objects and the Meaning of Words
CoRR abs/cs/0602065: (2006) |
| 168 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi:
A New Quartet Tree Heuristic for Hierarchical Clustering
CoRR abs/cs/0606048: (2006) |
| 167 | EE | 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) |
| 166 | EE | Paul M. B. Vitányi:
Registers
CoRR abs/cs/0612025: (2006) |
| 165 | EE | 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) |
| 164 | EE | Pieter W. Adriaans,
Paul M. B. Vitányi:
The Power and Perils of MDL
CoRR abs/cs/0612095: (2006) |
| 163 | EE | Paul M. B. Vitányi,
Zvi Lotker:
Tales of Huffman
CoRR abs/cs/0612133: (2006) |
| 162 | EE | C. Costa Santos,
J. Bernardes,
Paul M. B. Vitányi,
Luis Antunes:
Clustering fetal heart rate tracings by compression
CoRR abs/q-bio/0612013: (2006) |
| 161 | EE | 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) |
| 160 | EE | Paul M. B. Vitányi:
Meaningful Information.
IEEE Transactions on Information Theory 52(10): 4617-4626 (2006) |
| 2005 |
|---|
| 159 | EE | Paul M. B. Vitányi:
Time, space, and energy in reversible computing.
Conf. Computing Frontiers 2005: 435-444 |
| 158 | EE | Paul M. B. Vitányi:
Time, Space, and Energy in Reversible Computing
CoRR abs/cs/0504088: (2005) |
| 157 | EE | Paul M. B. Vitányi:
Universal Similarity
CoRR abs/cs/0504089: (2005) |
| 156 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi:
Clustering by compression.
IEEE Transactions on Information Theory 51(4): 1523-1545 (2005) |
| 2004 |
|---|
| 155 | EE | Harry Buhrman,
Hartmut Klauck,
Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
Individual Communication Complexity: Extended Abstract.
STACS 2004: 19-30 |
| 154 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi,
Ronald de Wolf:
Algorithmic Clustering of Music.
WEDELMUSIC 2004: 110-117 |
| 153 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi:
The Google Similarity Distance
CoRR abs/cs/0412098: (2004) |
| 152 | EE | Peter Grünwald,
Paul M. B. Vitányi:
Shannon Information and Kolmogorov Complexity
CoRR cs.IT/0410002: (2004) |
| 151 | EE | Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
A Theory of Lossy Compression for Individual Data
CoRR cs.IT/0411014: (2004) |
| 150 | EE | 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) |
| 149 | EE | 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) |
| 2003 |
|---|
| 148 | EE | Ming Li,
Xin Chen,
Xin Li,
Bin Ma,
Paul M. B. Vitányi:
The similarity metric.
SODA 2003: 863-872 |
| 147 | EE | Harry Buhrman,
Hartmut Klauck,
Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
Individual Communication Complexity
CoRR cs.CC/0304012: (2003) |
| 146 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi:
Clustering by compression
CoRR cs.CV/0312044: (2003) |
| 145 | EE | Rudi Cilibrasi,
Paul M. B. Vitányi,
Ronald de Wolf:
Algorithmic Clustering of Music
CoRR cs.SD/0303025: (2003) |
| 144 | EE | Paul M. B. Vitányi:
Algorithmic Chaos
CoRR nlin.CD/0303016: (2003) |
| 143 | EE | Ming Li,
John Tromp,
Paul M. B. Vitányi:
Sharpening Occam's razor.
Inf. Process. Lett. 85(5): 267-274 (2003) |
| 142 | EE | 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) |
| 2002 |
|---|
| 141 | EE | Ming Li,
John Tromp,
Paul M. B. Vitányi:
Sharpening Occam's Razor.
COCOON 2002: 411-419 |
| 140 | EE | Paul M. B. Vitányi:
Simple Wait-Free Multireader Registers.
DISC 2002: 118-132 |
| 139 | EE | 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 |
| 138 | EE | Paul M. B. Vitányi:
Meaningful Information.
ISAAC 2002: 588-599 |
| 137 | | 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 |
| 136 | EE | 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) |
| 135 | EE | 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) |
| 134 | EE | Paul M. B. Vitányi:
Simple Wait-free Multireader Registers
CoRR cs.DC/0202003: (2002) |
| 133 | EE | Ming Li,
John Tromp,
Paul M. B. Vitányi:
Sharpening Occam's Razor
CoRR cs.LG/0201005: (2002) |
| 132 | EE | John Tromp,
Paul M. B. Vitányi:
Randomized two-process wait-free test-and-set.
Distributed Computing 15(3): 127-135 (2002) |
| 131 | | Paul M. B. Vitányi:
Correction to "Quantum Kolmogorov complexity based on classical descriptions".
IEEE Transactions on Information Theory 48(4): 1000 (2002) |
| 130 | | Péter Gács,
John Tromp,
Paul M. B. Vitányi:
Correction to "Algorithmic statistics".
IEEE Transactions on Information Theory 48(8): 2427 (2002) |
| 129 | EE | Sibsankar Haldar,
Paul M. B. Vitányi:
Bounded concurrent timestamp systems using vector clocks.
J. ACM 49(1): 101-126 (2002) |
| 128 | | 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) |
| 2001 |
|---|
| 127 | EE | Harry Buhrman,
John Tromp,
Paul M. B. Vitányi:
Time and Space Bounds for Reversible Simulation.
ICALP 2001: 1017-1027 |
| 126 | EE | Paul M. B. Vitányi:
The Quantum Computing Challenge.
Informatics 2001: 219-233 |
| 125 | EE | Kazuyuki Amano,
John Tromp,
Paul M. B. Vitányi,
Osamu Watanabe:
On a Generalized Ruin Problem.
RANDOM-APPROX 2001: 181-191 |
| 124 | EE | Joel I. Seiferas,
Paul M. B. Vitányi:
Counting is Easy
CoRR cs.CC/0110038: (2001) |
| 123 | EE | Tao Jiang,
Joel I. Seiferas,
Paul M. B. Vitányi:
Two heads are better than two tapes
CoRR cs.CC/0110039: (2001) |
| 122 | EE | Ming Li,
Paul M. B. Vitányi:
A New Approach to Formal Language Theory by Kolmogorov Complexity
CoRR cs.CC/0110040: (2001) |
| 121 | EE | Paul M. B. Vitányi:
Meaningful Information
CoRR cs.CC/0111053: (2001) |
| 120 | EE | Ming Li,
Xin Chen,
Xin Li,
Bin Ma,
Paul M. B. Vitányi:
The similarity metric
CoRR cs.CC/0111054: (2001) |
| 119 | EE | Nick Chater,
Paul M. B. Vitányi:
The Generalized Universal Law of Generalization
CoRR cs.CV/0101036: (2001) |
| 118 | EE | John Tromp,
Paul M. B. Vitányi:
Randomized Two-Process Wait-Free Test-and-Set
CoRR cs.DC/0106056: (2001) |
| 117 | EE | Sibsankar Haldar,
Paul M. B. Vitányi:
Bounded Concurrent Timestamp Systems Using Vector Clocks
CoRR cs.DC/0108002: (2001) |
| 116 | EE | Paul M. B. Vitányi:
Randomness
CoRR math.PR/0110086: (2001) |
| 115 | EE | Harry Buhrman,
John Tromp,
Paul M. B. Vitányi:
Time and Space Bounds for Reversible Simulation
CoRR quant-ph/0101133: (2001) |
| 114 | EE | Paul M. B. Vitányi:
Quantum Kolmogorov Complexity Based on Classical Descriptions
CoRR quant-ph/0102108: (2001) |
| 113 | | Péter Gács,
John Tromp,
Paul M. B. Vitányi:
Algorithmic statistics.
IEEE Transactions on Information Theory 47(6): 2443-2463 (2001) |
| 112 | | Paul M. B. Vitányi:
Quantum Kolmogorov complexity based on classical descriptions.
IEEE Transactions on Information Theory 47(6): 2464-2479 (2001) |
| 2000 |
|---|
| 111 | EE | Péter Gács,
John Tromp,
Paul M. B. Vitányi:
Towards an Algorithmic Statistics.
ALT 2000: 41-55 |
| 110 | EE | 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 |
| 109 | EE | 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 |
| 108 | EE | Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
The Incompressibility Method.
SOFSEM 2000: 36-53 |
| 107 | EE | Qiong Gao,
Ming Li,
Paul M. B. Vitányi:
Applying MDL to learn best model granularity.
Artif. Intell. 121(1-2): 1-29 (2000) |
| 106 | EE | Péter Gács,
John Tromp,
Paul M. B. Vitányi:
Algorithmic Statistics
CoRR math.PR/0006233: (2000) |
| 105 | EE | Qiong Gao,
Ming Li,
Paul M. B. Vitányi:
Applying MDL to Learning Best Model Granularity
CoRR physics/0005062: (2000) |
| 104 | | 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) |
| 103 | EE | 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) |
| 102 | EE | 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) |
| 101 | EE | 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) |
| 100 | EE | Paul M. B. Vitányi:
A discipline of evolutionary programming.
Theor. Comput. Sci. 241(1-2): 3-23 (2000) |
| 1999 |
|---|
| 99 | EE | Harry Buhrman,
Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
New Applications of the Incompressibility Method.
ICALP 1999: 220-229 |
| 98 | EE | Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
Average-Case Complexity of Shellsort.
ICALP 1999: 453-462 |
| 97 | EE | Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
The Expected Size of Heilbronn's Triangles.
IEEE Conference on Computational Complexity 1999: 105-113 |
| 96 | | 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 |
| 95 | EE | Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
Average-Case Complexity of Shellsort (Preliminary version)
CoRR cs.CC/9906008: (1999) |
| 94 | EE | 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) |
| 93 | EE | Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
Average-Case Complexity of Shellsort
CoRR cs.DS/9901010: (1999) |
| 92 | EE | 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) |
| 91 | EE | Paul M. B. Vitányi,
Ming Li:
Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity
CoRR cs.LG/9901014: (1999) |
| 90 | EE | Paul M. B. Vitányi:
A Discipline of Evolutionary Programming
CoRR cs.NE/9902006: (1999) |
| 89 | EE | Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
The Average-Case Area of Heilbronn-Type Triangles
CoRR math.CO/9902043: (1999) |
| 88 | | Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
New Applications of the Incompressibility Method.
Comput. J. 42(4): 287-293 (1999) |
| 87 | EE | 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) |
| 86 | | 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) |
| 85 | | 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) |
| 1998 |
|---|
| 84 | | Ming Li,
Paul M. B. Vitányi:
Average-Case Analysis Using Kolgomorov Complexity (Abstract).
CATS 1998: 1-4 |
| 83 | | 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 |
| 82 | EE | Harry Buhrman,
Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
New Applications of the Incompressibility Method: Part II
CoRR cs.CC/9809060: (1998) |
| 81 | EE | Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
New Applications of the Incompressibility Method: Part I
CoRR cs.CC/9809061: (1998) |
| 80 | EE | 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) |
| 79 | | 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) |
| 1997 |
|---|
| 78 | | Ming Li,
Paul M. B. Vitányi:
Average-Case Analysis Using Kolmogorov Complexity.
Advances in Algorithms, Languages, and Complexity 1997: 157-169 |
| 77 | | Paul M. B. Vitányi:
Mutual Search (abstract).
COCOON 1997: 514 |
| 76 | | Paul M. B. Vitányi,
Ming Li:
On Prediction by Data Compression.
ECML 1997: 14-30 |
| 75 | | Ming Li,
Paul M. B. Vitányi:
Average-Case Analysis via Incompressibility.
FCT 1997: 38-50 |
| 74 | EE | Ming Li,
John Tromp,
Paul M. B. Vitányi:
Reversible Simulation of Irreversible Computation by Pebble Games
CoRR quant-ph/9703009: (1997) |
| 73 | EE | Ming Li,
Paul M. B. Vitányi:
Reversibility and Adiabatic Computation: Trading Time and Space for Energy
CoRR quant-ph/9703022: (1997) |
| 72 | EE | Tao Jiang,
Joel I. Seiferas,
Paul M. B. Vitányi:
Two heads are better than two tapes.
J. ACM 44(2): 237-256 (1997) |
| 71 | EE | Tao Jiang,
Joel I. Seiferas,
Paul M. B. Vitányi:
Erratum: ``Two heads are better that two tapes''.
J. ACM 44(4): 632 (1997) |
| 1996 |
|---|
| 70 | | Paul M. B. Vitányi:
Genetic Fitness Optimization Using Rapidly Mixing Markov Chains.
ALT 1996: 67-82 |
| 69 | EE | Ming Li,
Paul M. B. Vitányi:
Reversible Simulation of Irreversible Computation.
IEEE Conference on Computational Complexity 1996: 301-306 |
| 68 | | Harry Buhrman,
Jaap-Henk Hoepman,
Paul M. B. Vitányi:
Optimal Routing Tables.
PODC 1996: 134-142 |
| 67 | EE | Ming Li,
John Tromp,
Paul M. B. Vitányi:
How to Share Concurrent Wait-Free Variables.
J. ACM 43(4): 723-746 (1996) |
| 1995 |
|---|
| 66 | | Paul M. B. Vitányi:
Computational Learning Theory, Second European Conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995, Proceedings
Springer 1995 |
| 65 | | Paul M. B. Vitányi:
Physics and the New Computation.
MFCS 1995: 106-128 |
| 64 | | Paul M. B. Vitányi,
Ming Li:
Algorithmic Arguments in Physics of Computation.
WADS 1995: 315-333 |
| 63 | | Ming Li,
Paul M. B. Vitányi:
Computational Machine Learning in Theory and Praxis.
Computer Science Today 1995: 518-535 |
| 62 | | 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) |
| 1994 |
|---|
| 61 | | Gerard Tel,
Paul M. B. Vitányi:
Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings
Springer 1994 |
| 60 | | Alessandro Panconesi,
Marina Papatriantafilou,
Philippas Tsigas,
Paul M. B. Vitányi:
Randomized Wait-Free Naming.
ISAAC 1994: 83-91 |
| 59 | EE | Tao Jiang,
Joel I. Seiferas,
Paul M. B. Vitányi:
Two heads are better than two tapes.
STOC 1994: 668-675 |
| 58 | | Ming Li,
Paul M. B. Vitányi:
Kolmogorov Complexity Arguments in Combinatorics.
J. Comb. Theory, Ser. A 66(2): 226-236 (1994) |
| 57 | | Ming Li,
Paul M. B. Vitányi:
Statistical Properties of Finite Sequences with High Kolmogorov Complexity.
Mathematical Systems Theory 27(4): 365-376 (1994) |
| 1993 |
|---|
| 56 | EE | 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 |
|---|
| 55 | | Ming Li,
Paul M. B. Vitányi:
Philosophical Issues in Kolmogorov Complexity.
ICALP 1992: 1-15 |
| 54 | | Yehuda Afek,
Eli Gafni,
John Tromp,
Paul M. B. Vitányi:
Wait-free Test-and-Set (Extended Abstract).
WDAG 1992: 85-94 |
| 53 | | 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) |
| 52 | | Ming Li,
Paul M. B. Vitányi:
Optimality of Wait-Free Atomic Multiwriter Variables.
Inf. Process. Lett. 43(2): 107-112 (1992) |
| 51 | | Ming Li,
Paul M. B. Vitányi:
Inductive Reasoning and Kolmogorov Complexity.
J. Comput. Syst. Sci. 44(2): 343-384 (1992) |
| 50 | | Evangelos Kranakis,
Paul M. B. Vitányi:
A Note on Weighted Distributed Match-Making.
Mathematical Systems Theory 25(2): 123-140 (1992) |
| 49 | | Ming Li,
Luc Longpré,
Paul M. B. Vitányi:
The Power of the Queue.
SIAM J. Comput. 21(4): 697-712 (1992) |
| 1991 |
|---|
| 48 | | Ming Li,
Paul M. B. Vitányi:
Combinatorics and Kolmogorov Complexity.
Structure in Complexity Theory Conference 1991: 154-163 |
| 47 | | Ming Li,
Paul M. B. Vitányi:
Learning Simple Concept Under Simple Distributions.
SIAM J. Comput. 20(5): 911-935 (1991) |
| 1990 |
|---|
| 46 | | 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 |
|---|
| 45 | | 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 |
| 44 | | Ming Li,
Paul M. B. Vitányi:
How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version).
ICALP 1989: 488-505 |
| 43 | | Ming Li,
Paul M. B. Vitányi:
A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version).
ICALP 1989: 506-520 |
| 42 | | Ming Li,
Paul M. B. Vitányi:
Inductive Reasoning and Komogorov Complexity.
Structure in Complexity Theory Conference 1989: 165-185 |
| 1988 |
|---|
| 41 | | Evangelos Kranakis,
Paul M. B. Vitányi:
Weighted Distributed Match-Making.
AWOC 1988: 361-368 |
| 40 | | Baruch Awerbuch,
Lefteris M. Kirousis,
Evangelos Kranakis,
Paul M. B. Vitányi:
A Proof Technique for Register Automicity.
FSTTCS 1988: 286-303 |
| 39 | | Sape J. Mullender,
Paul M. B. Vitányi:
Distributed Match-Making.
Algorithmica 3: 367-391 (1988) |
| 38 | | Ming Li,
Paul M. B. Vitányi:
Tape versus Queue and Stacks: The Lower Bounds
Inf. Comput. 78(1): 56-85 (1988) |
| 37 | EE | Joel I. Seiferas,
Paul M. B. Vitányi:
Counting is easy.
J. ACM 35(4): 985-1000 (1988) |
| 36 | | Paul M. B. Vitányi:
Locality, Communication, and Interconnect Length in Multicomputers.
SIAM J. Comput. 17(4): 659-672 (1988) |
| 1987 |
|---|
| 35 | | Paul M. B. Vitányi,
Baruch Awerbuch:
Errata to ``Atomic Shared Register Access by Asynchronous Hardware''
FOCS 1987: 487 |
| 34 | | Lefteris M. Kirousis,
Evangelos Kranakis,
Paul M. B. Vitányi:
Atomic Multireader Register.
WDAG 1987: 278-296 |
| 1986 |
|---|
| 33 | | Paul M. B. Vitányi:
Nonsequentail Computation and Laws of Nature.
Aegean Workshop on Computing 1986: 108-120 |
| 32 | | Paul M. B. Vitányi,
Baruch Awerbuch:
Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract)
FOCS 1986: 233-243 |
| 31 | | Ming Li,
Luc Longpré,
Paul M. B. Vitányi:
The Power of the Queue.
Structure in Complexity Theory Conference 1986: 218-233 |
| 30 | | 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) |
| 1985 |
|---|
| 29 | | Paul M. B. Vitányi:
Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary Version)
FOCS 1985: 197-207 |
| 28 | | Sape J. Mullender,
Paul M. B. Vitányi:
Distributed Match-Making for Processes in Computer Networks (Preliminary Version).
PODC 1985: 261-271 |
| 27 | | Paul M. B. Vitányi:
Logarithmic signal propagation delay and the efficiency of VLSI circuits.
Bulletin of the EATCS 25: 37-39 (1985) |
| 26 | | 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) |
| 25 | | 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) |
| 24 | | Paul M. B. Vitányi:
An Optimal Simulation of Counter Machines.
SIAM J. Comput. 14(1): 1-33 (1985) |
| 23 | | Paul M. B. Vitányi:
An Optimal Simulation of Counter Machines: The ACM Case.
SIAM J. Comput. 14(1): 34-40 (1985) |
| 1984 |
|---|
| 22 | | Paul M. B. Vitányi:
The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version).
ICALP 1984: 486-489 |
| 21 | | Paul M. B. Vitányi:
Distributed Elections in an Archimedean Ring of Processors (Preliminary Version)
STOC 1984: 542-547 |
| 20 | | Paul M. B. Vitányi,
Lambert G. L. T. Meertens:
Big omega versus the wild functions.
Bulletin of the EATCS 22: 14-19 (1984) |
| 19 | | 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) |
| 18 | | Paul M. B. Vitányi:
On Two-Tape Real-Time Computation and Queues.
J. Comput. Syst. Sci. 29(3): 303-311 (1984) |
| 17 | | Paul M. B. Vitányi:
On the Simulation of Many Storage Heads by One.
Theor. Comput. Sci. 34: 157-168 (1984) |
| 1983 |
|---|
| 16 | | Paul M. B. Vitányi:
On the Simulation of Many Storage Heads by a Single One (Extended Abstract).
ICALP 1983: 687-694 |
| 1982 |
|---|
| 15 | | Paul M. B. Vitányi:
Efficient Simulations of Multicounter Machines.
ICALP 1982: 546-560 |
| 14 | | Paul M. B. Vitányi:
Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines
STOC 1982: 27-36 |
| 13 | | Paul M. B. Vitányi:
On Efficient Simulations of Multicounter Machines
Information and Control 55(1-3): 20-39 (1982) |
| 1981 |
|---|
| 12 | EE | Paul M. B. Vitányi:
How well can a graph be n-colored?
Discrete Mathematics 34(1): 69-80 (1981) |
| 1980 |
|---|
| 11 | | Paul M. B. Vitányi:
On the Power of Real-Time Machines Under Varying Specifications (Extended Abstract).
ICALP 1980: 658-671 |
| 10 | | Paul M. B. Vitányi:
Relativized Obliviousness.
MFCS 1980: 665-672 |
| 9 | | 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) |
| 1978 |
|---|
| 8 | EE | 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) |
| 7 | | Paul M. B. Vitányi,
Adrian Walker:
Stable String Languages of Lindenmayer Systems
Information and Control 37(2): 134-149 (1978) |
| 6 | | Paul M. B. Vitányi,
Walter J. Savitch:
On Inverse Deterministic Pushdown Transductions.
J. Comput. Syst. Sci. 16(3): 423-444 (1978) |
| 1977 |
|---|
| 5 | | Walter J. Savitch,
Paul M. B. Vitányi:
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps.
ICALP 1977: 453-464 |
| 4 | | 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) |
| 1976 |
|---|
| 3 | | Paul M. B. Vitányi:
Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms.
Theor. Comput. Sci. 2(1): 49-71 (1976) |
| 1974 |
|---|
| 2 | | Paul M. B. Vitányi:
Growth of Strings in Context Dependent Lindenmayer Systems.
L Systems 1974: 104-126 |
| 1 | | Paul M. B. Vitányi:
On the Size of D0L Languages.
L Systems 1974: 78-92 |
