| 2025 | ICML | Lightweight Protocols for Distributed Private Quantile Estimation. | Anders Aamand, Fabrizio Boninsegna, Abigail Gentle, Jacob Imola, Rasmus Pagh |
| 2025 | ICML | Private Lossless Multiple Release. | Joel Daniel Andersson, Lukas Retschmeier, Boel Nelson, Rasmus Pagh |
| 2024 | ICALP | Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. | Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir |
| 2024 | ICML | Profile Reconstruction from Private Sketches. | Hao Wu, Rasmus Pagh |
| 2024 | WWW | Differentially Private Selection from Secure Distributed Computing. | Ivan Damgrd, Hannah Keller, Boel Nelson, Claudio Orlandi, Rasmus Pagh |
| 2024 | SODA | Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential Privacy. | David Rasmussen Lolck, Rasmus Pagh |
| 2023 | FOCS | Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. | Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff |
| 2022 | AISTATS | DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search. | Matti Karppa, Martin Aumller, Rasmus Pagh |
| 2022 | ALT | Infinitely Divisible Noise in the Low Privacy Regime. | Rasmus Pagh, Nina Mesing Stausholm |
| 2022 | KDD | HyperLogLogLog: Cardinality Estimation With One Log More. | Matti Karppa, Rasmus Pagh |
| 2021 | CCS | Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access. | Martin Aumller, Christian Janos Lebeda, Rasmus Pagh |
| 2021 | EuroCrypt | On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy. | Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, Ameya Velingker |
| 2021 | ICDT | Efficient Differentially Private F₀ Linear Sketching. | Rasmus Pagh, Nina Mesing Stausholm |
| 2021 | ICML | Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message. | Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Amer Sinha |
| 2021 | ICML | CountSketches, Feature Hashing and the Median of Three. | Kasper Green Larsen, Rasmus Pagh, Jakub Tetek |
| 2021 | PODS | 2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award. | Angela Bonifati, Rasmus Pagh, Thomas Schwentick |
| 2020 | EuroCrypt | Private Aggregation from Fewer Anonymous Messages. | Badih Ghazi, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker |
| 2020 | ICDT | The Space Complexity of Inner Product Filters. | Rasmus Pagh, Johan Sivertsen |
| 2020 | ICML | Composable Sketches for Functions of Frequencies: Beyond the Worst Case. | Edith Cohen, Ofir Geri, Rasmus Pagh |
| 2020 | ICML | Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead. | Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh |
| 2020 | PODS | Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. | Martin Aumller, Rasmus Pagh, Francesco Silvestri |
| 2020 | PODS | On the I/O Complexity of the k-Nearest Neighbors Problem. | Mayank Goswami, Riko Jacob, Rasmus Pagh |
| 2020 | SODA | Oblivious Sketching of High-Degree Polynomial Kernels. | Thomas D. Ahle, Michael Kapralov, Jakob Bk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh |
| 2020 | SISAP | Confirmation Sampling for Exact Nearest Neighbor Search. | Tobias Christiani, Rasmus Pagh, Mikkel Thorup |
| 2019 | ESA | PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors. | Martin Aumller, Tobias Christiani, Rasmus Pagh, Michael Vesterli |
| 2019 | ESA | Hardness of Bichromatic Closest Pair with Jaccard Similarity. | Rasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup |
| 2019 | ICDM | Space-Efficient Feature Maps for String Alignment Kernels. | Yasuo Tabei, Yoshihiro Yamanishi, Rasmus Pagh |
| 2018 | ICDE | Scalable and Robust Set Similarity Join. | Tobias Christiani, Rasmus Pagh, Johan Sivertsen |
| 2018 | PODS | Distance-Sensitive Hashing. | Martin Aumller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri |
| 2018 | PODS | Set Similarity Search for Skewed Data. | Samuel McCauley, Jesper W. Mikkelsen, Rasmus Pagh |
| 2017 | ISAAC | Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons. | Joachim Gudmundsson, Rasmus Pagh |
| 2017 | MFCS | Hardness and Approximation of High-Dimensional Search Problems (Invited Talk). | Rasmus Pagh |
| 2017 | SODA | Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. | Thomas D. Ahle, Martin Aumller, Rasmus Pagh |
| 2017 | SODA | Distance Sensitive Bloom Filters Without False Negatives. | Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen |
| 2017 | STOC | Set similarity search beyond MinHash. | Tobias Christiani, Rasmus Pagh |
| 2016 | CIKM | Scalability and Total Recall with Fast CoveringLSH. | Ninh Pham, Rasmus Pagh |
| 2016 | PODS | On the Complexity of Inner Product Similarity Join. | Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri |
| 2016 | SODA | Locality-sensitive Hashing without False Negatives. | Rasmus Pagh |
| 2015 | ESA | I/O-Efficient Similarity Join. | Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stckel |
| 2015 | ICDT | Large-Scale Similarity Joins With Guarantees (Invited Talk). | Rasmus Pagh |
| 2015 | SODA | Approximate Range Emptiness in Constant Time and Optimal Space. | Mayank Goswami, Allan Grnlund Jrgensen, Kasper Green Larsen, Rasmus Pagh |
| 2015 | STOC | From Independence to Expansion and Back Again. | Tobias Christiani, Rasmus Pagh, Mikkel Thorup |
| 2015 | SISAP | Approximate Furthest Neighbor in High Dimensions. | Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala |
| 2014 | CIKM | MapReduce Triangle Enumeration With Guarantees. | Ha-Myung Park, Francesco Silvestri, U Kang, Rasmus Pagh |
| 2014 | ESA | The Input/Output Complexity of Sparse Matrix Multiplication. | Rasmus Pagh, Morten Stckel |
| 2014 | FOCS | Generating k-Independent Variables in Constant Time. | Tobias Christiani, Rasmus Pagh |
| 2014 | ICALP | Listing Triangles. | Andreas Bjrklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick |
| 2014 | PODS | The input/output complexity of triangle enumeration. | Rasmus Pagh, Francesco Silvestri |
| 2014 | PODS | Is min-wise hashing optimal for summarizing set intersection? | Rasmus Pagh, Morten Stckel, David P. Woodruff |
| 2014 | WWW | Efficient estimation for high similarities using odd sketches. | Michael Mitzenmacher, Rasmus Pagh, Ninh Pham |
| 2013 | ALENEX | On parallelizing matrix multiplication by the column-row method. | Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh |
| 2013 | FOCS | How to Approximate a Set without Knowing Its Size in Advance. | Rasmus Pagh, Gil Segev, Udi Wieder |
| 2013 | KDD | Fast and scalable polynomial kernels via explicit feature maps. | Ninh Pham, Rasmus Pagh |
| 2013 | WSDM | On the streaming complexity of computing local clustering coefficients. | Konstantin Kutzkov, Rasmus Pagh |
| 2012 | KDD | A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data. | Ninh Pham, Rasmus Pagh |
| 2012 | SODA | I/O-efficient data structures for colored range and prefix reporting. | Kasper Green Larsen, Rasmus Pagh |
| 2011 | ICDM | Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. | Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh |
| 2010 | ESA | Fast Prefix Search in Little Space, with Applications. | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna |
| 2010 | ICALP | Tight Thresholds for Cuckoo Hashing via XORSAT. | Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink |
| 2010 | ICDM | On Finding Frequent Patterns in Event Sequences. | Andrea Campagna, Rasmus Pagh |
| 2010 | ICDM | On Finding Similar Items in a Stream of Transactions. | Andrea Campagna, Rasmus Pagh |
| 2010 | PODS | Cache-oblivious hashing. | Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang |
| 2009 | ALENEX | Theory and Practise of Monotone Minimal Perfect Hashing. | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna |
| 2009 | ESA | Storing a Compressed Function with Constant Time Access. | Jhannes B. Hreinsson, Morten Kryer, Rasmus Pagh |
| 2009 | ICDM | Finding Associations and Computing Similarity via Biased Pair Sampling. | Andrea Campagna, Rasmus Pagh |
| 2009 | ICDT | Faster join-projects and sparse matrix multiplications. | Rasmus Resen Amossen, Rasmus Pagh |
| 2009 | PODS | Secondary indexing in one dimension: beyond b-trees and bitmap indexes. | Rasmus Pagh, Srinivasa Rao Satti |
| 2009 | SODA | Monotone minimal perfect hashing: searching a sorted table with | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna |
| 2008 | ICALP | Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). | Martin Dietzfelbinger, Rasmus Pagh |
| 2007 | ISAAC | Fast Evaluation of Union-Intersection Expressions. | Philip Bille, Anna Pagh, Rasmus Pagh |
| 2007 | STOC | Linear probing with constant independence. | Anna Pagh, Rasmus Pagh, Milan Ruzic |
| 2007 | WADS | Simple and Space-Efficient Minimal Perfect Hash Functions. | Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani |
| 2006 | LATIN | De Dictionariis Dynamicis Pauco Spatio Utentibus ( | Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu |
| 2006 | PODS | Scalable computation of acyclic joins. | Anna Pagh, Rasmus Pagh |
| 2006 | STACS | External String Sorting: Faster and Cache-Oblivious. | Rolf Fagerberg, Anna Pagh, Rasmus Pagh |
| 2006 | SPAA | Deterministic load balancing and dictionaries in the parallel disk model. | Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann |
| 2005 | SODA | An optimal Bloom filter replacement. | Anna Pagh, Rasmus Pagh, S. Srinivasa Rao |
| 2005 | STOC | On dynamic range reporting in one dimension. | Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu |
| 2004 | ESA | On Adaptive Integer Sorting. | Anna Pagh, Rasmus Pagh, Mikkel Thorup |
| 2003 | STOC | Uniform hashing in constant time and linear space. | Anna stlin, Rasmus Pagh |
| 2003 | STACS | Space Efficient Hash Tables with Worst Case Constant Access Time. | Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis |
| 2002 | ICALP | One-Probe Search. | Anna stlin, Rasmus Pagh |
| 2002 | SODA | Optimal time-space trade-offs for non-comparison-based sorting. | Rasmus Pagh, Jakob Pagter |
| 2001 | ESA | Cuckoo Hashing. | Rasmus Pagh, Flemming Friche Rodler |
| 2001 | ESA | Lossy Dictionaries. | Rasmus Pagh, Flemming Friche Rodler |
| 2001 | STOC | On the cell probe complexity of membership and perfect hashing. | Rasmus Pagh |
| 2000 | ICALP | Dispersing Hash Functions. | Rasmus Pagh |
| 2000 | SODA | Faster deterministic dictionaries. | Rasmus Pagh |
| 1999 | ICALP | Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. | Rasmus Pagh |
| 1999 | WADS | Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. | Rasmus Pagh |