1. Algorithmic randomness and measures of complexity
2. Quantum Complexity Theory
3. Quantum Kolmogorov Complexity
4. P. Boykin, T. Mor, M. Pulver, V. Roychowdhury and F. Vatan. On universal and fault-tolerant quantum computing. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 486–494, 1999.
5. R. Canetti, I. Damgård, S. Dziembowski, Y. Ishai and T. Malkin. On adaptive vs. non-adaptive security of multiparty protocols. In B. Pfitzmann, editor In Proceedings of Advances in Cryptology - EUROCRYPT 2001, vol. 2045 of Lecture Notes in Computer Science, pp. 262–279. Springer, 2001.