Tobias Christiani

Orcid: 0000-0002-3629-1562

According to our database1, Tobias Christiani authored at least 13 papers between 2014 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
DartMinHash: Fast Sketching for Weighted Sets.
CoRR, 2020

Confirmation Sampling for Exact Nearest Neighbor Search.
Proceedings of the Similarity Search and Applications - 13th International Conference, 2020

2019
Algorithms for Similarity Search and Pseudorandomness.
CoRR, 2019

Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search.
Proceedings of the Similarity Search and Applications - 12th International Conference, 2019

PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Optimal Boolean Locality-Sensitive Hashing.
CoRR, 2018

Distance-Sensitive Hashing.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Scalable and Robust Set Similarity Join.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017
Fast Locality-Sensitive Hashing for Approximate Near Neighbor Search.
CoRR, 2017

Set similarity search beyond MinHash.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2015
From Independence to Expansion and Back Again.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Generating k-Independent Variables in Constant Time.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014


  Loading...