Leen Torenvliet

Full Name

Dr. L. Torenvliet

Email

Leen.Torenvliet@cwi.nl

Department(s)

Algorithms and Complexity

Function(s)

Researcher

Leen Torenvliet

Witteveen, J., Bottesch, R., & Torenvliet, L. (2019). A Hierarchy of Polynomial Kernels. In 45th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2019. doi:10.1007/978-3-030-10801-4
Buhrman, H., Torenvliet, L., Unger, F., & Vereshchagin, N. K. (2018). Sparse Selfreducible Sets and Nonuniform Lower Bounds. Algorithmica, 81, 179–200. doi:10.1007/s00453-018-0439-0
Romijn, L., Ó Nualláin, B., & Torenvliet, L. (2015). Discovering Motifs in Real-World Social Networks.
Buhrman, H., Loff Barreto, B. S., & Torenvliet, L. (2015). Hardness of Approximation for Knapsack Problems. Theory of Computing Systems, 56(2), 372–393. doi:10.1007/s00224-014-9550-z
Terwijn, S. A., Torenvliet, L., & Vitányi, P. (2011). Nonapproximability of the normalized information distance. Journal of Computer and System Sciences, 77(4), 738–742.
Buhrman, H., Hescott, B., Homer, S., & Torenvliet, L. (2010). Non-Uniform Reductions. Theory of Computing Systems, 47(2), 143–156.
Beigel, R., Buhrman, H., Feijer, P., Fortnow, L., Grabowski, L. R., Longpré, L., … Torenvliet, L. (2006). Enumerations of the Kolmogorov function. Journal of Symbolic Logic, 7(2), 501–528.
Buhrman, H., Torenvliet, L., & Unger, F. (2006). Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. In Proceedings of International Symposium on Theoretical Aspects of Computer Science 2006 (pp. 455–468).
Buhrman, H., & Torenvliet, L. (2005). A Post’s Program for Complexity Theory. Bulletin of the EATCS, 85, 41–51.
Buhrman, H., Fenner, S., Fortnow, L., & Torenvliet, L. (2001). Two oracles that force a big crunch. Computational Complexity, 10(2), 93–116.