Search results

    Filter results

  • Full text

  • Document type

  • Publication year

  • Organisation

Results: 46
Number of items: 46
  • Leskes, B., & Torenvliet, L. (2008). The value of agreement a new boosting algorithm. Journal of Computer and System Sciences, 74(4), 557-586. https://doi.org/10.1016/j.jcss.2007.06.005
  • Hemaspaandra, L., & Torenvliet, L. (2006). P-Selectivity, Immunity, and the power of one bit. Lecture Notes in Computer Science, 3831, 323-331.
  • Beigel, R., Buhrman, H. M., Feijer, P., Fortnow, L., Grabowski, P., Longpre, L., Muchnik, A., Stephan, F., & Torenvliet, L. (2006). Enumerations of the Kolmogorov Function. Journal of Symbolic Logic, 7, 501-528.
  • Buhrman, H. M., Torenvliet, L., & Unger, F. P. (2006). Spare Self-reducible sets and polynomial size circuit lower bounds. In Proceedings of STACS 2006 (pp. 455-468). Springer.
  • Cooper, S. B., Löwe, B., & Torenvliet, L. (2005). New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 2005, Proceedings. (Lecture Notes in Computer Science; No. 3526). Springer.
  • Buhrman, H. M., & Torenvliet, L. (2005). A Post's program for complexity theory. Bulletin of the European Association for Theoretical Computer Science, 85, 41-51.
  • Buhrman, H. M., & Torenvliet, L. (2004). Separating complexity classes using structural properties. In Proceedings 19th Conference on Computational Complexity (pp. 130). IEEE Computer Society Press.
  • Kaart, M., Torenvliet, L., van Best, J. P., & Vree, W. G. (2004). The importance of measurements for Internet policy. In Proc. of the IEEE 2004 International Conference on Systems, Man, and Cybernetics (SMC2004) (pp. 4711)
  • Hemaspaandra, L., & Torenvliet, L. (2002). Theory of Semi-Feasible Algorithms. (EATCS Monographs in Theoretical Computer Science). Springer-Verlag.
  • Ambainis, A., Buhrman, H. M., Gasarch, W. I., Kalayanasundaram, B., & Torenvliet, L. (2001). The communication complexity of enumeration, elimination and selection. Journal of Computer and System Sciences, 63(2), 148-184. https://doi.org/10.1006/jcss.2001.1761
Page 2 of 5