1. Computing with a full memory;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31
2. On the power of unambiguity in log-space;computational complexity;2012-09-25
3. Circuits over PP and PL;Journal of Computer and System Sciences;2000-04
4. Verifying the determinant in parallel;Computational Complexity;1998-11
5. NondeterministicNC1Computation;Journal of Computer and System Sciences;1998-10