Jakob Bæk Tejs Knudsen
Title
Cited by
Cited by
Year
Oblivious sketching of high-degree polynomial kernels
TD Ahle, M Kapralov, JBT Knudsen, R Pagh, A Velingker, DP Woodruff, ...
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
352020
Almost optimal tensor sketch
TD Ahle, JBT Knudsen
arXiv preprint arXiv:1909.01821, 2019
72019
Subsets and supermajorities: Optimal hashing-based set similarity search
TD Ahle, JBT Knudsen
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
22020
Classifying convex bodies by their contact and intersection graphs
A Aamand, M Abrahamsen, JBT Knudsen, PMR Rasmussen
arXiv preprint arXiv:1902.01732, 2019
22019
On Sums of Monotone Random Integer Variables
A Aamand, N Alon, JBT Knudsen, M Thorup
arXiv preprint arXiv:2104.03721, 2021
12021
Fast hashing with strong concentration bounds
A Aamand, JBT Knudsen, MBT Knudsen, PMR Rasmussen, M Thorup
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
12020
No Repetition: Fast Streaming with Highly Concentrated Hashing
A Aamand, D Das, E Kipouridis, JBT Knudsen, PMR Rasmussen, ...
arXiv preprint arXiv:2004.01156, 2020
12020
Load balancing with dynamic set of balls and bins
A Aamand, JBT Knudsen, M Thorup
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
2021
The Power of Hashing with Mersenne Primes
TD Ahle, JTB Knudsen, M Thorup
arXiv preprint arXiv:2008.08654, 2020
2020
The Power of Hashing with Mersenne Primes
T Dybdahl Ahle, J Tejs Bæk Knudsen, M Thorup
arXiv e-prints, arXiv: 2008.08654, 2020
2020
Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search
TD Ahle, JBT Knudsen
CoRR, 2019
2019
Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search
T Dybdahl Ahle, J Bæk Tejs Knudsen
arXiv e-prints, arXiv: 1904.04045, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–12