Jakob Bæk Tejs Houen
Ph.d.-fellow
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
- 2022
- Published
Understanding the Moments of Tabulation Hashing via Chaoses
Houen, Jakob Bæk Tejs & Thorup, Mikkel, Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-19 74. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 229).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
On sums of monotone random integer variables
Aamand, A., Alon, N., Houen, Jakob Bæk Tejs & Thorup, Mikkel, 2022, In: Electronic Communications in Probability. 27, p. 1-8 64.Research output: Contribution to journal › Journal article › peer-review
- 2021
- Published
Classifying convex bodies by their contact and intersection graphs
Aamand, A., Abrahamsen, Mikkel, Houen, Jakob Bæk Tejs & Rasmussen, Peter Michael Reichstein, 2021, 37th International Symposium on Computational Geometry, SoCG 2021. Buchin, K. & de Verdiere, E. C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16 p. 3. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 189).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2020
- Published
Fast hashing with strong concentration bounds
Aamand, A., Houen, 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 proceeding › Article in proceedings › Research › peer-review
- Published
- Published
Oblivious sketching of high-degree polynomial kernels
Ahle, T. D., Kapralov, M., Houen, 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 proceeding › Article in proceedings › Research › peer-review
- Published
Subsets and supermajorities: Optimal hashing-based set similarity search
Ahle, T. D. & Houen, 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 proceeding › Article in proceedings › Research › peer-review
ID: 148243909
Most downloads
-
64
downloads
Fast hashing with strong concentration bounds
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
36
downloads
No Repetition: Fast Streaming with Highly Concentrated Hashing
Research output: Working paper › Research
Published -
23
downloads
Oblivious sketching of high-degree polynomial kernels
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published