1. Proving SAT does not have small circuits with an application to the two queries problem;Journal of Computer and System Sciences;2008-05
2. Consequences of the provability of NP ⊆ P/poly;Journal of Symbolic Logic;2007-12
3. S2p⊆ZPPNP;Journal of Computer and System Sciences;2007-02
4. One Bit of Advice;Lecture Notes in Computer Science;2003
5. On Higher Arthur-Merlin Classes;Lecture Notes in Computer Science;2002