Rasmus Pagh

According to our database1, Rasmus Pagh authored at least 92 papers between 1999 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Similarity Sketching.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Hardness of Bichromatic Closest Pair with Jaccard Similarity.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

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

2018
Enumerating Trillion Subgraphs On Distributed Systems.
TKDD, 2018

CoveringLSH: Locality-Sensitive Hashing without False Negatives.
ACM Trans. Algorithms, 2018

Simple multi-party set reconciliation.
Distributed Computing, 2018

Set Similarity Search for Skewed Data.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 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
Approximate furthest neighbor with application to annulus query.
Inf. Syst., 2017

Theory and Applications of Hashing (Dagstuhl Seminar 17181).
Dagstuhl Reports, 2017

Efficiently Correcting Matrix Products.
Algorithmica, 2017

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

Distance Sensitive Bloom Filters Without False Negatives.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Parameter-free Locality Sensitive Hashing for Spherical Range Reporting.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Hardness and Approximation of High-Dimensional Search Problems (Invited Talk).
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Cuckoo Hashing.
Encyclopedia of Algorithms, 2016

Triangle Counting in Dynamic Graph Streams.
Algorithmica, 2016

Locality-sensitive Hashing without False Negatives.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

On the Complexity of Inner Product Similarity Join.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Scalability and Total Recall with Fast CoveringLSH.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

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

Approximate Range Emptiness in Constant Time and Optimal Space.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Approximate Furthest Neighbor in High Dimensions.
Proceedings of the Similarity Search and Applications - 8th International Conference, 2015

Large-Scale Similarity Joins With Guarantees (Invited Talk).
Proceedings of the 18th International Conference on Database Theory, 2015

I/O-Efficient Similarity Join.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Thresholds for Extreme Orientability.
Algorithmica, 2014

Efficient estimation for high similarities using odd sketches.
Proceedings of the 23rd International World Wide Web Conference, 2014

Triangle Counting in Dynamic Graph Streams.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Consistent Subset Sampling.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Is min-wise hashing optimal for summarizing set intersection?
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

The input/output complexity of triangle enumeration.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Listing Triangles.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

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

The Input/Output Complexity of Sparse Matrix Multiplication.
Proceedings of the Algorithms - ESA 2014, 2014

MapReduce Triangle Enumeration With Guarantees.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

2013
Practical perfect hashing in nearly optimal space.
Inf. Syst., 2013

On the streaming complexity of computing local clustering coefficients.
Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Fast and scalable polynomial kernels via explicit feature maps.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

How to Approximate a Set without Knowing Its Size in Advance.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

On parallelizing matrix multiplication by the column-row method.
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012
Colorful triangle counting and a MapReduce implementation.
Inf. Process. Lett., 2012

I/O-efficient data structures for colored range and prefix reporting.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Compressed matrix multiplication.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Linear Probing with 5-wise Independence.
SIAM Review, 2011

Theory and practice of monotone minimal perfect hashing.
ACM Journal of Experimental Algorithmics, 2011

A New Data Layout for Set Intersection on GPUs.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Frequent Pairs in Data Streams: Exploiting Parallelism and Skew.
Proceedings of the Data Mining Workshops (ICDMW), 2011

2010
Cache-oblivious hashing.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

On Finding Similar Items in a Stream of Transactions.
Proceedings of the ICDMW 2010, 2010

On Finding Frequent Patterns in Event Sequences.
Proceedings of the ICDM 2010, 2010

Tight Thresholds for Cuckoo Hashing via XORSAT.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Fast Prefix Search in Little Space, with Applications.
Proceedings of the Algorithms, 2010

Better Size Estimation for Sparse Matrix Products.
Proceedings of the Approximation, 2010

2009
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Secondary indexing in one dimension: beyond b-trees and bitmap indexes.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Faster join-projects and sparse matrix multiplications.
Proceedings of the Database Theory, 2009

Finding Associations and Computing Similarity via Biased Pair Sampling.
Proceedings of the ICDM 2009, 2009

Storing a Compressed Function with Constant Time Access.
Proceedings of the Algorithms, 2009

Theory and Practise of Monotone Minimal Perfect Hashing.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Cuckoo Hashing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Uniform Hashing in Constant Time and Optimal Space.
SIAM J. Comput., 2008

Optimality in External Memory Hashing.
Algorithmica, 2008

Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Simple and Space-Efficient Minimal Perfect Hash Functions.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Linear probing with constant independence.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Fast Evaluation of Union-Intersection Expressions.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
External String Sorting: Faster and Cache-Oblivious.
Proceedings of the STACS 2006, 2006

Deterministic load balancing and dictionaries in the parallel disk model.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Scalable computation of acyclic joins.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
On dynamic range reporting in one dimension.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

An optimal Bloom filter replacement.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
On Adaptive Integer Sorting.
Proceedings of the Algorithms, 2004

2003
Uniform hashing in constant time and linear space.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Space Efficient Hash Tables with Worst Case Constant Access Time.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002
Optimal time-space trade-offs for non-comparison-based sorting.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

One-Probe Search.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Basic External Memory Data Structures.
Proceedings of the Algorithms for Memory Hierarchies, 2002

2001
Low Redundancy in Static Dictionaries with Constant Query Time.
SIAM J. Comput., 2001

Deterministic Dictionaries.
J. Algorithms, 2001

On the cell probe complexity of membership and perfect hashing.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Lossy Dictionaries.
Proceedings of the Algorithms, 2001

Cuckoo Hashing.
Proceedings of the Algorithms, 2001

2000
A Trade-Off for Worst-Case Efficient Dictionaries.
Nord. J. Comput., 2000

A New Trade-Off for Deterministic Dictionaries.
Proceedings of the Algorithm Theory, 2000

Faster deterministic dictionaries.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Dispersing Hash Functions.
Proceedings of the ICALP Workshops 2000, 2000

1999
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time.
Proceedings of the Automata, 1999


  Loading...