Jakob Bæk Tejs Knudsen

Jakob Bæk Tejs Knudsen

Research assistant


Publication year:
  1. 2021
  2. In preparation
  3. 2020
  4. Published

    Fast hashing with strong concentration bounds

    Aamand, Anders, Knudsen, Jakob Bæk Tejs, Knudsen, M. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1265-1278 (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  5. Published

    Oblivious sketching of high-degree polynomial kernels

    Ahle, T. D., Kapralov, M., Knudsen, Jakob Bæk Tejs, Pagh, R., Velingker, A., Woodruff, D. P. & Zandieh, A., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 141-160 20 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  6. Published

    Subsets and supermajorities: Optimal hashing-based set similarity search

    Ahle, T. D. & Knudsen, Jakob Bæk Tejs, 2020, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE, p. 728-739 9317929. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, Vol. 2020-November).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

ID: 148243909