Rasmus Pagh - RankMe

246 papers A* 55A 25B 11Journal 132Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	DP-λCGD: Efficient Noise Correlation for Differentially Private Model Training. CoRR Nikita P. Kalinin, Ryan McKenna, Rasmus Pagh, Christoph H. Lampert
2026	J	`jnl`	Sublime: Sublinear Error & Space for Unbounded Skewed Streams. CoRR Navid Eslami, Ioana O. Bercea, Rasmus Pagh, Niv Dayan
2025	—	`ed.`	2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13-15, 2025 SOSA Ioana Oriana Bercea, Rasmus Pagh
2025	—	`conf`	Count on Your Elders: Laplace vs Gaussian Noise. FORC Joel Daniel Andersson, Rasmus Pagh, Teresa Anna Steiner, Sahel Torkamani
2025	J	`jnl`	Differentially Private Quantiles with Smaller Error. CoRR Jacob Imola, Fabrizio Boninsegna, Hannah Keller, Anders Aamand, Amrita Roy Chowdhury, Rasmus Pagh
2025	A*	`conf`	Lightweight Protocols for Distributed Private Quantile Estimation. ICML Anders Aamand, Fabrizio Boninsegna, Abigail Gentle, Jacob Imola, Rasmus Pagh
2025	J	`jnl`	Lightweight Protocols for Distributed Private Quantile Estimation. CoRR Anders Aamand, Fabrizio Boninsegna, Abigail Gentle, Jacob Imola, Rasmus Pagh
2025	J	`jnl`	Modern Minimal Perfect Hashing: A Survey. CoRR Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh, Giulio Ermanno Pibiri, Peter Sanders, Sebastiano Vigna, Stefan Walzer
2025	J	`jnl`	Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation. Proc. ACM Manag. Data Rasmus Pagh, Lukas Retschmeier, Hao Wu, Hanwen Zhang
2025	J	`jnl`	Piquantϵ: Private Quantile Estimation in the Two-Server Model. CoRR Hannah Keller, Jacob Imola, Fabrizio Boninsegna, Rasmus Pagh, Amrita Roy Chowdhury
2025	A*	`conf`	Private Lossless Multiple Release. ICML Joel Daniel Andersson, Lukas Retschmeier, Boel Nelson, Rasmus Pagh
2025	J	`jnl`	Private Lossless Multiple Release. CoRR Joel Daniel Andersson, Lukas Retschmeier, Boel Nelson, Rasmus Pagh
2025	—	`conf`	Streaming Private Continual Counting via Binning. SaTML Joel Daniel Andersson, Rasmus Pagh
2025	J	`jnl`	Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation. CoRR Ninh Pham, Rasmus Pagh
2024	J	`jnl`	Aleph Filter: To Infinity in Constant Time. CoRR Niv Dayan, Ioana O. Bercea, Rasmus Pagh
2024	J	`jnl`	Aleph Filter: To Infinity in Constant Time. Proc. VLDB Endow. Niv Dayan, Ioana Oriana Bercea, Rasmus Pagh
2024	A*	`conf`	Continual Counting with Gradual Privacy Expiration. NeurIPS Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay
2024	J	`jnl`	Continual Counting with Gradual Privacy Expiration. CoRR Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay
2024	—	`conf`	Daisy Bloom Filters. SWAT Ioana O. Bercea, Jakob Bæk Tejs Houen, Rasmus Pagh
2024	A*	`conf`	Differentially Private Selection from Secure Distributed Computing. WWW Ivan Damgård, Hannah Keller, Boel Nelson, Claudio Orlandi, Rasmus Pagh
2024	J	`jnl`	Faster Private Minimum Spanning Trees. CoRR Rasmus Pagh, Lukas Retschmeier
2024	J	`jnl`	Improved Counting under Continual Observation with Pure Differential Privacy. CoRR Joel Daniel Andersson, Rasmus Pagh, Sahel Torkamani
2024	J	`jnl`	Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation. CoRR Rasmus Pagh, Lukas Retschmeier, Hao Wu, Hanwen Zhang
2024	A*	`conf`	Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. ICALP Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir
2024	J	`jnl`	PLAN: Variance-Aware Private Mean Estimation. Proc. Priv. Enhancing Technol. Martin Aumüller, Christian Janos Lebeda, Boel Nelson, Rasmus Pagh
2024	A*	`conf`	Profile Reconstruction from Private Sketches. ICML Hao Wu, Rasmus Pagh
2024	J	`jnl`	Profile Reconstruction from Private Sketches. CoRR Hao Wu, Rasmus Pagh
2024	A*	`conf`	Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential Privacy. SODA David Rasmussen Lolck, Rasmus Pagh
2024	J	`jnl`	Streaming Private Continual Counting via Binning. CoRR Joel Daniel Andersson, Rasmus Pagh
2023	A*	`conf`	A Smooth Binary Mechanism for Efficient Private Continual Observation. NeurIPS Joel Daniel Andersson, Rasmus Pagh
2023	J	`jnl`	A Smooth Binary Mechanism for Efficient Private Continual Observation. CoRR Joel Daniel Andersson, Rasmus Pagh
2023	J	`jnl`	Differentially Private Selection from Secure Distributed Computing. CoRR Ivan Damgård, Hannah Keller, Boel Nelson, Claudio Orlandi, Rasmus Pagh
2023	J	`jnl`	Differentially Private Selection from Secure Distributed Computing. IACR Cryptol. ePrint Arch. Ivan Damgård, Hannah Keller, Boel Nelson, Claudio Orlandi, Rasmus Pagh
2023	J	`jnl`	InfiniFilter: Expanding Filters to Infinity and Beyond. Proc. ACM Manag. Data Niv Dayan, Ioana O. Bercea, Pedro Reviriego, Rasmus Pagh
2023	J	`jnl`	Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. CoRR Kasper Green Larsen, Rasmus Pagh, Toniann Pitassi, Or Zamir
2023	J	`jnl`	PLAN: Variance-Aware Private Mean Estimation. CoRR Martin Aumüller, Christian Janos Lebeda, Boel Nelson, Rasmus Pagh
2023	A*	`conf`	Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. FOCS Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff
2023	J	`jnl`	Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. CoRR Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff
2023	J	`jnl`	Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential Privacy. CoRR David Rasmussen Lolck, Rasmus Pagh
2023	—	`conf`	Simple Set Sketching. SOSA Jakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer
2022	A	`conf`	DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search. AISTATS Matti Karppa, Martin Aumüller, Rasmus Pagh
2022	J	`jnl`	Daisy Bloom Filters. CoRR Ioana O. Bercea, Jakob Bæk Tejs Houen, Rasmus Pagh
2022	A*	`conf`	HyperLogLogLog: Cardinality Estimation With One Log More. KDD Matti Karppa, Rasmus Pagh
2022	J	`jnl`	HyperLogLogLog: Cardinality Estimation With One Log More. CoRR Matti Karppa, Rasmus Pagh
2022	A*	`conf`	Improved Utility Analysis of Private CountSketch. NeurIPS Rasmus Pagh, Mikkel Thorup
2022	J	`jnl`	Improved Utility Analysis of Private CountSketch. CoRR Rasmus Pagh, Mikkel Thorup
2022	B	`conf`	Infinitely Divisible Noise in the Low Privacy Regime. ALT Rasmus Pagh, Nina Mesing Stausholm
2022	J	`jnl`	Representing Sparse Vectors with Differential Privacy, Low Error, Optimal Space, and Fast Access. J. Priv. Confidentiality Christian Janos Lebeda, Martin Aumüller, Rasmus Pagh
2022	J	`jnl`	Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? ACM Trans. Database Syst. Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2022	J	`jnl`	Sampling near neighbors in search for fairness. Commun. ACM Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2022	J	`jnl`	Simple Set Sketching. CoRR Jakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer
2022	J	`jnl`	Technical Perspective: Relative Error Streaming Quantiles. SIGMOD Rec. Rasmus Pagh
2021	A*	`conf`	2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS Angela Bonifati, Rasmus Pagh, Thomas Schwentick
2021	A	`ed.`	29th Annual European Symposium on Algorithms, ESA 2021, Lisbon, Portugal (Virtual Conference), September 6-8, 2021 ESA Petra Mutzel, Rasmus Pagh, Grzegorz Herman
2021	J	`jnl`	Advances and Open Problems in Federated Learning. Found. Trends Mach. Learn. Peter Kairouz, H. Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Arjun Nitin Bhagoji, Kallista A. Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, Rafael G. L. D'Oliveira, Hubert Eichner, Salim El Rouayheb, David Evans, Josh Gardner, Zachary Garrett, Adrià Gascón, Badih Ghazi, Phillip B. Gibbons, Marco Gruteser, Zaïd Harchaoui, Chaoyang He, Lie He, Zhouyuan Huo, Ben Hutchinson, Justin Hsu, Martin Jaggi, Tara Javidi, Gauri Joshi, Mikhail Khodak, Jakub Konecný, Aleksandra Korolova, Farinaz Koushanfar, Sanmi Koyejo, Tancrède Lepoint, Yang Liu, Prateek Mittal, Mehryar Mohri, Richard Nock, Ayfer Özgür, Rasmus Pagh, Hang Qi, Daniel Ramage, Ramesh Raskar, Mariana Raykova, Dawn Song, Weikang Song, Sebastian U. Stich, Ziteng Sun, Ananda Theertha Suresh, Florian Tramèr, Praneeth Vepakomma, Jianyu Wang, Li Xiong, Zheng Xu, Qiang Yang, Felix X. Yu, Han Yu, Sen Zhao
2021	A*	`conf`	CountSketches, Feature Hashing and the Median of Three. ICML Kasper Green Larsen, Rasmus Pagh, Jakub Tetek
2021	J	`jnl`	CountSketches, Feature Hashing and the Median of Three. CoRR Kasper Green Larsen, Rasmus Pagh, Jakub Tetek
2021	J	`jnl`	DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search. CoRR Matti Karppa, Martin Aumüller, Rasmus Pagh
2021	A*	`conf`	Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message. ICML Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Amer Sinha
2021	J	`jnl`	Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message. CoRR Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Amer Sinha
2021	A*	`conf`	Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access. CCS Martin Aumüller, Christian Janos Lebeda, Rasmus Pagh
2021	J	`jnl`	Differentially private sparse vectors with low error, optimal space, and fast access. CoRR Martin Aumüller, Christian Janos Lebeda, Rasmus Pagh
2021	A	`conf`	Efficient Differentially Private F₀ Linear Sketching. ICDT Rasmus Pagh, Nina Mesing Stausholm
2021	J	`jnl`	Fair near neighbor search via sampling. SIGMOD Rec. Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2021	J	`jnl`	Infinitely Divisible Noise in the Low Privacy Regime. CoRR Rasmus Pagh, Nina Mesing Stausholm
2021	—	`conf`	On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy. EUROCRYPT (3) Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, Ameya Velingker
2021	J	`jnl`	Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead. CoRR Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh
2021	J	`jnl`	Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? CoRR Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2020	A*	`conf`	Composable Sketches for Functions of Frequencies: Beyond the Worst Case. ICML Edith Cohen, Ofir Geri, Rasmus Pagh
2020	J	`jnl`	Composable Sketches for Functions of Frequencies: Beyond the Worst Case. CoRR Edith Cohen, Ofir Geri, Rasmus Pagh
2020	B	`conf`	Confirmation Sampling for Exact Nearest Neighbor Search. SISAP Tobias Christiani, Rasmus Pagh, Mikkel Thorup
2020	J	`jnl`	Efficient Differentially Private F CoRR Rasmus Pagh, Nina Mesing Stausholm
2020	A*	`conf`	Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. PODS Martin Aumüller, Rasmus Pagh, Francesco Silvestri
2020	A*	`conf`	Oblivious Sketching of High-Degree Polynomial Kernels. SODA Thomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh
2020	A*	`conf`	On the I/O Complexity of the k-Nearest Neighbors Problem. PODS Mayank Goswami, Riko Jacob, Rasmus Pagh
2020	J	`jnl`	On the I/O complexity of the k-nearest neighbor problem. CoRR Mayank Goswami, Riko Jacob, Rasmus Pagh
2020	—	`conf`	Private Aggregation from Fewer Anonymous Messages. EUROCRYPT (2) Badih Ghazi, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker
2020	A*	`conf`	Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead. ICML Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh
2020	A	`conf`	Pure Differentially Private Summation from Anonymous Messages. ITC Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker
2020	J	`jnl`	Pure Differentially Private Summation from Anonymous Messages. CoRR Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker
2020	B	`ed.`	Similarity Search and Applications - 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 - October 2, 2020, Proceedings SISAP Shin'ichi Satoh, Lucia Vadicamo, Arthur Zimek, Fabio Carrara, Ilaria Bartolini, Martin Aumüller, Björn Þór Jónsson, Rasmus Pagh
2020	J	`jnl`	Space-Efficient Feature Maps for String Alignment Kernels. Data Sci. Eng. Yasuo Tabei, Yoshihiro Yamanishi, Rasmus Pagh
2020	A	`conf`	The Space Complexity of Inner Product Filters. ICDT Rasmus Pagh, Johan Sivertsen
2020	A*	`conf`	WOR and NeurIPS Edith Cohen, Rasmus Pagh, David P. Woodruff
2020	J	`jnl`	WOR and p's: Sketches for 𝓁 CoRR Edith Cohen, Rasmus Pagh, David P. Woodruff
2019	J	`jnl`	Advances and Open Problems in Federated Learning. CoRR Peter Kairouz, H. Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Arjun Nitin Bhagoji, Kallista A. Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, Rafael G. L. D'Oliveira, Salim El Rouayheb, David Evans, Josh Gardner, Zachary Garrett, Adrià Gascón, Badih Ghazi, Phillip B. Gibbons, Marco Gruteser, Zaïd Harchaoui, Chaoyang He, Lie He, Zhouyuan Huo, Ben Hutchinson, Justin Hsu, Martin Jaggi, Tara Javidi, Gauri Joshi, Mikhail Khodak, Jakub Konecný, Aleksandra Korolova, Farinaz Koushanfar, Sanmi Koyejo, Tancrède Lepoint, Yang Liu, Prateek Mittal, Mehryar Mohri, Richard Nock, Ayfer Özgür, Rasmus Pagh, Mariana Raykova, Hang Qi, Daniel Ramage, Ramesh Raskar, Dawn Song, Weikang Song, Sebastian U. Stich, Ziteng Sun, Ananda Theertha Suresh, Florian Tramèr, Praneeth Vepakomma, Jianyu Wang, Li Xiong, Zheng Xu, Qiang Yang, Felix X. Yu, Han Yu, Sen Zhao
2019	J	`jnl`	Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. CoRR Martin Aumüller, Rasmus Pagh, Francesco Silvestri
2019	A	`conf`	Hardness of Bichromatic Closest Pair with Jaccard Similarity. ESA Rasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup
2019	J	`jnl`	Hardness of Bichromatic Closest Pair with Jaccard Similarity. CoRR Rasmus Pagh, Nina Stausholm, Mikkel Thorup
2019	J	`jnl`	Oblivious Sketching of High-Degree Polynomial Kernels. CoRR Thomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh
2019	J	`jnl`	On the Power of Multiple Anonymous Messages. IACR Cryptol. ePrint Arch. Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, Ameya Velingker
2019	A	`conf`	PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors. ESA Martin Aumüller, Tobias Christiani, Rasmus Pagh, Michael Vesterli
2019	J	`jnl`	PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors. CoRR Martin Aumüller, Tobias Christiani, Rasmus Pagh, Michael Vesterli
2019	J	`jnl`	Private Aggregation from Fewer Anonymous Messages. CoRR Badih Ghazi, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker
2019	J	`jnl`	Private Heavy Hitters and Range Queries in the Shuffled Model. CoRR Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, Ameya Velingker
2019	J	`jnl`	Scalable and Differentially Private Distributed Aggregation in the Shuffled Model. CoRR Badih Ghazi, Rasmus Pagh, Ameya Velingker
2019	—	`ch.`	Similarity Sketching. Encyclopedia of Big Data Technologies Rasmus Pagh
2019	A*	`conf`	Space-Efficient Feature Maps for String Alignment Kernels. ICDM Yasuo Tabei, Yoshihiro Yamanishi, Rasmus Pagh
2019	J	`jnl`	The space complexity of inner product filters. CoRR Rasmus Pagh, Johan Sivertsen
2018	J	`jnl`	Confirmation Sampling for Exact Nearest Neighbor Search. CoRR Tobias Christiani, Rasmus Pagh, Mikkel Thorup
2018	J	`jnl`	CoveringLSH: Locality-Sensitive Hashing without False Negatives. ACM Trans. Algorithms Rasmus Pagh
2018	A*	`conf`	Distance-Sensitive Hashing. PODS Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri
2018	J	`jnl`	Enumerating Trillion Subgraphs On Distributed Systems. ACM Trans. Knowl. Discov. Data Ha-Myung Park, Francesco Silvestri, Rasmus Pagh, Chin-Wan Chung, Sung-Hyon Myaeng, U Kang
2018	J	`jnl`	Fast Prefix Search in Little Space, with Applications. CoRR Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
2018	A	`ed.`	Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018. ALENEX Rasmus Pagh, Suresh Venkatasubramanian
2018	J	`jnl`	Scalable Alignment Kernels via Space-Efficient Feature Maps. CoRR Yasuo Tabei, Yoshihiro Yamanishi, Rasmus Pagh
2018	A*	`conf`	Scalable and Robust Set Similarity Join. ICDE Tobias Christiani, Rasmus Pagh, Johan Sivertsen
2018	A*	`conf`	Set Similarity Search for Skewed Data. PODS Samuel McCauley, Jesper W. Mikkelsen, Rasmus Pagh
2018	J	`jnl`	Set Similarity Search for Skewed Data. CoRR Samuel McCauley, Jesper W. Mikkelsen, Rasmus Pagh
2018	J	`jnl`	Simple multi-party set reconciliation. Distributed Comput. Michael Mitzenmacher, Rasmus Pagh
2017	J	`jnl`	Approximate furthest neighbor with application to annulus query. Inf. Syst. Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala
2017	A*	`conf`	Distance Sensitive Bloom Filters Without False Negatives. SODA Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen
2017	J	`jnl`	Distance-sensitive hashing. CoRR Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri
2017	J	`jnl`	Efficiently Correcting Matrix Products. Algorithmica Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama
2017	B	`conf`	Hardness and Approximation of High-Dimensional Search Problems (Invited Talk). MFCS Rasmus Pagh
2017	J	`jnl`	I/O-Efficient Similarity Join. Algorithmica Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel
2017	A*	`conf`	Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. SODA Thomas D. Ahle, Martin Aumüller, Rasmus Pagh
2017	B	`conf`	Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons. ISAAC Joachim Gudmundsson, Rasmus Pagh
2017	J	`jnl`	Range-efficient consistent sampling and locality-sensitive hashing for polygons. CoRR Joachim Gudmundsson, Rasmus Pagh
2017	J	`jnl`	Scalable and robust set similarity join. CoRR Tobias Christiani, Rasmus Pagh, Johan Sivertsen
2017	A*	`conf`	Set similarity search beyond MinHash. STOC Tobias Christiani, Rasmus Pagh
2017	J	`jnl`	Theory and Applications of Hashing (Dagstuhl Seminar 17181). Dagstuhl Reports Martin Dietzfelbinger, Michael Mitzenmacher, Rasmus Pagh, David P. Woodruff, Martin Aumüller
2016	—	`ed.`	15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, Reykjavik, Iceland, June 22-24, 2016 SWAT Rasmus Pagh
2016	J	`jnl`	Approximate Furthest Neighbor with Application to Annulus Query. CoRR Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala
2016	—	`ch.`	Cuckoo Hashing. Encyclopedia of Algorithms Rasmus Pagh
2016	J	`jnl`	Distance Sensitive Bloom Filters Without False Negatives. CoRR Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen
2016	J	`jnl`	Efficiently Correcting Matrix Products. CoRR Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama
2016	J	`jnl`	High-dimensional Spherical Range Reporting by Output-Sensitive Multi-Probing LSH. CoRR Thomas D. Ahle, Martin Aumüller, Rasmus Pagh
2016	A*	`conf`	Locality-sensitive Hashing without False Negatives. SODA Rasmus Pagh
2016	A*	`conf`	On the Complexity of Inner Product Similarity Join. PODS Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri
2016	A	`conf`	Scalability and Total Recall with Fast CoveringLSH. CIKM Ninh Pham, Rasmus Pagh
2016	J	`jnl`	Scalability and Total Recall with Fast CoveringLSH. CoRR Ninh Pham, Rasmus Pagh
2016	J	`jnl`	Set Similarity Search Beyond MinHash. CoRR Tobias Christiani, Rasmus Pagh
2016	J	`jnl`	Triangle Counting in Dynamic Graph Streams. Algorithmica Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh
2015	B	`conf`	Approximate Furthest Neighbor in High Dimensions. SISAP Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala
2015	A*	`conf`	Approximate Range Emptiness in Constant Time and Optimal Space. SODA Mayank Goswami, Allan Grønlund Jørgensen, Kasper Green Larsen, Rasmus Pagh
2015	J	`jnl`	Association Rule Mining using Maximum Entropy. CoRR Rasmus Pagh, Morten Stöckel
2015	A*	`conf`	From Independence to Expansion and Back Again. STOC Tobias Christiani, Rasmus Pagh, Mikkel Thorup
2015	J	`jnl`	From Independence to Expansion and Back Again. CoRR Tobias Christiani, Rasmus Pagh, Mikkel Thorup
2015	A	`conf`	I/O-Efficient Similarity Join. ESA Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel
2015	J	`jnl`	I/O-Efficient Similarity Join. CoRR Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel
2015	A	`conf`	Large-Scale Similarity Joins With Guarantees (Invited Talk). ICDT Rasmus Pagh
2015	J	`jnl`	Locality-sensitive Hashing without False Negatives. CoRR Rasmus Pagh
2015	J	`jnl`	On the Complexity of Inner Product Similarity Join. CoRR Thomas D. Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri
2014	J	`jnl`	Approximate Range Emptiness in Constant Time and Optimal Space. CoRR Mayank Goswami, Allan Grønlund Jørgensen, Kasper Green Larsen, Rasmus Pagh
2014	J	`jnl`	Better Size Estimation for Sparse Matrix Products. Algorithmica Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh
2014	J	`jnl`	Cache-Oblivious Hashing. Algorithmica Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang
2014	—	`conf`	Consistent Subset Sampling. SWAT Konstantin Kutzkov, Rasmus Pagh
2014	J	`jnl`	Consistent Subset Sampling. CoRR Konstantin Kutzkov, Rasmus Pagh
2014	A*	`conf`	Efficient estimation for high similarities using odd sketches. WWW Michael Mitzenmacher, Rasmus Pagh, Ninh Pham
2014	A*	`conf`	Generating k-Independent Variables in Constant Time. FOCS Tobias Christiani, Rasmus Pagh
2014	J	`jnl`	Generating k-independent variables in constant time. CoRR Tobias Christiani, Rasmus Pagh
2014	A*	`conf`	Is min-wise hashing optimal for summarizing set intersection? PODS Rasmus Pagh, Morten Stöckel, David P. Woodruff
2014	—	`conf`	Listing Triangles. ICALP (1) Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick
2014	A	`conf`	MapReduce Triangle Enumeration With Guarantees. CIKM Ha-Myung Park, Francesco Silvestri, U Kang, Rasmus Pagh
2014	A	`conf`	The Input/Output Complexity of Sparse Matrix Multiplication. ESA Rasmus Pagh, Morten Stöckel
2014	J	`jnl`	The Input/Output Complexity of Sparse Matrix Multiplication. CoRR Rasmus Pagh, Morten Stöckel
2014	A*	`conf`	The input/output complexity of triangle enumeration. PODS Rasmus Pagh, Francesco Silvestri
2014	J	`jnl`	Thresholds for Extreme Orientability. Algorithmica Po-Shen Loh, Rasmus Pagh
2014	—	`conf`	Triangle Counting in Dynamic Graph Streams. SWAT Konstantin Kutzkov, Rasmus Pagh
2014	J	`jnl`	Triangle counting in dynamic graph streams. CoRR Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh
2013	J	`jnl`	Compressed matrix multiplication. ACM Trans. Comput. Theory Rasmus Pagh
2013	A*	`conf`	Fast and scalable polynomial kernels via explicit feature maps. KDD Ninh Pham, Rasmus Pagh
2013	J	`jnl`	How to Approximate A Set Without Knowing Its Size In Advance CoRR Rasmus Pagh, Gil Segev, Udi Wieder
2013	A*	`conf`	How to Approximate a Set without Knowing Its Size in Advance. FOCS Rasmus Pagh, Gil Segev, Udi Wieder
2013	A	`conf`	On parallelizing matrix multiplication by the column-row method. ALENEX Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh
2013	A	`conf`	On the streaming complexity of computing local clustering coefficients. WSDM Konstantin Kutzkov, Rasmus Pagh
2013	J	`jnl`	Practical perfect hashing in nearly optimal space. Inf. Syst. Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani
2013	J	`jnl`	Simple Multi-Party Set Reconciliation. CoRR Michael Mitzenmacher, Rasmus Pagh
2013	J	`jnl`	The Input/Output Complexity of Triangle Enumeration. CoRR Rasmus Pagh, Francesco Silvestri
2012	A*	`conf`	A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data. KDD Ninh Pham, Rasmus Pagh
2012	J	`jnl`	Colorful triangle counting and a MapReduce implementation. Inf. Process. Lett. Rasmus Pagh, Charalampos E. Tsourakakis
2012	A	`conf`	Compressed matrix multiplication. ITCS Rasmus Pagh
2012	J	`jnl`	Finding associations and computing similarity via biased pair sampling. Knowl. Inf. Syst. Andrea Campagna, Rasmus Pagh
2012	A*	`conf`	I/O-efficient data structures for colored range and prefix reporting. SODA Kasper Green Larsen, Rasmus Pagh
2012	J	`jnl`	On Parallelizing Matrix Multiplication by the Column-Row Method CoRR Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh
2012	J	`jnl`	Thresholds for Extreme Orientability CoRR Po-Shen Loh, Rasmus Pagh
2011	J	`jnl`	A New Data Layout For Set Intersection on GPUs CoRR Rasmus Resen Amossen, Rasmus Pagh
2011	A	`conf`	A New Data Layout for Set Intersection on GPUs. IPDPS Rasmus Resen Amossen, Rasmus Pagh
2011	J	`jnl`	Colorful Triangle Counting and a MapReduce Implementation CoRR Rasmus Pagh, Charalampos E. Tsourakakis
2011	J	`jnl`	Compressed Matrix Multiplication CoRR Rasmus Pagh
2011	—	`conf`	Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. ICDM Workshops Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh
2011	J	`jnl`	I/O-Efficient Data Structures for Colored Range and Prefix Reporting CoRR Kasper Green Larsen, Rasmus Pagh
2011	J	`jnl`	Linear Probing with 5-wise Independence. SIAM Rev. Anna Pagh, Rasmus Pagh, Milan Ruzic
2011	J	`jnl`	Theory and practice of monotone minimal perfect hashing. ACM J. Exp. Algorithmics Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
2010	—	`conf`	Better Size Estimation for Sparse Matrix Products. APPROX-RANDOM Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh
2010	J	`jnl`	Better size estimation for sparse matrix products CoRR Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh
2010	A*	`conf`	Cache-oblivious hashing. PODS Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang
2010	—	`conf`	Fast Prefix Search in Little Space, with Applications. ESA (1) Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
2010	J	`jnl`	On Finding Frequent Patterns in Directed Acyclic Graphs CoRR Andrea Campagna, Rasmus Pagh
2010	J	`jnl`	On Finding Frequent Patterns in Event Sequences CoRR Andrea Campagna, Rasmus Pagh
2010	A*	`conf`	On Finding Frequent Patterns in Event Sequences. ICDM Andrea Campagna, Rasmus Pagh
2010	J	`jnl`	On Finding Similar Items in a Stream of Transactions CoRR Andrea Campagna, Rasmus Pagh
2010	—	`conf`	On Finding Similar Items in a Stream of Transactions. ICDM Workshops Andrea Campagna, Rasmus Pagh
2010	—	`conf`	Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
2009	J	`jnl`	Dispersing hash functions. Random Struct. Algorithms Rasmus Pagh
2009	A	`conf`	Faster join-projects and sparse matrix multiplications. ICDT Rasmus Resen Amossen, Rasmus Pagh
2009	J	`jnl`	Finding Associations and Computing Similarity via Biased Pair Sampling CoRR Andrea Campagna, Rasmus Pagh
2009	A*	`conf`	Finding Associations and Computing Similarity via Biased Pair Sampling. ICDM Andrea Campagna, Rasmus Pagh
2009	J	`jnl`	Linear Probing with Constant Independence. SIAM J. Comput. Anna Pagh, Rasmus Pagh, Milan Ruzic
2009	A*	`conf`	Monotone minimal perfect hashing: searching a sorted table with SODA Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
2009	A*	`conf`	Secondary indexing in one dimension: beyond b-trees and bitmap indexes. PODS Rasmus Pagh, Srinivasa Rao Satti
2009	A	`conf`	Storing a Compressed Function with Constant Time Access. ESA Jóhannes B. Hreinsson, Morten Krøyer, Rasmus Pagh
2009	A	`conf`	Theory and Practise of Monotone Minimal Perfect Hashing. ALENEX Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
2009	J	`jnl`	Tight Thresholds for Cuckoo Hashing via XORSAT CoRR Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
2008	—	`ch.`	Cuckoo Hashing. Encyclopedia of Algorithms Rasmus Pagh
2008	J	`jnl`	Optimality in External Memory Hashing. Algorithmica Morten Skaarup Jensen, Rasmus Pagh
2008	J	`jnl`	Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes CoRR Rasmus Pagh, S. Srinivasa Rao
2008	J	`jnl`	Succinct Data Structures for Retrieval and Approximate Membership CoRR Martin Dietzfelbinger, Rasmus Pagh
2008	—	`conf`	Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). ICALP (1) Martin Dietzfelbinger, Rasmus Pagh
2008	J	`jnl`	Uniform Hashing in Constant Time and Optimal Space. SIAM J. Comput. Anna Pagh, Rasmus Pagh
2007	B	`conf`	Fast Evaluation of Union-Intersection Expressions. ISAAC Philip Bille, Anna Pagh, Rasmus Pagh
2007	J	`jnl`	Fast evaluation of union-intersection expressions CoRR Philip Bille, Anna Pagh, Rasmus Pagh
2007	J	`jnl`	Generic Global Constraints based on MDDs CoRR Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh
2007	A*	`conf`	Linear probing with constant independence. STOC Anna Pagh, Rasmus Pagh, Milan Ruzic
2007	J	`jnl`	Perfect Hashing for Data Management Applications CoRR Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani
2007	B	`conf`	Simple and Space-Efficient Minimal Perfect Hash Functions. WADS Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani
2006	J	`jnl`	A Generic Global Constraint based on MDDs CoRR Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh
2006	B	`conf`	De Dictionariis Dynamicis Pauco Spatio Utentibus ( LATIN Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu
2006	B	`conf`	Deterministic load balancing and dictionaries in the parallel disk model. SPAA Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann
2006	A	`conf`	External String Sorting: Faster and Cache-Oblivious. STACS Rolf Fagerberg, Anna Pagh, Rasmus Pagh
2006	J	`jnl`	Linear Probing with Constant Independence CoRR Anna Pagh, Rasmus Pagh, Milan Ruzic
2006	A*	`conf`	Scalable computation of acyclic joins. PODS Anna Pagh, Rasmus Pagh
2005	A*	`conf`	An optimal Bloom filter replacement. SODA Anna Pagh, Rasmus Pagh, S. Srinivasa Rao
2005	J	`jnl`	De Dictionariis Dynamicis Pauco Spatio Utentibus CoRR Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu
2005	J	`jnl`	On Dynamic Range Reporting in One Dimension CoRR Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu
2005	A*	`conf`	On dynamic range reporting in one dimension. STOC Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu
2005	J	`jnl`	Space Efficient Hash Tables with Worst Case Constant Access Time. Theory Comput. Syst. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis
2004	J	`jnl`	Cuckoo hashing. J. Algorithms Rasmus Pagh, Flemming Friche Rodler
2004	A	`conf`	On Adaptive Integer Sorting. ESA Anna Pagh, Rasmus Pagh, Mikkel Thorup
2003	A	`conf`	Space Efficient Hash Tables with Worst Case Constant Access Time. STACS Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis
2003	A*	`conf`	Uniform hashing in constant time and linear space. STOC Anna Östlin, Rasmus Pagh
2002	—	`conf`	Basic External Memory Data Structures. Algorithms for Memory Hierarchies Rasmus Pagh
2002	A*	`conf`	One-Probe Search. ICALP Anna Östlin, Rasmus Pagh
2002	A*	`conf`	Optimal time-space trade-offs for non-comparison-based sorting. SODA Rasmus Pagh, Jakob Pagter
2001	A	`conf`	Cuckoo Hashing. ESA Rasmus Pagh, Flemming Friche Rodler
2001	J	`jnl`	Deterministic Dictionaries. J. Algorithms Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh
2001	A	`conf`	Lossy Dictionaries. ESA Rasmus Pagh, Flemming Friche Rodler
2001	J	`jnl`	Low Redundancy in Static Dictionaries with Constant Query Time. SIAM J. Comput. Rasmus Pagh
2001	A*	`conf`	On the cell probe complexity of membership and perfect hashing. STOC Rasmus Pagh
2000	—	`conf`	A New Trade-Off for Deterministic Dictionaries. SWAT Rasmus Pagh
2000	J	`jnl`	A Trade-Off for Worst-Case Efficient Dictionaries. Nord. J. Comput. Rasmus Pagh
2000	—	`conf`	Dispersing Hash Functions. ICALP Satellite Workshops Rasmus Pagh
2000	A*	`conf`	Faster deterministic dictionaries. SODA Rasmus Pagh
1999	B	`conf`	Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. WADS Rasmus Pagh
1999	A*	`conf`	Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. ICALP Rasmus Pagh