Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 46
Number of items: 46
  • Open Access
    Witteveen, J. E. (2020). Parameterized analysis of complexity. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Buhrman, H., Torenvliet, L., Unger, F., & Vereshchagin, N. (2019). Sparse Selfreducible Sets and Nonuniform Lower Bounds. Algorithmica, 81(1), 179-200. https://doi.org/10.1007/S00453-018-0439-0
  • Open Access
    Witteveen, J., & Torenvliet, L. (2018). Levelable Sets and the Algebraic Structure of Parameterizations. ArXiv. https://arxiv.org/abs/1709.04699
  • Open Access
    Witteveen, J., & Torenvliet, L. (2016). Fixed-parameter decidability: Extending parameterized complexity analysis. Mathematical Logic Quarterly, 62(6), 596-607. https://doi.org/10.1002/malq.201500077
  • Romijn, L., Ó Nualláin, B., & Torenvliet, L. (2015). Discovering motifs in real-world social networks. In G. F. Italiano, T. Margaria-Steffen, J. Pokorný, J.-J. Quisquater, & R. Wattenhofer (Eds.), SOFSEM 2015: Theory and Practice of Computer Science: 41th International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015: proceedings (pp. 463-474). (Lecture Notes in Computer Science ; Vol. 8939). Springer. https://doi.org/10.1007/978-3-662-46078-8_38
  • Open Access
    Buhrman, H., Loff, B., & Torenvliet, L. (2015). Hardness of approximation for Knapsack problems. Theory of Computing Systems, 56(2), 372-393. https://doi.org/10.1007/s00224-014-9550-z
  • Terwijn, S. A., Torenvliet, L., & Vitányi, P. M. B. (2011). Nonapproximability of the normalized information distance. Journal of Computer and System Sciences, 77(4), 738-742. https://doi.org/10.1016/j.jcss.2010.06.018
  • Hemaspaandra, L. A., & Torenvliet, L. (2010). Theory of semi-feasible algorithms. (Monographs in Theoretical Computer Science: an EATCS Series). Springer.
  • Open Access
    Buhrman, H., Hescott, B., Homer, S., & Torenvliet, L. (2010). Non-uniform reductions. Theory of Computing Systems, 47(2), 317-341. https://doi.org/10.1007/s00224-008-9163-5
  • Terwijn, S. A., Torenvliet, L., & Vitányi, P. M. B. (2009). Nonapproximablity of the normalized information distance. Institute for Logic, Language and Computation. http://arxiv.org/abs/0910.4353
Page 1 of 5