| Publication | Date of Publication | Type |
|---|
| Memory compression with quantum random-access gates | 2024-06-27 | Paper |
scientific article; zbMATH DE number 7829263 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
| Hardness of constant-round communication complexity | 2023-07-12 | Paper |
| scientific article; zbMATH DE number 7561750 (Why is no real title available?) | 2022-07-21 | Paper |
| Lifting Theorems for Equality | 2022-07-18 | Paper |
The computational power of parsing expression grammars
Journal of Computer and System Sciences | 2020-03-26 | Paper |
Simulation theorems via pseudo-random properties
Computational Complexity | 2019-12-19 | Paper |
Simulation beats richness: new data-structure lower bounds
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The computational power of parsing expression grammars
Lecture Notes in Computer Science | 2018-11-22 | Paper |
| Lower bounds for elimination via weak regularity | 2018-04-19 | Paper |
Catalytic space: non-determinism and hierarchy
Theory of Computing Systems | 2018-03-01 | Paper |
| scientific article; zbMATH DE number 6829365 (Why is no real title available?) | 2018-01-24 | Paper |
| scientific article; zbMATH DE number 6823178 (Why is no real title available?) | 2018-01-09 | Paper |
Towards a reverse Newman's theorem in interactive information complexity
Algorithmica | 2016-11-29 | Paper |
Computing with a full memory: catalytic space
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Hardness of approximation for knapsack problems
Theory of Computing Systems | 2015-05-29 | Paper |
Reductions to the set of random strings: the resource-bounded case
Logical Methods in Computer Science | 2014-09-05 | Paper |
Learning Reductions to Sparse Sets
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Reductions to the set of random strings: the resource-bounded case
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Monotonicity constraints in characterizations of PSPACE
Journal of Logic and Computation | 2012-05-07 | Paper |
Computability on reals, infinite limits and differential equations
Applied Mathematics and Computation | 2010-09-01 | Paper |
Computational complexity with experiments as oracles. II. Upper bounds
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2010-05-19 | Paper |
A foundation for real recursive function theory
Annals of Pure and Applied Logic | 2009-10-26 | Paper |
Computational complexity with experiments as oracles
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2009-01-23 | Paper |
Oracles and Advice as Measurements
Unconventional Computing | 2008-12-02 | Paper |
On the Complexity of Measurement in Classical Physics
Lecture Notes in Computer Science | 2008-05-27 | Paper |
The New Promise of Analog Computation
Lecture Notes in Computer Science | 2007-11-13 | Paper |
