Buhrman, H. M., Fortnow, L., & Torenvliet, L. (1995). Using autoreducibility in separating complexity classes. In Proc. 36d IEEE Symposium on foundations of Computer Science (pp. 520-527).
Fischer, S. T., & Torenvliet, L. (1995). The Malleability of TSP$_{\mathord{\rm 2OPT}}$. In Proceedings of WG 95, Springer Lecture Notes in Computer Science (pp. 152-166).
Buhrman, H. M., & Torenvliet, L. (1994). On the structure of complete sets. In U. Schoening (Ed.), Proc. Structure in Complexity Theory, 9th annual conference (pp. 118-133). IEEE Computer Society Press.
Buhrman, H. M., & Torenvliet, L. (1994). On the cutting edge of relativization: The resource bounded injury method. In E. Shamir, & S. Abiteboul (Eds.), Proc. ICALP 94 (pp. 263-273). (Lecture Notes in Computer Science; No. 820). Springer Verlag.
Denny-Brown, D., Han, Y., Hemaspaandra, L., & Torenvliet, L. (1994). Semi-Membership Algorithms: Some Recent Advances. SIGACT News, 25(3), 12-23.
Stokhof, M. J. B., & Torenvliet, L. (1990). Proceedings of the Seventh Amsterdam Colloquium, December 19-22, 1989. (Proceedings of the Amsterdam Colloquium; No. 7). ITLI, Institute for Language, Logic and Information, Universiteit van Amsterdam.
