| Publication | Date of Publication | Type |
|---|
| Algorithmic arguments in physics of computation | 2022-12-16 | Paper |
| Average-case analysis via incompressibility | 2022-12-09 | Paper |
| Randomized two-process wait-free test-and-set | 2020-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5137352 | 2020-12-02 | Paper |
| Philosophical issues in Kolmogorov complexity | 2019-12-04 | Paper |
| Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines | 2019-06-06 | Paper |
| Corrigendum to: ``On the rate of decrease in logical depth by by L. F. Antunes, A. Souto, and P. M. B. Vitányi | 2019-05-02 | Paper |
| An introduction to Kolmogorov complexity and its applications | 2019-02-15 | Paper |
| Obituary: Ray Solomonoff, founding father of algorithmic information theory | 2018-08-20 | Paper |
| On the average‐case complexity of Shellsort | 2018-06-07 | Paper |
| On the rate of decrease in logical depth | 2017-11-06 | Paper |
| Exact Expression For Information Distance | 2017-10-19 | Paper |
| Approximation of the Two-Part MDL Code | 2017-08-08 | Paper |
| Information Distance in Multiples | 2017-07-27 | Paper |
| Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity | 2017-07-27 | Paper |
| Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising | 2017-07-12 | Paper |
| Identification of probabilities | 2017-02-28 | Paper |
| Similarity and denoising | 2017-01-13 | Paper |
| Two heads are better than two tapes | 2016-09-01 | Paper |
| Bounded concurrent timestamp systems using vector clocks | 2015-10-30 | Paper |
| A lower bound on the average-case complexity of shellsort | 2015-09-19 | Paper |
| Optimal routing tables | 2015-09-11 | Paper |
| Thermodynamics of computation and information distance | 2015-05-07 | Paper |
| Conditional Kolmogorov complexity and universal probability | 2014-01-10 | Paper |
| Tolstoy's mathematics in ``War and peace | 2013-07-18 | Paper |
| Identification of Probabilities of Languages | 2012-08-24 | Paper |
| Nonapproximability of the normalized information distance | 2011-04-28 | Paper |
| A fast quartet tree heuristic for hierarchical clustering | 2011-01-31 | Paper |
| Time-bounded incompressibility of compressible strings and sequences | 2010-08-20 | Paper |
| Physics and the new computation | 2010-06-17 | Paper |
| Genetic fitness optimization using rapidly mixing Markov chains | 2010-04-27 | Paper |
| Depth as randomness deficiency | 2009-10-19 | Paper |
| Sharpening Occam's razor | 2009-03-23 | Paper |
| Normalized Information Distance | 2009-03-12 | Paper |
| Clustering by Compression | 2008-12-21 | Paper |
| The Similarity Metric | 2008-12-21 | Paper |
| Kolmogorov's Structure Functions and Model Selection | 2008-12-21 | Paper |
| Meaningful Information | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3508021 | 2008-06-27 | Paper |
| An introduction to Kolmogorov complexity and its applications | 2008-06-04 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| `Ideal learning' of natural language: positive results about learning from positive evidence | 2007-10-01 | Paper |
| Individual communication complexity | 2007-08-23 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Correction to "CDMA systems in fading channels: admissibility, network capacity, and power control" | 2005-05-11 | Paper |
| Correction to "Algorithmic statistics" | 2005-05-11 | Paper |
| Mutual search | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808662 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473230 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471962 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471384 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437118 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427879 | 2003-09-14 | Paper |
| Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers | 2003-09-01 | Paper |
| The generalized universal law of generalization. | 2003-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780793 | 2002-11-21 | Paper |
| The average‐case area of Heilbronn‐type triangles* | 2002-08-08 | Paper |
| Algorithmic statistics | 2002-08-04 | Paper |
| Quantum Kolmogorov complexity based on classical descriptions | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535080 | 2002-06-12 | Paper |
| On the simulation of many storage heads by one | 2002-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766868 | 2002-01-28 | Paper |
| Time and space bounds for reversible simulation | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941165 | 2002-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525687 | 2001-01-24 | Paper |
| Applying MDL to learn best model granularity | 2000-10-26 | Paper |
| Minimum description length induction, Bayesianism, and Kolmogorov complexity | 2000-09-07 | Paper |
| A discipline of evolutionary programming | 2000-08-21 | Paper |
| New applications of the incompressibility method. II | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938627 | 2000-04-25 | Paper |
| The miraculous universal distribution | 2000-04-02 | Paper |
| Kolmogorov Random Graphs and the Incompressibility Method | 2000-03-19 | Paper |
| New Applications of the Incompressibility Method | 2000-01-17 | Paper |
| Average-case analysis of algorithms using Kolmogorov complexity | 2000-01-01 | Paper |
| Information distance | 1999-11-21 | Paper |
| Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250216 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385509 | 1998-05-04 | Paper |
| Two heads are better than two tapes | 1998-02-17 | Paper |
| How to share concurrent wait-free variables | 1998-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4337021 | 1997-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336271 | 1997-05-12 | Paper |
| Reversibility and adiabatic computation: trading time and space for energy | 1997-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4865643 | 1996-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852885 | 1996-03-14 | Paper |
| Erratum to: Kolmogorov complexity arguments in combinatorics | 1995-06-30 | Paper |
| A New Approach to Formal Language Theory by Kolmogorov Complexity | 1995-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327318 | 1995-04-03 | Paper |
| Kolmogorov complexity arguments in combinatorics | 1995-01-12 | Paper |
| Statistical properties of finite sequences with high Kolmogorov complexity | 1994-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035322 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023358 | 1993-01-23 | Paper |
| Optimality of wait-free atomic multiwriter variables | 1993-01-17 | Paper |
| Average case complexity under the universal distribution equals worst- case complexity | 1993-01-16 | Paper |
| The Power of the Queue | 1992-12-14 | Paper |
| Inductive reasoning and Kolmogorov complexity | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013557 | 1992-09-27 | Paper |
| A note on weighted distributed match-making | 1992-09-26 | Paper |
| Learning Simple Concepts under Simple Distributions | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732131 | 1989-01-01 | Paper |
| Distributed match-making | 1988-01-01 | Paper |
| Tape versus queue and stacks: The lower bounds | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3784021 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796718 | 1988-01-01 | Paper |
| Locality, Communication, and Interconnect Length in Multicomputers | 1988-01-01 | Paper |
| Counting is easy | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815511 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3823129 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3703691 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727388 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751011 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3759923 | 1986-01-01 | Paper |
| Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit | 1985-01-01 | Paper |
| An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape | 1985-01-01 | Paper |
| An Optimal Simulation of Counter Machines | 1985-01-01 | Paper |
| An Optimal Simulation of Counter Machines: The ACM Case | 1985-01-01 | Paper |
| On the power of real-time two-way multihead finite automata with jumps | 1984-01-01 | Paper |
| On two-tape real-time computation and queues | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714463 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732961 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670564 | 1983-01-01 | Paper |
| On efficient simulations of multicounter machines | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933743 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933744 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942399 | 1982-01-01 | Paper |
| How well can a graph be n-colored? | 1981-01-01 | Paper |
| A note on dpda transductions of {0,1}∗and inverse dpda transductions of the dyck set | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3904051 | 1981-01-01 | Paper |
| Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3856101 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3856102 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3870314 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3870315 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3880294 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3886865 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3890113 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3893304 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3051375 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206317 | 1979-01-01 | Paper |
| A note on the recursive enumerability of some classes of recursively enumerable languages | 1978-01-01 | Paper |
| On inverse deterministic pushdown transductions | 1978-01-01 | Paper |
| Stable string languages of lindenmayer systems | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124336 | 1977-01-01 | Paper |
| Context sensitive table linden mayer languages and a relation to the LBA problem | 1977-01-01 | Paper |
| On a problem in the collective behavior of automata | 1976-01-01 | Paper |
| Deterministic Lindenmayer languages, nonterminals and homomorphisms | 1976-01-01 | Paper |
| Growth Functions Associated with Biological Development | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4045670 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4054678 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4768642 | 1973-01-01 | Paper |
| Sexually reproducing cellular automata | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5666178 | 1972-01-01 | Paper |
