| Publication | Date of Publication | Type |
|---|
| A Weyl criterion for finite-state dimension and applications | 2024-12-03 | Paper |
The point-to-set principle and the dimensions of Hamel bases
Computability | 2024-08-29 | Paper |
| Extending the reach of the point-to-set principle | 2024-04-23 | Paper |
Real-time computability of real numbers by chemical reaction networks
Natural Computing | 2024-02-09 | Paper |
Reachability problems for continuous chemical reaction networks
Natural Computing | 2023-11-30 | Paper |
Population-induced phase transitions and the verification of chemical reaction networks
(available as arXiv preprint) | 2023-10-27 | Paper |
Extending the reach of the point-to-set principle
Information and Computation | 2023-09-27 | Paper |
Dimension and the structure of complexity classes
Theory of Computing Systems | 2023-07-26 | Paper |
| Asymptotic Divergences and Strong Dichotomy. | 2023-02-07 | Paper |
Equivalence of measures of complexity classes
Lecture Notes in Computer Science | 2022-11-09 | Paper |
On complexity classes and algorithmically random languages (extended abstract)
STACS 92 | 2022-08-18 | Paper |
Asymptotic Divergences and Strong Dichotomy
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Algorithmic Fractal Dimensions in Geometric Measure Theory
Theory and Applications of Computability | 2022-01-26 | Paper |
Computing absolutely normal numbers in nearly linear time
Information and Computation | 2021-11-25 | Paper |
| The Point-to-Set Principle and the Dimensions of Hamel Bases | 2021-09-22 | Paper |
Who asked us? How the theory of computing answers questions about analysis
Complexity and Approximation | 2020-07-20 | Paper |
| Algorithmically Optimal Outer Measures | 2020-06-15 | Paper |
Robust biomolecular finite automata
Theoretical Computer Science | 2020-03-20 | Paper |
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
| Algorithmic Randomness in Continuous-Time Markov Chains | 2019-10-29 | Paper |
Computational depth and reducibility
Automata, Languages and Programming | 2019-03-29 | Paper |
Weakly useful sequences
Automata, Languages and Programming | 2019-01-10 | Paper |
Recursive computational depth
Automata, Languages and Programming | 2018-07-04 | Paper |
Mutual dimension and random sequences
Theoretical Computer Science | 2018-06-07 | Paper |
Algorithmic information, plane Kakeya sets, and conditional dimension
(available as arXiv preprint) | 2018-04-19 | Paper |
Completeness and weak completeness under polynomial-size circuits
STACS 95 | 2017-12-04 | Paper |
Observations on measure and lowness for \(\Delta_2^{\mathrm{P}}\) (extended abstract)
STACS 96 | 2017-11-16 | Paper |
Real-time computability of real numbers by chemical reaction networks
Lecture Notes in Computer Science | 2017-08-31 | Paper |
The arithmetical complexity of dimension and randomness
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
| scientific article; zbMATH DE number 6678913 (Why is no real title available?) | 2017-01-30 | Paper |
Mutual dimension
ACM Transactions on Computation Theory | 2016-11-10 | Paper |
Reachability problems for continuous chemical reaction networks
Lecture Notes in Computer Science | 2016-09-28 | Paper |
Lines missing every random point
Computability | 2015-10-20 | Paper |
Mutual dimension and random sequences
Lecture Notes in Computer Science | 2015-09-16 | Paper |
Lines Missing Every Random Point
Language, Life, Limits | 2015-02-25 | Paper |
Dimension spectra of random subfractals of self-similar fractals
Annals of Pure and Applied Logic | 2014-08-21 | Paper |
The frequent paucity of trivial strings
Information Processing Letters | 2014-07-18 | Paper |
Translating the Cantor set by a random real
Transactions of the American Mathematical Society | 2014-06-11 | Paper |
Connectivity properties of dimension level sets
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Approximate self-assembly of the Sierpinski triangle
Theory of Computing Systems | 2012-12-07 | Paper |
Inseparability and strong hypotheses for disjoint NP pairs
Theory of Computing Systems | 2012-12-07 | Paper |
Curves that must be retraced
(available as arXiv preprint) | 2012-09-28 | Paper |
| Intrinsic universality in self-assembly | 2012-01-23 | Paper |
| Inseparability and strong hypotheses for disjoint NP pairs | 2012-01-23 | Paper |
Effective dimensions and relative frequencies
Theoretical Computer Science | 2011-12-07 | Paper |
Axiomatizing resource bounds for measure
Models of Computation in Context | 2011-09-09 | Paper |
Multi-resolution cellular automata for real computation
Models of Computation in Context | 2011-09-09 | Paper |
Curves that must be retraced
Information and Computation | 2011-07-08 | Paper |
Computability and complexity in self-assembly
Theory of Computing Systems | 2011-05-23 | Paper |
A divergence formula for randomness and dimension
Theoretical Computer Science | 2011-01-10 | Paper |
Approximate self-assembly of the Sierpinski triangle
Lecture Notes in Computer Science | 2010-07-29 | Paper |
A divergence formula for randomness and dimension
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Dimension characterizations of complexity classes
Computational Complexity | 2010-03-15 | Paper |
Random Number Selection in Self-assembly
Lecture Notes in Computer Science | 2009-10-22 | Paper |
Computability versus exact computability of martingales
Information Processing Letters | 2009-08-27 | Paper |
Dimensions of Points in Self-Similar Fractals
SIAM Journal on Computing | 2009-06-22 | Paper |
Finite-state dimension and real arithmetic
Lecture Notes in Computer Science | 2009-03-12 | Paper |
Strict self-assembly of discrete Sierpinski triangles
Theoretical Computer Science | 2009-03-02 | Paper |
Connectivity properties of dimension level sets
Mathematical Logic Quarterly | 2008-10-08 | Paper |
Dimensions of Points in Self-similar Fractals
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Effective Strong Dimension in Algorithmic Information and Computational Complexity
SIAM Journal on Computing | 2008-06-19 | Paper |
Computability and Complexity in Self-assembly
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Effective Dimensions and Relative Frequencies
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Finite-state dimension and real arithmetic
Information and Computation | 2007-11-21 | Paper |
Strict Self-assembly of Discrete Sierpinski Triangles
Lecture Notes in Computer Science | 2007-11-13 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Dimensions of Copeland-Erdös sequences
Information and Computation | 2007-09-18 | Paper |
Dimension Characterizations of Complexity Classes
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Why computational complexity requires stricter martingales
Theory of Computing Systems | 2006-10-25 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Prediction and dimension
Journal of Computer and System Sciences | 2005-06-13 | Paper |
Effective fractal dimensions
MLQ | 2005-02-16 | Paper |
Baire category and nowhere differentiability for feasible real functions
Mathematical Logic Quarterly | 2005-02-16 | Paper |
The dimensions of individual strings and sequences
Information and Computation | 2004-11-23 | Paper |
Finite-state dimension
Theoretical Computer Science | 2004-10-27 | Paper |
Scaled dimension and nonuniform complexity
Journal of Computer and System Sciences | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2089375 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086651 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080993 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2038717 (Why is no real title available?) | 2004-02-08 | Paper |
Dimension in Complexity Classes
SIAM Journal on Computing | 2003-09-28 | Paper |
Recursive computational depth.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1754653 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1670880 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1860654 (Why is no real title available?) | 2001-01-01 | Paper |
The Density of Weakly Complete Problems under Adaptive Reductions
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1500526 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1500508 (Why is no real title available?) | 2000-09-04 | Paper |
Modeling time-bounded prefix Kolmogorov complexity
Theory of Computing Systems | 2000-05-07 | Paper |
| scientific article; zbMATH DE number 1335897 (Why is no real title available?) | 2000-05-04 | Paper |
| scientific article; zbMATH DE number 1414309 (Why is no real title available?) | 2000-03-16 | Paper |
Feasible reductions to Kolmogorov-Loveland stochastic sequences
Theoretical Computer Science | 2000-01-12 | Paper |
Equivalence of Measures of Complexity Classes
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1346358 (Why is no real title available?) | 1999-09-30 | Paper |
Genericity and randomness over feasible probability measures
Theoretical Computer Science | 1999-01-12 | Paper |
Observations on measure and lowness for \(\Delta_ 2^ p\)
Theory of Computing Systems | 1997-10-19 | Paper |
| scientific article; zbMATH DE number 1072536 (Why is no real title available?) | 1997-10-08 | Paper |
| scientific article; zbMATH DE number 1008512 (Why is no real title available?) | 1997-05-12 | Paper |
Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
Theoretical Computer Science | 1997-02-28 | Paper |
Cook versus Karp-Levin: Separating completeness notions if NP is not small
Theoretical Computer Science | 1997-02-27 | Paper |
Completeness and weak completeness under polynomial-size circuits
Information and Computation | 1997-01-02 | Paper |
Weakly Hard Problems
SIAM Journal on Computing | 1996-02-01 | Paper |
The Complexity and Distribution of Hard Problems
SIAM Journal on Computing | 1995-12-13 | Paper |
The global power of additional queries to random oracles
Information and Computation | 1995-09-17 | Paper |
An observation on probability versus randomness with applications to complexity classes
Mathematical Systems Theory | 1995-08-27 | Paper |
Measure, Stochasticity, and the Density of Hard Languages
SIAM Journal on Computing | 1995-03-20 | Paper |
Computational depth and reducibility
Theoretical Computer Science | 1994-09-25 | Paper |
A Pseudorandom Oracle Characterization of ${\text{BPP}}$
SIAM Journal on Computing | 1994-03-13 | Paper |
| scientific article; zbMATH DE number 512813 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 177821 (Why is no real title available?) | 1993-05-18 | Paper |
On Languages with Very High Space-Bounded Kolmogorov Complexity
SIAM Journal on Computing | 1993-05-17 | Paper |
Circuit size relative to pseudorandom oracles
Theoretical Computer Science | 1993-05-16 | Paper |
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences | 1992-09-27 | Paper |
On independent random oracles
Theoretical Computer Science | 1992-06-28 | Paper |
An upward measure separation theorem
Theoretical Computer Science | 1991-01-01 | Paper |
Category and Measure in Complexity Classes
SIAM Journal on Computing | 1990-01-01 | Paper |
Pseudorandom sources for BPP
Journal of Computer and System Sciences | 1990-01-01 | Paper |
