1. Cellular Automata: Communication Matters;Lecture Notes in Computer Science;2024
2. Polynomial-Time Random Oracles and Separating Complexity Classes;ACM Transactions on Computation Theory;2021-03
3. Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly;ACM Transactions on Computation Theory;2015-09-11
4. Bibliography;Theory of Computational Complexity;2013-12-06
5. Tradeoff lower lounds for stack machines;computational complexity;2013-01-08