| Publication | Date of Publication | Type |
|---|
Pebble-depth
Theoretical Computer Science | 2024-08-20 | Paper |
scientific article; zbMATH DE number 7799625 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
Pushdown and Lempel-Ziv depth
Information and Computation | 2023-05-19 | Paper |
A normal sequence compressed by PPM* but not by Lempel-Ziv 78
(available as arXiv preprint) | 2022-03-24 | Paper |
| A general notion of useful information | 2021-01-20 | Paper |
A general notion of useful information
(available as arXiv preprint) | 2021-01-20 | Paper |
On the difference between finite-state and pushdown depth
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Polylog depth, highness and lowness for E
Information and Computation | 2020-03-12 | Paper |
Depth, highness and DNR degrees
(available as arXiv preprint) | 2018-12-10 | Paper |
| Depth, highness and DNR degrees | 2018-12-10 | Paper |
Limit-depth and DNR degrees
Information Processing Letters | 2018-04-05 | Paper |
Bounded pushdown dimension vs Lempel Ziv information density
Computability and Complexity | 2017-04-04 | Paper |
Bounded pushdown dimension vs Lempel Ziv information density
Computability and Complexity | 2017-04-04 | Paper |
Depth, highness and DNR degrees
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Dimension spectra of random subfractals of self-similar fractals
Annals of Pure and Applied Logic | 2014-08-21 | Paper |
On the convergence of Fourier series of computable Lebesgue integrable functions
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
On the polynomial depth of various sets of random strings
Theoretical Computer Science | 2013-04-17 | Paper |
A zero-one SUBEXP-dimension law for BPP
Information Processing Letters | 2013-03-28 | Paper |
On the Polynomial Depth of Various Sets of Random Strings
Lecture Notes in Computer Science | 2011-07-01 | Paper |
On the Polynomial Depth of Various Sets of Random Strings
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
Theory of Computing Systems | 2011-05-25 | Paper |
On the convergence of Fourier series of computable Lebesgue integrable functions
Mathematical Logic Quarterly | 2010-11-04 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Resource-bounded measure on probabilistic classes
Information Processing Letters | 2010-04-19 | Paper |
A zero-one law for RP and derandomization of AM if NP is not small
Information and Computation | 2009-07-15 | Paper |
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Martingale families and dimension in P
Theoretical Computer Science | 2008-06-24 | Paper |
Baire categories on small complexity classes and meager-comeager laws
Information and Computation | 2008-03-11 | Paper |
Generic density and small span theorem
Information and Computation | 2008-03-11 | Paper |
Feasible Depth
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Dimensions of Copeland-Erdös sequences
Information and Computation | 2007-09-18 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
