Jakob Bæk Tejs Houen

According to our database, Jakob Bæk Tejs Houen authored at least 15 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Simple Set Sketching.

Jakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing.

Jakob Bæk Tejs Houen, Mikkel Thorup

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Locally Uniform Hashing.

Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Bias Reduction for Sum Estimation.

Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek

Proceedings of the Approximation, 2023

2022

No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing.

Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup

Proc. VLDB Endow., 2022

Daisy Bloom Filters.

Ioana O. Bercea, Jakob Bæk Tejs Houen, Rasmus Pagh

CoRR, 2022

Understanding the Moments of Tabulation Hashing via Chaoses.

Jakob Bæk Tejs Houen, Mikkel Thorup

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Load balancing with dynamic set of balls and bins.

Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Classifying Convex Bodies by Their Contact and Intersection Graphs.

Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

The Power of Hashing with Mersenne Primes.

Thomas Dybdahl Ahle, Jakob Bæk Tejs Knudsen, Mikkel Thorup

CoRR, 2020

No Repetition: Fast Streaming with Highly Concentrated Hashing.

Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup

CoRR, 2020

Fast hashing with strong concentration bounds.

Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Oblivious Sketching of High-Degree Polynomial Kernels.

Thomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search.

Thomas D. Ahle, Jakob Bæk Tejs Knudsen

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Almost Optimal Tensor Sketch.

Thomas D. Ahle, Jakob Bæk Tejs Knudsen

CoRR, 2019