1. Algorithms for black box fields and their application to cryptography;Boneh,1996
2. A uniform approach to define complexity classes;Bovet;Theoretical Computer Science,1992
3. Bounded Arithmetic;Buss,1986
4. Countable models of set theories;Friedman,1973
5. Dual weak pigeonhole principle, boolean complexity and derandomization;Jeřábek;Annals of Pure and Applied Logic,2004