1. Polynomial-Time Random Oracles and Separating Complexity Classes;ACM Transactions on Computation Theory;2021-03
2. Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly;ACM Transactions on Computation Theory;2015-09-11
3. Bibliography;Theory of Computational Complexity;2013-12-06
4. Tradeoff lower lounds for stack machines;computational complexity;2013-01-08
5. Proof systems that take advice;Information and Computation;2011-03