1. RSA and Rabin functions: Certain parts are as hard as the whole;Alexi;SIAM Journal on Computing,1988
2. A. Ambainis and R. Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. In Proceedings of the 38th IEEE Symposium, on Foundations of Computer Science, pages 332-341, 1998.
3. Simple constructions of almost k-wise independent random variables;Alon;Random Structures and Algorithms,1992
4. M. Ajtai, J. Kornlós, and E. Szemerédi. Deterministic simulation in LOGSPACE. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 132-140, 1987.
5. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 14–23, 1992.