| Publication | Date of Publication | Type |
|---|
| Some notes on the nearest neighbour interchange distance | 2024-01-29 | Paper |
| Approximating shortest superstrings with constraints | 2023-01-18 | Paper |
| Algorithmic arguments in physics of computation | 2022-12-16 | Paper |
| Average-case analysis via incompressibility | 2022-12-09 | Paper |
| Philosophical issues in Kolmogorov complexity | 2019-12-04 | Paper |
| On the approximation of shortest common supersequences and longest common subsequences | 2019-04-29 | Paper |
| An introduction to Kolmogorov complexity and its applications | 2019-02-15 | Paper |
| Lower bounds on learning decision lists and trees | 2017-12-04 | Paper |
| Finding similar regions in many strings | 2016-09-29 | Paper |
| On the closest string and substring problems | 2015-10-30 | Paper |
| A lower bound on the average-case complexity of shellsort | 2015-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501820 | 2015-08-14 | Paper |
| Thermodynamics of computation and information distance | 2015-05-07 | Paper |
| k one-way heads cannot do string-matching | 2015-05-07 | Paper |
| Near optimal multiple alignment within a band in polynomial time | 2014-09-26 | Paper |
| Wavelet Frame Based Algorithm for 3D Reconstruction in Electron Microscopy | 2014-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224097 | 2012-03-29 | Paper |
| Superiority and complexity of the spaced seeds | 2010-08-16 | Paper |
| Average-case analysis of quicksort and binary insertion tree height using incompressibility | 2010-03-24 | Paper |
| Finding compact structural motifs | 2009-08-07 | Paper |
| On two open problems of 2-interval patterns | 2009-06-04 | Paper |
| Sharpening Occam's razor | 2009-03-23 | Paper |
| Normalized Information Distance | 2009-03-12 | Paper |
| Shared Information and Program Plagiarism Detection | 2008-12-21 | Paper |
| The Similarity Metric | 2008-12-21 | Paper |
| Finding Compact Structural Motifs | 2008-06-17 | Paper |
| Computing Exact p-Value for Structured Motif | 2008-06-17 | Paper |
| Finding Largest Well-Predicted Subset of Protein Structure Models | 2008-06-17 | Paper |
| An introduction to Kolmogorov complexity and its applications | 2008-06-04 | Paper |
| INFORMATION DISTANCE AND ITS APPLICATIONS | 2008-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5456767 | 2008-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457044 | 2008-04-14 | Paper |
| Information Distance and Its Applications | 2007-09-06 | Paper |
| On the complexity of the spaced seeds | 2007-08-27 | Paper |
| Near optimal multiple alignment within a band in polynomial time | 2007-08-23 | Paper |
| DNA sequencing and string learning | 2007-06-11 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Protein threading by linear programming: theoretical analysis and computational results | 2005-05-13 | Paper |
| Selecting the branches for an evolutionary tree. | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808662 | 2004-08-12 | Paper |
| On spaced seeds for similarity search | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471962 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471384 | 2004-07-28 | Paper |
| Distinguishing string selection problems. | 2004-03-14 | Paper |
| Finding similar regions in many sequences | 2003-05-04 | Paper |
| The average‐case area of Heilbronn‐type triangles* | 2002-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941165 | 2002-01-24 | Paper |
| A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application | 2001-06-21 | Paper |
| On the linear-cost subtree-transfer distance between phylogenetic trees | 2001-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4519914 | 2000-12-07 | Paper |
| Fixed topology alignment with recombination | 2000-11-06 | Paper |
| Applying MDL to learn best model granularity | 2000-10-26 | Paper |
| From Gene Trees to Species Trees | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938781 | 2000-09-10 | Paper |
| Minimum description length induction, Bayesianism, and Kolmogorov complexity | 2000-09-07 | Paper |
| New applications of the incompressibility method. II | 2000-06-04 | Paper |
| Approximation Algorithms for Directed Steiner Problems | 2000-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952631 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952646 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938627 | 2000-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247446 | 2000-04-17 | 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 |
| Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions | 1999-11-23 | Paper |
| Information distance | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252331 | 1999-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252342 | 1999-09-15 | Paper |
| On the complexity and approximation of syntenic distance | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250182 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218410 | 1999-02-14 | Paper |
| Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis | 1998-08-13 | Paper |
| Inferring a DNA sequence from erroneous copies | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385509 | 1998-05-04 | Paper |
| How to share concurrent wait-free variables | 1998-01-22 | Paper |
| \(k\) one-way heads cannot do string-matching | 1997-11-18 | 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 |
| Iterative belief revision in extended logic programming | 1997-02-27 | Paper |
| On the Approximation of Shortest Common Supersequences and Longest Common Subsequences | 1997-01-02 | Paper |
| Lower bounds on learning decision lists and trees | 1996-07-03 | Paper |
| Approximating shortest superstrings with constraints | 1996-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840106 | 1995-09-27 | 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 |
| Learning Boolean formulas | 1995-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327318 | 1995-04-03 | Paper |
| Kolmogorov complexity arguments in combinatorics | 1995-01-12 | Paper |
| Three one-way heads cannot do string matching | 1994-12-11 | Paper |
| Linear approximation of shortest superstrings | 1994-11-03 | Paper |
| Statistical properties of finite sequences with high Kolmogorov complexity | 1994-08-10 | Paper |
| On the complexity of learning strings and sequences | 1993-11-28 | Paper |
| Learning in the Presence of Malicious Errors | 1993-10-10 | Paper |
| Bounded time-stamps | 1993-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035322 | 1993-05-18 | Paper |
| A note on shortest superstrings with flipping | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023358 | 1993-01-23 | Paper |
| Theory and algorithms for plan merging | 1993-01-17 | 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 |
| Learning Simple Concepts under Simple Distributions | 1992-06-26 | Paper |
| New lower bounds for parallel computation | 1992-06-25 | Paper |
| Resource bounds for parallel computation of threshold and symmetric functions | 1991-01-01 | Paper |
| On the power of concurrent-write PRAMs with read-only memory | 1989-01-01 | Paper |
| Geometric optimization and \(D^ P\)-completeness | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3493263 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732131 | 1989-01-01 | Paper |
| Tape versus queue and stacks: The lower bounds | 1988-01-01 | Paper |
| k\(+1\) heads are better than k for PDAs | 1988-01-01 | Paper |
| A separator theorem for one-dimensional graphs under linear mapping | 1988-01-01 | Paper |
| Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815511 | 1988-01-01 | Paper |
| Separation and lower bounds for ROM and nondeterministic models of parallel computation | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783554 | 1987-01-01 | Paper |
| String-matching cannot be done by a two-head one-way deterministic finite automaton | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751011 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801071 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3690223 | 1985-01-01 | Paper |
| Normalized quadtrees with respect to translations | 1982-01-01 | Paper |
