Generating k-Independent Variables in Constant Time. - Tobias Christiani; Rasmus Pagh (FOCS, 2014)

From Independence to Expansion and Back Again. - Tobias Christiani; Rasmus Pagh; Mikkel Thorup (STOC, 2015)

A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering. - Tobias Christiani (SODA, 2017)

Set similarity search beyond MinHash. - Tobias Christiani; Rasmus Pagh (STOC, 2017)

Fast Locality-Sensitive Hashing for Approximate Near Neighbor Search. - Tobias Christiani (CoRR, 2017)

Scalable and Robust Set Similarity Join. - Tobias Christiani; Rasmus Pagh; Johan Sivertsen (ICDE, 2018)

Distance-Sensitive Hashing. - Martin Aumüller 001; Tobias Christiani; Rasmus Pagh; Francesco Silvestri 001 (PODS, 2018)

Optimal Boolean Locality-Sensitive Hashing. - Tobias Christiani (CoRR, 2018)

PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors. - Martin Aumüller 001; Tobias Christiani; Rasmus Pagh; Michael Vesterli (ESA, 2019)

Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search. - Tobias Christiani (SISAP, 2019)

Algorithms for Similarity Search and Pseudorandomness. - Tobias Christiani (CoRR, 2019)

Confirmation Sampling for Exact Nearest Neighbor Search. - Tobias Christiani; Rasmus Pagh; Mikkel Thorup (SISAP, 2020)

DartMinHash: Fast Sketching for Weighted Sets. - Tobias Christiani (CoRR, 2020)