Follow
Jakob Bæk Tejs Houen
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
702020
Almost optimal tensor sketch
TD Ahle, JBT Knudsen
arXiv preprint arXiv:1909.01821, 2019
102019
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
4*2020
Classifying convex bodies by their contact and intersection graphs
A Aamand, M Abrahamsen, JBT Knudsen, PMR Rasmussen
arXiv preprint arXiv:1902.01732, 2019
42019
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
32021
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
22020
On Sums of Monotone Random Integer Variables
A Aamand, N Alon, JBT Knudsen, M Thorup
arXiv preprint arXiv:2104.03721, 2021
12021
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
Simple Set Sketching
JBT Houen, R Pagh, S Walzer
arXiv preprint arXiv:2211.03683, 2022
2022
Bias Reduction for Sum Estimation
T Eden, JBT Houen, S Narayanan, W Rosenbaum, J Tětek
arXiv preprint arXiv:2208.01197, 2022
2022
Daisy Bloom Filters
IO Bercea, JBT Houen, R Pagh
arXiv preprint arXiv:2205.14894, 2022
2022
Understanding the Moments of Tabulation Hashing via Chaoses
JBT Houen, M Thorup
arXiv preprint arXiv:2205.01453, 2022
2022
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
The system can't perform the operation now. Try again later.
Articles 1–13