| Publication | Date of Publication | Type |
|---|
| Bounded relativization | 2024-11-19 | Paper |
One-tape Turing machine and branching program lower bounds for MCSP
Theory of Computing Systems | 2024-10-07 | Paper |
| Kolmogorov complexity characterizes statistical zero knowledge | 2024-09-25 | Paper |
| Learning versus pseudorandom generators in constant parallel time | 2024-09-25 | Paper |
| Finding errorless pessiland in error-prone heuristica | 2024-07-05 | Paper |
| Symmetry of information from meta-complexity | 2024-07-05 | Paper |
| Hardness self-amplification: simplified, optimized, and unified | 2024-05-08 | Paper |
| Capturing one-way functions via NP-hardness of meta-complexity | 2024-05-08 | Paper |
| A duality between one-way functions and average-case symmetry of information | 2024-05-08 | Paper |
| scientific article; zbMATH DE number 7829277 (Why is no real title available?) | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7829316 (Why is no real title available?) | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7829317 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7788478 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Cryptographic hardness under projections for time-bounded Kolmogorov complexity | 2024-01-15 | Paper |
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
SIAM Journal on Computing | 2024-01-02 | Paper |
Average-case hardness of NP from exponential worst-case hardness assumptions
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| scientific article; zbMATH DE number 7758317 (Why is no real title available?) | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7754310 (Why is no real title available?)
Theory of Computing | 2023-10-25 | Paper |
scientific article; zbMATH DE number 7724232 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
| Hardness of constant-round communication complexity | 2023-07-12 | Paper |
Beyond Natural Proofs: Hardness Magnification and Locality
Journal of the ACM | 2023-04-27 | Paper |
Cryptographic hardness under projections for time-bounded Kolmogorov complexity
Theoretical Computer Science | 2023-04-20 | Paper |
| scientific article; zbMATH DE number 7650389 (Why is no real title available?) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650418 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7561748 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7515768 (Why is no real title available?) | 2022-04-28 | Paper |
Unexpected hardness results for Kolmogorov complexity under uniform reductions
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| scientific article; zbMATH DE number 7250145 (Why is no real title available?) | 2020-09-22 | Paper |
On nonadaptive reductions to the set of random strings and its dense subsets
Complexity and Approximation | 2020-07-20 | Paper |
| On the average-case complexity of MCSP and its variants | 2020-05-26 | Paper |
| scientific article; zbMATH DE number 7204388 (Why is no real title available?) | 2020-05-26 | Paper |
New insights on the (non-)hardness of circuit minimization and related problems
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Beyond Natural Proofs: Hardness Magnification and Locality
(available as arXiv preprint) | 2019-11-19 | Paper |
Virtual machine placement for minimizing connection cost in data center networks
Discrete Optimization | 2018-05-24 | Paper |
On characterizations of randomized computation using plain Kolmogorov complexity
Computability | 2018-03-16 | Paper |
Identifying an honest \(\mathrm{EXP}^{\mathrm{NP}}\) oracle among many
(available as arXiv preprint) | 2018-01-24 | Paper |
| Limits of minimum circuit size problem as oracle | 2017-10-10 | Paper |
On characterizations of randomized computation using plain Kolmogorov complexity
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
