Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Rasmus Pagh
@inproceedings{DBLP:conf/soda/LolckP24,
author = {David Rasmussen Lolck and
Rasmus Pagh},
editor = {David P. Woodruff},
title = {Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications
in Differential Privacy},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {1050--1066},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.40},
doi = {10.1137/1.9781611977912.40},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/LolckP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/DamgardKNOP24,
author = {Ivan Damg{\aa}rd and
Hannah Keller and
Boel Nelson and
Claudio Orlandi and
Rasmus Pagh},
editor = {Tat{-}Seng Chua and
Chong{-}Wah Ngo and
Ravi Kumar and
Hady W. Lauw and
Roy Ka{-}Wei Lee},
title = {Differentially Private Selection from Secure Distributed Computing},
booktitle = {Proceedings of the {ACM} on Web Conference 2024, {WWW} 2024, Singapore,
May 13-17, 2024},
pages = {1103--1114},
publisher = {{ACM}},
year = {2024},
url = {https://doi.org/10.1145/3589334.3645435},
doi = {10.1145/3589334.3645435},
timestamp = {Tue, 14 May 2024 13:08:02 +0200},
biburl = {https://dblp.org/rec/conf/www/DamgardKNOP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pacmmod/DayanBRP23,
author = {Niv Dayan and
Ioana O. Bercea and
Pedro Reviriego and
Rasmus Pagh},
title = {InfiniFilter: Expanding Filters to Infinity and Beyond},
journal = {Proc. {ACM} Manag. Data},
volume = {1},
number = {2},
pages = {140:1--140:27},
year = {2023},
url = {https://doi.org/10.1145/3589285},
doi = {10.1145/3589285},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pacmmod/DayanBRP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KachamPTW23,
author = {Praneeth Kacham and
Rasmus Pagh and
Mikkel Thorup and
David P. Woodruff},
title = {Pseudorandom Hashing for Space-bounded Computation with Applications
in Streaming},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1515--1550},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00093},
doi = {10.1109/FOCS57990.2023.00093},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KachamPTW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AnderssonP23,
author = {Joel Daniel Andersson and
Rasmus Pagh},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {A Smooth Binary Mechanism for Efficient Private Continual Observation},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/99c41fb9fd53abfdd4a0259560ef1c9d-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AnderssonP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/HouenPW23,
author = {Jakob B{\ae}k Tejs Houen and
Rasmus Pagh and
Stefan Walzer},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Simple Set Sketching},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {228--241},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch21},
doi = {10.1137/1.9781611977585.CH21},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/HouenPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-06853,
author = {Praneeth Kacham and
Rasmus Pagh and
Mikkel Thorup and
David P. Woodruff},
title = {Pseudorandom Hashing for Space-bounded Computation with Applications
in Streaming},
journal = {CoRR},
volume = {abs/2304.06853},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.06853},
doi = {10.48550/ARXIV.2304.06853},
eprinttype = {arXiv},
eprint = {2304.06853},
timestamp = {Wed, 19 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-06853.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-02816,
author = {David Rasmussen Lolck and
Rasmus Pagh},
title = {Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications
in Differential Privacy},
journal = {CoRR},
volume = {abs/2305.02816},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.02816},
doi = {10.48550/ARXIV.2305.02816},
eprinttype = {arXiv},
eprint = {2305.02816},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-02816.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-04564,
author = {Ivan Damg{\aa}rd and
Hannah Keller and
Boel Nelson and
Claudio Orlandi and
Rasmus Pagh},
title = {Differentially Private Selection from Secure Distributed Computing},
journal = {CoRR},
volume = {abs/2306.04564},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.04564},
doi = {10.48550/ARXIV.2306.04564},
eprinttype = {arXiv},
eprint = {2306.04564},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-04564.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-08745,
author = {Martin Aum{\"{u}}ller and
Christian Janos Lebeda and
Boel Nelson and
Rasmus Pagh},
title = {{PLAN:} Variance-Aware Private Mean Estimation},
journal = {CoRR},
volume = {abs/2306.08745},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.08745},
doi = {10.48550/ARXIV.2306.08745},
eprinttype = {arXiv},
eprint = {2306.08745},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-08745.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-09666,
author = {Joel Daniel Andersson and
Rasmus Pagh},
title = {A Smooth Binary Mechanism for Efficient Private Continual Observation},
journal = {CoRR},
volume = {abs/2306.09666},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.09666},
doi = {10.48550/ARXIV.2306.09666},
eprinttype = {arXiv},
eprint = {2306.09666},
timestamp = {Thu, 22 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-09666.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-16042,
author = {Kasper Green Larsen and
Rasmus Pagh and
Toniann Pitassi and
Or Zamir},
title = {Optimal Non-Adaptive Cell Probe Dictionaries and Hashing},
journal = {CoRR},
volume = {abs/2308.16042},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.16042},
doi = {10.48550/ARXIV.2308.16042},
eprinttype = {arXiv},
eprint = {2308.16042},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-16042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/DamgardKNOP23,
author = {Ivan Damg{\aa}rd and
Hannah Keller and
Boel Nelson and
Claudio Orlandi and
Rasmus Pagh},
title = {Differentially Private Selection from Secure Distributed Computing},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {894},
year = {2023},
url = {https://eprint.iacr.org/2023/894},
timestamp = {Mon, 03 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/DamgardKNOP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/AumullerHMPS22,
author = {Martin Aum{\"{u}}ller and
Sariel Har{-}Peled and
Sepideh Mahabadi and
Rasmus Pagh and
Francesco Silvestri},
title = {Sampling near neighbors in search for fairness},
journal = {Commun. {ACM}},
volume = {65},
number = {8},
pages = {83--90},
year = {2022},
url = {https://doi.org/10.1145/3543667},
doi = {10.1145/3543667},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/AumullerHMPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpc/LebedaAP22,
author = {Christian Janos Lebeda and
Martin Aum{\"{u}}ller and
Rasmus Pagh},
title = {Representing Sparse Vectors with Differential Privacy, Low Error,
Optimal Space, and Fast Access},
journal = {J. Priv. Confidentiality},
volume = {12},
number = {2},
year = {2022},
url = {https://doi.org/10.29012/jpc.809},
doi = {10.29012/JPC.809},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpc/LebedaAP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/Pagh22,
author = {Rasmus Pagh},
title = {Technical Perspective: Relative Error Streaming Quantiles},
journal = {{SIGMOD} Rec.},
volume = {51},
number = {1},
pages = {68},
year = {2022},
url = {https://doi.org/10.1145/3542700.3542716},
doi = {10.1145/3542700.3542716},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigmod/Pagh22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/AumullerHMPS22,
author = {Martin Aum{\"{u}}ller and
Sariel Har{-}Peled and
Sepideh Mahabadi and
Rasmus Pagh and
Francesco Silvestri},
title = {Sampling a Near Neighbor in High Dimensions - Who is the Fairest of
Them All?},
journal = {{ACM} Trans. Database Syst.},
volume = {47},
number = {1},
pages = {4:1--4:40},
year = {2022},
url = {https://doi.org/10.1145/3502867},
doi = {10.1145/3502867},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tods/AumullerHMPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/Karppa0P22,
author = {Matti Karppa and
Martin Aum{\"{u}}ller and
Rasmus Pagh},
editor = {Gustau Camps{-}Valls and
Francisco J. R. Ruiz and
Isabel Valera},
title = {{DEANN:} Speeding up Kernel-Density Estimation using Approximate Nearest
Neighbor Search},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2022, 28-30 March 2022, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {151},
pages = {3108--3137},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v151/karppa22a.html},
timestamp = {Sat, 30 Sep 2023 09:34:08 +0200},
biburl = {https://dblp.org/rec/conf/aistats/Karppa0P22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/PaghS22,
author = {Rasmus Pagh and
Nina Mesing Stausholm},
editor = {Sanjoy Dasgupta and
Nika Haghtalab},
title = {Infinitely Divisible Noise in the Low Privacy Regime},
booktitle = {International Conference on Algorithmic Learning Theory, 29 March
- 1 April 2022, Paris, France},
series = {Proceedings of Machine Learning Research},
volume = {167},
pages = {881--909},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v167/pagh22a.html},
timestamp = {Fri, 10 Mar 2023 11:41:45 +0100},
biburl = {https://dblp.org/rec/conf/alt/PaghS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/KarppaP22,
author = {Matti Karppa and
Rasmus Pagh},
editor = {Aidong Zhang and
Huzefa Rangwala},
title = {HyperLogLogLog: Cardinality Estimation With One Log More},
booktitle = {{KDD} '22: The 28th {ACM} {SIGKDD} Conference on Knowledge Discovery
and Data Mining, Washington, DC, USA, August 14 - 18, 2022},
pages = {753--761},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3534678.3539246},
doi = {10.1145/3534678.3539246},
timestamp = {Mon, 28 Aug 2023 21:17:29 +0200},
biburl = {https://dblp.org/rec/conf/kdd/KarppaP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/PaghT22,
author = {Rasmus Pagh and
Mikkel Thorup},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Improved Utility Analysis of Private CountSketch},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/a47f5cdff1469751597d78e803fc590f-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/PaghT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-08397,
author = {Rasmus Pagh and
Mikkel Thorup},
title = {Improved Utility Analysis of Private CountSketch},
journal = {CoRR},
volume = {abs/2205.08397},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.08397},
doi = {10.48550/ARXIV.2205.08397},
eprinttype = {arXiv},
eprint = {2205.08397},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-08397.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-11327,
author = {Matti Karppa and
Rasmus Pagh},
title = {HyperLogLogLog: Cardinality Estimation With One Log More},
journal = {CoRR},
volume = {abs/2205.11327},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.11327},
doi = {10.48550/ARXIV.2205.11327},
eprinttype = {arXiv},
eprint = {2205.11327},
timestamp = {Mon, 30 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-11327.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-14894,
author = {Ioana O. Bercea and
Jakob B{\ae}k Tejs Houen and
Rasmus Pagh},
title = {Daisy Bloom Filters},
journal = {CoRR},
volume = {abs/2205.14894},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.14894},
doi = {10.48550/ARXIV.2205.14894},
eprinttype = {arXiv},
eprint = {2205.14894},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-14894.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03683,
author = {Jakob B{\ae}k Tejs Houen and
Rasmus Pagh and
Stefan Walzer},
title = {Simple Set Sketching},
journal = {CoRR},
volume = {abs/2211.03683},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03683},
doi = {10.48550/ARXIV.2211.03683},
eprinttype = {arXiv},
eprint = {2211.03683},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03683.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ftml/KairouzMABBBBCC21,
author = {Peter Kairouz and
H. Brendan McMahan and
Brendan Avent and
Aur{\'{e}}lien Bellet and
Mehdi Bennis and
Arjun Nitin Bhagoji and
Kallista A. Bonawitz and
Zachary Charles and
Graham Cormode and
Rachel Cummings and
Rafael G. L. D'Oliveira and
Hubert Eichner and
Salim El Rouayheb and
David Evans and
Josh Gardner and
Zachary Garrett and
Adri{\`{a}} Gasc{\'{o}}n and
Badih Ghazi and
Phillip B. Gibbons and
Marco Gruteser and
Za{\"{\i}}d Harchaoui and
Chaoyang He and
Lie He and
Zhouyuan Huo and
Ben Hutchinson and
Justin Hsu and
Martin Jaggi and
Tara Javidi and
Gauri Joshi and
Mikhail Khodak and
Jakub Kone{\v{c}}n{\'y} and
Aleksandra Korolova and
Farinaz Koushanfar and
Sanmi Koyejo and
Tancr{\`{e}}de Lepoint and
Yang Liu and
Prateek Mittal and
Mehryar Mohri and
Richard Nock and
Ayfer {\"{O}}zg{\"{u}}r and
Rasmus Pagh and
Hang Qi and
Daniel Ramage and
Ramesh Raskar and
Mariana Raykova and
Dawn Song and
Weikang Song and
Sebastian U. Stich and
Ziteng Sun and
Ananda Theertha Suresh and
Florian Tram{\`{e}}r and
Praneeth Vepakomma and
Jianyu Wang and
Li Xiong and
Zheng Xu and
Qiang Yang and
Felix X. Yu and
Han Yu and
Sen Zhao},
title = {Advances and Open Problems in Federated Learning},
journal = {Found. Trends Mach. Learn.},
volume = {14},
number = {1-2},
pages = {1--210},
year = {2021},
url = {https://doi.org/10.1561/2200000083},
doi = {10.1561/2200000083},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ftml/KairouzMABBBBCC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/AumullerHMPS21,
author = {Martin Aum{\"{u}}ller and
Sariel Har{-}Peled and
Sepideh Mahabadi and
Rasmus Pagh and
Francesco Silvestri},
title = {Fair near neighbor search via sampling},
journal = {{SIGMOD} Rec.},
volume = {50},
number = {1},
pages = {42--49},
year = {2021},
url = {https://doi.org/10.1145/3471485.3471496},
doi = {10.1145/3471485.3471496},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigmod/AumullerHMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/0001LP21,
author = {Martin Aum{\"{u}}ller and
Christian Janos Lebeda and
Rasmus Pagh},
editor = {Yongdae Kim and
Jong Kim and
Giovanni Vigna and
Elaine Shi},
title = {Differentially Private Sparse Vectors with Low Error, Optimal Space,
and Fast Access},
booktitle = {{CCS} '21: 2021 {ACM} {SIGSAC} Conference on Computer and Communications
Security, Virtual Event, Republic of Korea, November 15 - 19, 2021},
pages = {1223--1236},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3460120.3484735},
doi = {10.1145/3460120.3484735},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ccs/0001LP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/GhaziG0PV21,
author = {Badih Ghazi and
Noah Golowich and
Ravi Kumar and
Rasmus Pagh and
Ameya Velingker},
editor = {Anne Canteaut and
Fran{\c{c}}ois{-}Xavier Standaert},
title = {On the Power of Multiple Anonymous Messages: Frequency Estimation
and Selection in the Shuffle Model of Differential Privacy},
booktitle = {Advances in Cryptology - {EUROCRYPT} 2021 - 40th Annual International
Conference on the Theory and Applications of Cryptographic Techniques,
Zagreb, Croatia, October 17-21, 2021, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {12698},
pages = {463--488},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-77883-5\_16},
doi = {10.1007/978-3-030-77883-5\_16},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/GhaziG0PV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/PaghS21,
author = {Rasmus Pagh and
Nina Mesing Stausholm},
editor = {Ke Yi and
Zhewei Wei},
title = {Efficient Differentially Private F{\unicode{8320}} Linear Sketching},
booktitle = {24th International Conference on Database Theory, {ICDT} 2021, March
23-26, 2021, Nicosia, Cyprus},
series = {LIPIcs},
volume = {186},
pages = {18:1--18:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2021.18},
doi = {10.4230/LIPICS.ICDT.2021.18},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdt/PaghS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Ghazi0MPS21,
author = {Badih Ghazi and
Ravi Kumar and
Pasin Manurangsi and
Rasmus Pagh and
Amer Sinha},
editor = {Marina Meila and
Tong Zhang},
title = {Differentially Private Aggregation in the Shuffle Model: Almost Central
Accuracy in Almost a Single Message},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {3692--3701},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/ghazi21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/Ghazi0MPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/LarsenPT21,
author = {Kasper Green Larsen and
Rasmus Pagh and
Jakub Tetek},
editor = {Marina Meila and
Tong Zhang},
title = {CountSketches, Feature Hashing and the Median of Three},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {6011--6020},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/larsen21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/LarsenPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/BonifatiPS21,
author = {Angela Bonifati and
Rasmus Pagh and
Thomas Schwentick},
editor = {Leonid Libkin and
Reinhard Pichler and
Paolo Guagliardo},
title = {2021 {ACM} {PODS} Alberto O. Mendelzon Test-of-Time Award},
booktitle = {PODS'21: Proceedings of the 40th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium
on Principles of Database Systems, Virtual Event, China, June 20-25,
2021},
pages = {82},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3452021.3452909},
doi = {10.1145/3452021.3452909},
timestamp = {Mon, 21 Jun 2021 12:19:15 +0200},
biburl = {https://dblp.org/rec/conf/pods/BonifatiPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2021,
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-204-4},
isbn = {978-3-95977-204-4},
timestamp = {Tue, 31 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-10905,
author = {Martin Aum{\"{u}}ller and
Sariel Har{-}Peled and
Sepideh Mahabadi and
Rasmus Pagh and
Francesco Silvestri},
title = {Sampling a Near Neighbor in High Dimensions - Who is the Fairest of
Them All?},
journal = {CoRR},
volume = {abs/2101.10905},
year = {2021},
url = {https://arxiv.org/abs/2101.10905},
eprinttype = {arXiv},
eprint = {2101.10905},
timestamp = {Sun, 31 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-10905.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-02193,
author = {Kasper Green Larsen and
Rasmus Pagh and
Jakub Tetek},
title = {CountSketches, Feature Hashing and the Median of Three},
journal = {CoRR},
volume = {abs/2102.02193},
year = {2021},
url = {https://arxiv.org/abs/2102.02193},
eprinttype = {arXiv},
eprint = {2102.02193},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-02193.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-04247,
author = {Badih Ghazi and
Ravi Kumar and
Pasin Manurangsi and
Rasmus Pagh},
title = {Private Counting from Anonymous Messages: Near-Optimal Accuracy with
Vanishing Communication Overhead},
journal = {CoRR},
volume = {abs/2106.04247},
year = {2021},
url = {https://arxiv.org/abs/2106.04247},
eprinttype = {arXiv},
eprint = {2106.04247},
timestamp = {Fri, 11 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-04247.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-10068,
author = {Martin Aum{\"{u}}ller and
Christian Janos Lebeda and
Rasmus Pagh},
title = {Differentially private sparse vectors with low error, optimal space,
and fast access},
journal = {CoRR},
volume = {abs/2106.10068},
year = {2021},
url = {https://arxiv.org/abs/2106.10068},
eprinttype = {arXiv},
eprint = {2106.10068},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-10068.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-02736,
author = {Matti Karppa and
Martin Aum{\"{u}}ller and
Rasmus Pagh},
title = {{DEANN:} Speeding up Kernel-Density Estimation using Approximate Nearest
Neighbor Search},
journal = {CoRR},
volume = {abs/2107.02736},
year = {2021},
url = {https://arxiv.org/abs/2107.02736},
eprinttype = {arXiv},
eprint = {2107.02736},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-02736.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-13158,
author = {Badih Ghazi and
Ravi Kumar and
Pasin Manurangsi and
Rasmus Pagh and
Amer Sinha},
title = {Differentially Private Aggregation in the Shuffle Model: Almost Central
Accuracy in Almost a Single Message},
journal = {CoRR},
volume = {abs/2109.13158},
year = {2021},
url = {https://arxiv.org/abs/2109.13158},
eprinttype = {arXiv},
eprint = {2109.13158},
timestamp = {Mon, 04 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-13158.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-06559,
author = {Rasmus Pagh and
Nina Mesing Stausholm},
title = {Infinitely Divisible Noise in the Low Privacy Regime},
journal = {CoRR},
volume = {abs/2110.06559},
year = {2021},
url = {https://arxiv.org/abs/2110.06559},
eprinttype = {arXiv},
eprint = {2110.06559},
timestamp = {Fri, 22 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-06559.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dase/TabeiYP20,
author = {Yasuo Tabei and
Yoshihiro Yamanishi and
Rasmus Pagh},
title = {Space-Efficient Feature Maps for String Alignment Kernels},
journal = {Data Sci. Eng.},
volume = {5},
number = {2},
pages = {168--179},
year = {2020},
url = {https://doi.org/10.1007/s41019-020-00120-6},
doi = {10.1007/S41019-020-00120-6},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dase/TabeiYP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/GhaziMPV20,
author = {Badih Ghazi and
Pasin Manurangsi and
Rasmus Pagh and
Ameya Velingker},
editor = {Anne Canteaut and
Yuval Ishai},
title = {Private Aggregation from Fewer Anonymous Messages},
booktitle = {Advances in Cryptology - {EUROCRYPT} 2020 - 39th Annual International
Conference on the Theory and Applications of Cryptographic Techniques,
Zagreb, Croatia, May 10-14, 2020, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {12106},
pages = {798--827},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-45724-2\_27},
doi = {10.1007/978-3-030-45724-2\_27},
timestamp = {Mon, 04 May 2020 14:32:28 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/GhaziMPV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/PaghS20,
author = {Rasmus Pagh and
Johan Sivertsen},
editor = {Carsten Lutz and
Jean Christoph Jung},
title = {The Space Complexity of Inner Product Filters},
booktitle = {23rd International Conference on Database Theory, {ICDT} 2020, March
30-April 2, 2020, Copenhagen, Denmark},
series = {LIPIcs},
volume = {155},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2020.22},
doi = {10.4230/LIPICS.ICDT.2020.22},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdt/PaghS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icits/GhaziGKMPV20,
author = {Badih Ghazi and
Noah Golowich and
Ravi Kumar and
Pasin Manurangsi and
Rasmus Pagh and
Ameya Velingker},
editor = {Yael Tauman Kalai and
Adam D. Smith and
Daniel Wichs},
title = {Pure Differentially Private Summation from Anonymous Messages},
booktitle = {1st Conference on Information-Theoretic Cryptography, {ITC} 2020,
June 17-19, 2020, Boston, MA, {USA}},
series = {LIPIcs},
volume = {163},
pages = {15:1--15:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITC.2020.15},
doi = {10.4230/LIPICS.ITC.2020.15},
timestamp = {Sat, 15 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icits/GhaziGKMPV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/CohenGP20,
author = {Edith Cohen and
Ofir Geri and
Rasmus Pagh},
title = {Composable Sketches for Functions of Frequencies: Beyond the Worst
Case},
booktitle = {Proceedings of the 37th International Conference on Machine Learning,
{ICML} 2020, 13-18 July 2020, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {119},
pages = {2057--2067},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/cohen20a.html},
timestamp = {Tue, 15 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/CohenGP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Ghazi0MP20,
author = {Badih Ghazi and
Ravi Kumar and
Pasin Manurangsi and
Rasmus Pagh},
title = {Private Counting from Anonymous Messages: Near-Optimal Accuracy with
Vanishing Communication Overhead},
booktitle = {Proceedings of the 37th International Conference on Machine Learning,
{ICML} 2020, 13-18 July 2020, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {119},
pages = {3505--3514},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/ghazi20a.html},
timestamp = {Tue, 15 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/Ghazi0MP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/CohenPW20,
author = {Edith Cohen and
Rasmus Pagh and
David P. Woodruff},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {{WOR} and \emph{p}'s: Sketches for {\(\mathscr{l}\)}\({}_{\mbox{p}}\)-Sampling
Without Replacement},
booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference
on Neural Information Processing Systems 2020, NeurIPS 2020, December
6-12, 2020, virtual},
year = {2020},
url = {https://proceedings.neurips.cc/paper/2020/hash/f1507aba9fc82ffa7cc7373c58f8a613-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/CohenPW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/0001P020,
author = {Martin Aum{\"{u}}ller and
Rasmus Pagh and
Francesco Silvestri},
editor = {Dan Suciu and
Yufei Tao and
Zhewei Wei},
title = {Fair Near Neighbor Search: Independent Range Sampling in High Dimensions},
booktitle = {Proceedings of the 39th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2020, Portland, OR, USA, June 14-19, 2020},
pages = {191--204},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3375395.3387648},
doi = {10.1145/3375395.3387648},
timestamp = {Thu, 29 Sep 2022 08:01:46 +0200},
biburl = {https://dblp.org/rec/conf/pods/0001P020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/GoswamiJP20,
author = {Mayank Goswami and
Riko Jacob and
Rasmus Pagh},
editor = {Dan Suciu and
Yufei Tao and
Zhewei Wei},
title = {On the {I/O} Complexity of the k-Nearest Neighbors Problem},
booktitle = {Proceedings of the 39th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2020, Portland, OR, USA, June 14-19, 2020},
pages = {205--212},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3375395.3387649},
doi = {10.1145/3375395.3387649},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/GoswamiJP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sisap/ChristianiPT20,
author = {Tobias Christiani and
Rasmus Pagh and
Mikkel Thorup},
editor = {Shin'ichi Satoh and
Lucia Vadicamo and
Arthur Zimek and
Fabio Carrara and
Ilaria Bartolini and
Martin Aum{\"{u}}ller and
Bj{\"{o}}rn {\TH}{\'{o}}r J{\'{o}}nsson and
Rasmus Pagh},
title = {Confirmation Sampling for Exact Nearest Neighbor Search},
booktitle = {Similarity Search and Applications - 13th International Conference,
{SISAP} 2020, Copenhagen, Denmark, September 30 - October 2, 2020,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12440},
pages = {97--110},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60936-8\_8},
doi = {10.1007/978-3-030-60936-8\_8},
timestamp = {Thu, 29 Jul 2021 12:11:15 +0200},
biburl = {https://dblp.org/rec/conf/sisap/ChristianiPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AhleKKPVWZ20,
author = {Thomas D. Ahle and
Michael Kapralov and
Jakob B{\ae}k Tejs Knudsen and
Rasmus Pagh and
Ameya Velingker and
David P. Woodruff and
Amir Zandieh},
editor = {Shuchi Chawla},
title = {Oblivious Sketching of High-Degree Polynomial Kernels},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {141--160},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.9},
doi = {10.1137/1.9781611975994.9},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/AhleKKPVWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sisap/2020,
editor = {Shin'ichi Satoh and
Lucia Vadicamo and
Arthur Zimek and
Fabio Carrara and
Ilaria Bartolini and
Martin Aum{\"{u}}ller and
Bj{\"{o}}rn {\TH}{\'{o}}r J{\'{o}}nsson and
Rasmus Pagh},
title = {Similarity Search and Applications - 13th International Conference,
{SISAP} 2020, Copenhagen, Denmark, September 30 - October 2, 2020,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12440},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60936-8},
doi = {10.1007/978-3-030-60936-8},
isbn = {978-3-030-60935-1},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sisap/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-11932,
author = {Rasmus Pagh and
Nina Mesing Stausholm},
title = {Efficient Differentially Private F\({}_{\mbox{0}}\) Linear Sketching},
journal = {CoRR},
volume = {abs/2001.11932},
year = {2020},
url = {https://arxiv.org/abs/2001.11932},
eprinttype = {arXiv},
eprint = {2001.11932},
timestamp = {Mon, 03 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-11932.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-01919,
author = {Badih Ghazi and
Noah Golowich and
Ravi Kumar and
Pasin Manurangsi and
Rasmus Pagh and
Ameya Velingker},
title = {Pure Differentially Private Summation from Anonymous Messages},
journal = {CoRR},
volume = {abs/2002.01919},
year = {2020},
url = {https://arxiv.org/abs/2002.01919},
eprinttype = {arXiv},
eprint = {2002.01919},
timestamp = {Sat, 15 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-01919.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-04870,
author = {Mayank Goswami and
Riko Jacob and
Rasmus Pagh},
title = {On the {I/O} complexity of the k-nearest neighbor problem},
journal = {CoRR},
volume = {abs/2002.04870},
year = {2020},
url = {https://arxiv.org/abs/2002.04870},
eprinttype = {arXiv},
eprint = {2002.04870},
timestamp = {Mon, 28 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-04870.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-04772,
author = {Edith Cohen and
Ofir Geri and
Rasmus Pagh},
title = {Composable Sketches for Functions of Frequencies: Beyond the Worst
Case},
journal = {CoRR},
volume = {abs/2004.04772},
year = {2020},
url = {https://arxiv.org/abs/2004.04772},
eprinttype = {arXiv},
eprint = {2004.04772},
timestamp = {Tue, 14 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-04772.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-06744,
author = {Edith Cohen and
Rasmus Pagh and
David P. Woodruff},
title = {{WOR} and p's: Sketches for {\unicode{120001}}\({}_{\mbox{p}}\)-Sampling
Without Replacement},
journal = {CoRR},
volume = {abs/2007.06744},
year = {2020},
url = {https://arxiv.org/abs/2007.06744},
eprinttype = {arXiv},
eprint = {2007.06744},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-06744.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0001CPV19,
author = {Martin Aum{\"{u}}ller and
Tobias Christiani and
Rasmus Pagh and
Michael Vesterli},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {{PUFFINN:} Parameterless and Universally Fast FInding of Nearest Neighbors},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {10:1--10:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.10},
doi = {10.4230/LIPICS.ESA.2019.10},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/0001CPV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PaghST19,
author = {Rasmus Pagh and
Nina Mesing Stausholm and
Mikkel Thorup},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Hardness of Bichromatic Closest Pair with Jaccard Similarity},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {74:1--74:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.74},
doi = {10.4230/LIPICS.ESA.2019.74},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/PaghST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/TabeiYP19,
author = {Yasuo Tabei and
Yoshihiro Yamanishi and
Rasmus Pagh},
editor = {Jianyong Wang and
Kyuseok Shim and
Xindong Wu},
title = {Space-Efficient Feature Maps for String Alignment Kernels},
booktitle = {2019 {IEEE} International Conference on Data Mining, {ICDM} 2019,
Beijing, China, November 8-11, 2019},
pages = {1312--1317},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ICDM.2019.00166},
doi = {10.1109/ICDM.2019.00166},
timestamp = {Tue, 26 Jan 2021 13:51:21 +0100},
biburl = {https://dblp.org/rec/conf/icdm/TabeiYP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/bdt/Pagh19,
author = {Rasmus Pagh},
editor = {Sherif Sakr and
Albert Y. Zomaya},
title = {Similarity Sketching},
booktitle = {Encyclopedia of Big Data Technologies},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-319-63962-8\_58-1},
doi = {10.1007/978-3-319-63962-8\_58-1},
timestamp = {Thu, 14 Feb 2019 16:03:55 +0100},
biburl = {https://dblp.org/rec/reference/bdt/Pagh19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-01859,
author = {Martin Aum{\"{u}}ller and
Rasmus Pagh and
Francesco Silvestri},
title = {Fair Near Neighbor Search: Independent Range Sampling in High Dimensions},
journal = {CoRR},
volume = {abs/1906.01859},
year = {2019},
url = {http://arxiv.org/abs/1906.01859},
eprinttype = {arXiv},
eprint = {1906.01859},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-01859.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-08320,
author = {Badih Ghazi and
Rasmus Pagh and
Ameya Velingker},
title = {Scalable and Differentially Private Distributed Aggregation in the
Shuffled Model},
journal = {CoRR},
volume = {abs/1906.08320},
year = {2019},
url = {http://arxiv.org/abs/1906.08320},
eprinttype = {arXiv},
eprint = {1906.08320},
timestamp = {Mon, 24 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-08320.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-12211,
author = {Martin Aum{\"{u}}ller and
Tobias Christiani and
Rasmus Pagh and
Michael Vesterli},
title = {{PUFFINN:} Parameterless and Universally Fast FInding of Nearest Neighbors},
journal = {CoRR},
volume = {abs/1906.12211},
year = {2019},
url = {http://arxiv.org/abs/1906.12211},
eprinttype = {arXiv},
eprint = {1906.12211},
timestamp = {Mon, 01 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-12211.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-02251,
author = {Rasmus Pagh and
Nina Stausholm and
Mikkel Thorup},
title = {Hardness of Bichromatic Closest Pair with Jaccard Similarity},
journal = {CoRR},
volume = {abs/1907.02251},
year = {2019},
url = {http://arxiv.org/abs/1907.02251},
eprinttype = {arXiv},
eprint = {1907.02251},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-02251.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-11358,
author = {Badih Ghazi and
Noah Golowich and
Ravi Kumar and
Rasmus Pagh and
Ameya Velingker},
title = {Private Heavy Hitters and Range Queries in the Shuffled Model},
journal = {CoRR},
volume = {abs/1908.11358},
year = {2019},
url = {http://arxiv.org/abs/1908.11358},
eprinttype = {arXiv},
eprint = {1908.11358},
timestamp = {Sat, 15 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-11358.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-01410,
author = {Michael Kapralov and
Rasmus Pagh and
Ameya Velingker and
David P. Woodruff and
Amir Zandieh},
title = {Oblivious Sketching of High-Degree Polynomial Kernels},
journal = {CoRR},
volume = {abs/1909.01410},
year = {2019},
url = {http://arxiv.org/abs/1909.01410},
eprinttype = {arXiv},
eprint = {1909.01410},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-01410.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-10766,
author = {Rasmus Pagh and
Johan Sivertsen},
title = {The space complexity of inner product filters},
journal = {CoRR},
volume = {abs/1909.10766},
year = {2019},
url = {http://arxiv.org/abs/1909.10766},
eprinttype = {arXiv},
eprint = {1909.10766},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-10766.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-11073,
author = {Badih Ghazi and
Pasin Manurangsi and
Rasmus Pagh and
Ameya Velingker},
title = {Private Aggregation from Fewer Anonymous Messages},
journal = {CoRR},
volume = {abs/1909.11073},
year = {2019},
url = {http://arxiv.org/abs/1909.11073},
eprinttype = {arXiv},
eprint = {1909.11073},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-11073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-04977,
author = {Peter Kairouz and
H. Brendan McMahan and
Brendan Avent and
Aur{\'{e}}lien Bellet and
Mehdi Bennis and
Arjun Nitin Bhagoji and
Kallista A. Bonawitz and
Zachary Charles and
Graham Cormode and
Rachel Cummings and
Rafael G. L. D'Oliveira and
Salim El Rouayheb and
David Evans and
Josh Gardner and
Zachary Garrett and
Adri{\`{a}} Gasc{\'{o}}n and
Badih Ghazi and
Phillip B. Gibbons and
Marco Gruteser and
Za{\"{\i}}d Harchaoui and
Chaoyang He and
Lie He and
Zhouyuan Huo and
Ben Hutchinson and
Justin Hsu and
Martin Jaggi and
Tara Javidi and
Gauri Joshi and
Mikhail Khodak and
Jakub Kone{\v{c}}n{\'y} and
Aleksandra Korolova and
Farinaz Koushanfar and
Sanmi Koyejo and
Tancr{\`{e}}de Lepoint and
Yang Liu and
Prateek Mittal and
Mehryar Mohri and
Richard Nock and
Ayfer {\"{O}}zg{\"{u}}r and
Rasmus Pagh and
Mariana Raykova and
Hang Qi and
Daniel Ramage and
Ramesh Raskar and
Dawn Song and
Weikang Song and
Sebastian U. Stich and
Ziteng Sun and
Ananda Theertha Suresh and
Florian Tram{\`{e}}r and
Praneeth Vepakomma and
Jianyu Wang and
Li Xiong and
Zheng Xu and
Qiang Yang and
Felix X. Yu and
Han Yu and
Sen Zhao},
title = {Advances and Open Problems in Federated Learning},
journal = {CoRR},
volume = {abs/1912.04977},
year = {2019},
url = {http://arxiv.org/abs/1912.04977},
eprinttype = {arXiv},
eprint = {1912.04977},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-04977.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/GhaziGKPV19,
author = {Badih Ghazi and
Noah Golowich and
Ravi Kumar and
Rasmus Pagh and
Ameya Velingker},
title = {On the Power of Multiple Anonymous Messages},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1382},
year = {2019},
url = {https://eprint.iacr.org/2019/1382},
timestamp = {Sat, 15 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/GhaziGKPV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/MitzenmacherP18,
author = {Michael Mitzenmacher and
Rasmus Pagh},
title = {Simple multi-party set reconciliation},
journal = {Distributed Comput.},
volume = {31},
number = {6},
pages = {441--453},
year = {2018},
url = {https://doi.org/10.1007/s00446-017-0316-0},
doi = {10.1007/S00446-017-0316-0},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/MitzenmacherP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Pagh18,
author = {Rasmus Pagh},
title = {CoveringLSH: Locality-Sensitive Hashing without False Negatives},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {3},
pages = {29:1--29:17},
year = {2018},
url = {https://doi.org/10.1145/3155300},
doi = {10.1145/3155300},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Pagh18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkdd/ParkSPCMK18,
author = {Ha{-}Myung Park and
Francesco Silvestri and
Rasmus Pagh and
Chin{-}Wan Chung and
Sung{-}Hyon Myaeng and
U Kang},
title = {Enumerating Trillion Subgraphs On Distributed Systems},
journal = {{ACM} Trans. Knowl. Discov. Data},
volume = {12},
number = {6},
pages = {71:1--71:30},
year = {2018},
url = {https://doi.org/10.1145/3237191},
doi = {10.1145/3237191},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkdd/ParkSPCMK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/ChristianiPS18,
author = {Tobias Christiani and
Rasmus Pagh and
Johan Sivertsen},
title = {Scalable and Robust Set Similarity Join},
booktitle = {34th {IEEE} International Conference on Data Engineering, {ICDE} 2018,
Paris, France, April 16-19, 2018},
pages = {1240--1243},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/ICDE.2018.00120},
doi = {10.1109/ICDE.2018.00120},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/ChristianiPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/McCauleyMP18,
author = {Samuel McCauley and
Jesper W. Mikkelsen and
Rasmus Pagh},
editor = {Jan Van den Bussche and
Marcelo Arenas},
title = {Set Similarity Search for Skewed Data},
booktitle = {Proceedings of the 37th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, Houston, TX, USA, June 10-15, 2018},
pages = {63--74},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3196959.3196985},
doi = {10.1145/3196959.3196985},
timestamp = {Wed, 21 Nov 2018 12:44:18 +0100},
biburl = {https://dblp.org/rec/conf/pods/McCauleyMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/0001CP018,
author = {Martin Aum{\"{u}}ller and
Tobias Christiani and
Rasmus Pagh and
Francesco Silvestri},
editor = {Jan Van den Bussche and
Marcelo Arenas},
title = {Distance-Sensitive Hashing},
booktitle = {Proceedings of the 37th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, Houston, TX, USA, June 10-15, 2018},
pages = {89--104},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3196959.3196976},
doi = {10.1145/3196959.3196976},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/0001CP018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2018,
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055},
doi = {10.1137/1.9781611975055},
isbn = {978-1-61197-505-5},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-06382,
author = {Yasuo Tabei and
Yoshihiro Yamanishi and
Rasmus Pagh},
title = {Scalable Alignment Kernels via Space-Efficient Feature Maps},
journal = {CoRR},
volume = {abs/1802.06382},
year = {2018},
url = {http://arxiv.org/abs/1802.06382},
eprinttype = {arXiv},
eprint = {1802.06382},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-06382.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03054,
author = {Samuel McCauley and
Jesper W. Mikkelsen and
Rasmus Pagh},
title = {Set Similarity Search for Skewed Data},
journal = {CoRR},
volume = {abs/1804.03054},
year = {2018},
url = {http://arxiv.org/abs/1804.03054},
eprinttype = {arXiv},
eprint = {1804.03054},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03054.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-04720,
author = {Djamal Belazzougui and
Paolo Boldi and
Rasmus Pagh and
Sebastiano Vigna},
title = {Fast Prefix Search in Little Space, with Applications},
journal = {CoRR},
volume = {abs/1804.04720},
year = {2018},
url = {http://arxiv.org/abs/1804.04720},
eprinttype = {arXiv},
eprint = {1804.04720},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-04720.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-02603,
author = {Tobias Christiani and
Rasmus Pagh and
Mikkel Thorup},
title = {Confirmation Sampling for Exact Nearest Neighbor Search},
journal = {CoRR},
volume = {abs/1812.02603},
year = {2018},
url = {http://arxiv.org/abs/1812.02603},
eprinttype = {arXiv},
eprint = {1812.02603},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-02603.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PaghPSS17,
author = {Rasmus Pagh and
Ninh Pham and
Francesco Silvestri and
Morten St{\"{o}}ckel},
title = {I/O-Efficient Similarity Join},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1263--1283},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0285-5},
doi = {10.1007/S00453-017-0285-5},
timestamp = {Fri, 12 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PaghPSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GasieniecLLPT17,
author = {Leszek Gasieniec and
Christos Levcopoulos and
Andrzej Lingas and
Rasmus Pagh and
Takeshi Tokuyama},
title = {Efficiently Correcting Matrix Products},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {428--443},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0202-3},
doi = {10.1007/S00453-016-0202-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GasieniecLLPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/is/PaghSSS17,
author = {Rasmus Pagh and
Francesco Silvestri and
Johan Sivertsen and
Matthew Skala},
title = {Approximate furthest neighbor with application to annulus query},
journal = {Inf. Syst.},
volume = {64},
pages = {152--162},
year = {2017},
url = {https://doi.org/10.1016/j.is.2016.07.006},
doi = {10.1016/J.IS.2016.07.006},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/is/PaghSSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GudmundssonP17,
author = {Joachim Gudmundsson and
Rasmus Pagh},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {Range-Efficient Consistent Sampling and Locality-Sensitive Hashing
for Polygons},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {42:1--42:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.42},
doi = {10.4230/LIPICS.ISAAC.2017.42},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/GudmundssonP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Pagh17,
author = {Rasmus Pagh},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Hardness and Approximation of High-Dimensional Search Problems (Invited
Talk)},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {83:1--83:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.83},
doi = {10.4230/LIPICS.MFCS.2017.83},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/Pagh17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AhleAP17,
author = {Thomas D. Ahle and
Martin Aum{\"{u}}ller and
Rasmus Pagh},
editor = {Philip N. Klein},
title = {Parameter-free Locality Sensitive Hashing for Spherical Range Reporting},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {239--256},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.16},
doi = {10.1137/1.9781611974782.16},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/AhleAP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoswamiP0S17,
author = {Mayank Goswami and
Rasmus Pagh and
Francesco Silvestri and
Johan Sivertsen},
editor = {Philip N. Klein},
title = {Distance Sensitive Bloom Filters Without False Negatives},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {257--269},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.17},
doi = {10.1137/1.9781611974782.17},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GoswamiP0S17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChristianiP17,
author = {Tobias Christiani and
Rasmus Pagh},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Set similarity search beyond MinHash},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {1094--1107},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055443},
doi = {10.1145/3055399.3055443},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChristianiP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GudmundssonP17,
author = {Joachim Gudmundsson and
Rasmus Pagh},
title = {Range-efficient consistent sampling and locality-sensitive hashing
for polygons},
journal = {CoRR},
volume = {abs/1701.05290},
year = {2017},
url = {http://arxiv.org/abs/1701.05290},
eprinttype = {arXiv},
eprint = {1701.05290},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GudmundssonP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AumullerCP017,
author = {Martin Aum{\"{u}}ller and
Tobias Christiani and
Rasmus Pagh and
Francesco Silvestri},
title = {Distance-sensitive hashing},
journal = {CoRR},
volume = {abs/1703.07867},
year = {2017},
url = {http://arxiv.org/abs/1703.07867},
eprinttype = {arXiv},
eprint = {1703.07867},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AumullerCP017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChristianiPS17,
author = {Tobias Christiani and
Rasmus Pagh and
Johan Sivertsen},
title = {Scalable and robust set similarity join},
journal = {CoRR},
volume = {abs/1707.06814},
year = {2017},
url = {http://arxiv.org/abs/1707.06814},
eprinttype = {arXiv},
eprint = {1707.06814},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChristianiPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/DietzfelbingerM17,
author = {Martin Dietzfelbinger and
Michael Mitzenmacher and
Rasmus Pagh and
David P. Woodruff and
Martin Aum{\"{u}}ller},
title = {Theory and Applications of Hashing (Dagstuhl Seminar 17181)},
journal = {Dagstuhl Reports},
volume = {7},
number = {5},
pages = {1--21},
year = {2017},
url = {https://doi.org/10.4230/DagRep.7.5.1},
doi = {10.4230/DAGREP.7.5.1},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/DietzfelbingerM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BulteauFKP16,
author = {Laurent Bulteau and
Vincent Froese and
Konstantin Kutzkov and
Rasmus Pagh},
title = {Triangle Counting in Dynamic Graph Streams},
journal = {Algorithmica},
volume = {76},
number = {1},
pages = {259--278},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0036-4},
doi = {10.1007/S00453-015-0036-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BulteauFKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/PhamP16,
author = {Ninh Pham and
Rasmus Pagh},
editor = {Snehasis Mukhopadhyay and
ChengXiang Zhai and
Elisa Bertino and
Fabio Crestani and
Javed Mostafa and
Jie Tang and
Luo Si and
Xiaofang Zhou and
Yi Chang and
Yunyao Li and
Parikshit Sondhi},
title = {Scalability and Total Recall with Fast CoveringLSH},
booktitle = {Proceedings of the 25th {ACM} International Conference on Information
and Knowledge Management, {CIKM} 2016, Indianapolis, IN, USA, October
24-28, 2016},
pages = {1109--1118},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2983323.2983742},
doi = {10.1145/2983323.2983742},
timestamp = {Tue, 30 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cikm/PhamP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/AhlePR016,
author = {Thomas Dybdahl Ahle and
Rasmus Pagh and
Ilya P. Razenshteyn and
Francesco Silvestri},
editor = {Tova Milo and
Wang{-}Chiew Tan},
title = {On the Complexity of Inner Product Similarity Join},
booktitle = {Proceedings of the 35th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2016, San Francisco, CA, USA, June 26
- July 01, 2016},
pages = {151--164},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2902251.2902285},
doi = {10.1145/2902251.2902285},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/AhlePR016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Pagh16,
author = {Rasmus Pagh},
editor = {Robert Krauthgamer},
title = {Locality-sensitive Hashing without False Negatives},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1--9},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch1},
doi = {10.1137/1.9781611974331.CH1},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/Pagh16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2016,
editor = {Rasmus Pagh},
title = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-011-8},
isbn = {978-3-95977-011-8},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Pagh16,
author = {Rasmus Pagh},
title = {Cuckoo Hashing},
booktitle = {Encyclopedia of Algorithms},
pages = {478--481},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_97},
doi = {10.1007/978-1-4939-2864-4\_97},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Pagh16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GasieniecLLPT16,
author = {Leszek Gasieniec and
Christos Levcopoulos and
Andrzej Lingas and
Rasmus Pagh and
Takeshi Tokuyama},
title = {Efficiently Correcting Matrix Products},
journal = {CoRR},
volume = {abs/1602.00435},
year = {2016},
url = {http://arxiv.org/abs/1602.00435},
eprinttype = {arXiv},
eprint = {1602.00435},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GasieniecLLPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PhamP16,
author = {Ninh Pham and
Rasmus Pagh},
title = {Scalability and Total Recall with Fast CoveringLSH},
journal = {CoRR},
volume = {abs/1602.02620},
year = {2016},
url = {http://arxiv.org/abs/1602.02620},
eprinttype = {arXiv},
eprint = {1602.02620},
timestamp = {Tue, 30 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PhamP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AhleAP16,
author = {Thomas D. Ahle and
Martin Aum{\"{u}}ller and
Rasmus Pagh},
title = {High-dimensional Spherical Range Reporting by Output-Sensitive Multi-Probing
{LSH}},
journal = {CoRR},
volume = {abs/1605.02673},
year = {2016},
url = {http://arxiv.org/abs/1605.02673},
eprinttype = {arXiv},
eprint = {1605.02673},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AhleAP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoswamiP0S16,
author = {Mayank Goswami and
Rasmus Pagh and
Francesco Silvestri and
Johan Sivertsen},
title = {Distance Sensitive Bloom Filters Without False Negatives},
journal = {CoRR},
volume = {abs/1607.05451},
year = {2016},
url = {http://arxiv.org/abs/1607.05451},
eprinttype = {arXiv},
eprint = {1607.05451},
timestamp = {Mon, 28 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoswamiP0S16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Pagh0SS16,
author = {Rasmus Pagh and
Francesco Silvestri and
Johan Sivertsen and
Matthew Skala},
title = {Approximate Furthest Neighbor with Application to Annulus Query},
journal = {CoRR},
volume = {abs/1611.07303},
year = {2016},
url = {http://arxiv.org/abs/1611.07303},
eprinttype = {arXiv},
eprint = {1611.07303},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Pagh0SS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChristianiP16,
author = {Tobias Christiani and
Rasmus Pagh},
title = {Set Similarity Search Beyond MinHash},
journal = {CoRR},
volume = {abs/1612.07710},
year = {2016},
url = {http://arxiv.org/abs/1612.07710},
eprinttype = {arXiv},
eprint = {1612.07710},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChristianiP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PaghPSS15,
author = {Rasmus Pagh and
Ninh Pham and
Francesco Silvestri and
Morten St{\"{o}}ckel},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {I/O-Efficient Similarity Join},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {941--952},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_78},
doi = {10.1007/978-3-662-48350-3\_78},
timestamp = {Tue, 30 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/PaghPSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/Pagh15,
author = {Rasmus Pagh},
editor = {Marcelo Arenas and
Mart{\'{\i}}n Ugarte},
title = {Large-Scale Similarity Joins With Guarantees (Invited Talk)},
booktitle = {18th International Conference on Database Theory, {ICDT} 2015, March
23-27, 2015, Brussels, Belgium},
series = {LIPIcs},
volume = {31},
pages = {15--24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2015.15},
doi = {10.4230/LIPICS.ICDT.2015.15},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icdt/Pagh15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sisap/PaghSSS15,
author = {Rasmus Pagh and
Francesco Silvestri and
Johan Sivertsen and
Matthew Skala},
editor = {Giuseppe Amato and
Richard Connor and
Fabrizio Falchi and
Claudio Gennaro},
title = {Approximate Furthest Neighbor in High Dimensions},
booktitle = {Similarity Search and Applications - 8th International Conference,
{SISAP} 2015, Glasgow, UK, October 12-14, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9371},
pages = {3--14},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-25087-8\_1},
doi = {10.1007/978-3-319-25087-8\_1},
timestamp = {Fri, 18 Nov 2022 17:12:34 +0100},
biburl = {https://dblp.org/rec/conf/sisap/PaghSSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoswamiJLP15,
author = {Mayank Goswami and
Allan Gr{\o}nlund J{\o}rgensen and
Kasper Green Larsen and
Rasmus Pagh},
editor = {Piotr Indyk},
title = {Approximate Range Emptiness in Constant Time and Optimal Space},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {769--775},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.52},
doi = {10.1137/1.9781611973730.52},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/GoswamiJLP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChristianiPT15,
author = {Tobias Christiani and
Rasmus Pagh and
Mikkel Thorup},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {From Independence to Expansion and Back Again},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {813--820},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746620},
doi = {10.1145/2746539.2746620},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChristianiPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PaghS15,
author = {Rasmus Pagh and
Morten St{\"{o}}ckel},
title = {Association Rule Mining using Maximum Entropy},
journal = {CoRR},
volume = {abs/1501.02143},
year = {2015},
url = {http://arxiv.org/abs/1501.02143},
eprinttype = {arXiv},
eprint = {1501.02143},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PaghS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChristianiPT15,
author = {Tobias Christiani and
Rasmus Pagh and
Mikkel Thorup},
title = {From Independence to Expansion and Back Again},
journal = {CoRR},
volume = {abs/1506.03676},
year = {2015},
url = {http://arxiv.org/abs/1506.03676},
eprinttype = {arXiv},
eprint = {1506.03676},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChristianiPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PaghPSS15,
author = {Rasmus Pagh and
Ninh Pham and
Francesco Silvestri and
Morten St{\"{o}}ckel},
title = {I/O-Efficient Similarity Join},
journal = {CoRR},
volume = {abs/1507.00552},
year = {2015},
url = {http://arxiv.org/abs/1507.00552},
eprinttype = {arXiv},
eprint = {1507.00552},
timestamp = {Tue, 30 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PaghPSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Pagh15,
author = {Rasmus Pagh},
title = {Locality-sensitive Hashing without False Negatives},
journal = {CoRR},
volume = {abs/1507.03225},
year = {2015},
url = {http://arxiv.org/abs/1507.03225},
eprinttype = {arXiv},
eprint = {1507.03225},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Pagh15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AhlePR015,
author = {Thomas D. Ahle and
Rasmus Pagh and
Ilya P. Razenshteyn and
Francesco Silvestri},
title = {On the Complexity of Inner Product Similarity Join},
journal = {CoRR},
volume = {abs/1510.02824},
year = {2015},
url = {http://arxiv.org/abs/1510.02824},
eprinttype = {arXiv},
eprint = {1510.02824},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AhlePR015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LohP14,
author = {Po{-}Shen Loh and
Rasmus Pagh},
title = {Thresholds for Extreme Orientability},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {522--539},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9749-4},
doi = {10.1007/S00453-013-9749-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LohP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmossenCP14,
author = {Rasmus Resen Amossen and
Andrea Campagna and
Rasmus Pagh},
title = {Better Size Estimation for Sparse Matrix Products},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {741--757},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9692-9},
doi = {10.1007/S00453-012-9692-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmossenCP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PaghWYZ14,
author = {Rasmus Pagh and
Zhewei Wei and
Ke Yi and
Qin Zhang},
title = {Cache-Oblivious Hashing},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {864--883},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9763-6},
doi = {10.1007/S00453-013-9763-6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PaghWYZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/ParkSKP14,
author = {Ha{-}Myung Park and
Francesco Silvestri and
U Kang and
Rasmus Pagh},
editor = {Jianzhong Li and
Xiaoyang Sean Wang and
Minos N. Garofalakis and
Ian Soboroff and
Torsten Suel and
Min Wang},
title = {MapReduce Triangle Enumeration With Guarantees},
booktitle = {Proceedings of the 23rd {ACM} International Conference on Conference
on Information and Knowledge Management, {CIKM} 2014, Shanghai, China,
November 3-7, 2014},
pages = {1739--1748},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2661829.2662017},
doi = {10.1145/2661829.2662017},
timestamp = {Tue, 24 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cikm/ParkSKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PaghS14,
author = {Rasmus Pagh and
Morten St{\"{o}}ckel},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {The Input/Output Complexity of Sparse Matrix Multiplication},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {750--761},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_62},
doi = {10.1007/978-3-662-44777-2\_62},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/PaghS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChristianiP14,
author = {Tobias Christiani and
Rasmus Pagh},
title = {Generating k-Independent Variables in Constant Time},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {196--205},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.29},
doi = {10.1109/FOCS.2014.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChristianiP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BjorklundPWZ14,
author = {Andreas Bj{\"{o}}rklund and
Rasmus Pagh and
Virginia Vassilevska Williams and
Uri Zwick},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Listing Triangles},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {223--234},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_19},
doi = {10.1007/978-3-662-43948-7\_19},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BjorklundPWZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PaghSW14,
author = {Rasmus Pagh and
Morten St{\"{o}}ckel and
David P. Woodruff},
editor = {Richard Hull and
Martin Grohe},
title = {Is min-wise hashing optimal for summarizing set intersection?},
booktitle = {Proceedings of the 33rd {ACM} {SIGMOD-SIGACT-SIGART} Symposium on
Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22-27,
2014},
pages = {109--120},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2594538.2594554},
doi = {10.1145/2594538.2594554},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PaghSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PaghS14,
author = {Rasmus Pagh and
Francesco Silvestri},
editor = {Richard Hull and
Martin Grohe},
title = {The input/output complexity of triangle enumeration},
booktitle = {Proceedings of the 33rd {ACM} {SIGMOD-SIGACT-SIGART} Symposium on
Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22-27,
2014},
pages = {224--233},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2594538.2594552},
doi = {10.1145/2594538.2594552},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PaghS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KutzkovP14,
author = {Konstantin Kutzkov and
Rasmus Pagh},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Consistent Subset Sampling},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {294--305},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_26},
doi = {10.1007/978-3-319-08404-6\_26},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KutzkovP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KutzkovP14a,
author = {Konstantin Kutzkov and
Rasmus Pagh},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Triangle Counting in Dynamic Graph Streams},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {306--318},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_27},
doi = {10.1007/978-3-319-08404-6\_27},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KutzkovP14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/MitzenmacherPP14,
author = {Michael Mitzenmacher and
Rasmus Pagh and
Ninh Pham},
editor = {Chin{-}Wan Chung and
Andrei Z. Broder and
Kyuseok Shim and
Torsten Suel},
title = {Efficient estimation for high similarities using odd sketches},
booktitle = {23rd International World Wide Web Conference, {WWW} '14, Seoul, Republic
of Korea, April 7-11, 2014},
pages = {109--118},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2566486.2568017},
doi = {10.1145/2566486.2568017},
timestamp = {Fri, 12 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/MitzenmacherPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PaghS14,
author = {Rasmus Pagh and
Morten St{\"{o}}ckel},
title = {The Input/Output Complexity of Sparse Matrix Multiplication},
journal = {CoRR},
volume = {abs/1403.3551},
year = {2014},
url = {http://arxiv.org/abs/1403.3551},
eprinttype = {arXiv},
eprint = {1403.3551},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PaghS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KutzkovP14,
author = {Konstantin Kutzkov and
Rasmus Pagh},
title = {Consistent Subset Sampling},
journal = {CoRR},
volume = {abs/1404.4693},
year = {2014},
url = {http://arxiv.org/abs/1404.4693},
eprinttype = {arXiv},
eprint = {1404.4693},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KutzkovP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KutzkovP14a,
author = {Laurent Bulteau and
Vincent Froese and
Konstantin Kutzkov and
Rasmus Pagh},
title = {Triangle counting in dynamic graph streams},
journal = {CoRR},
volume = {abs/1404.4696},
year = {2014},
url = {http://arxiv.org/abs/1404.4696},
eprinttype = {arXiv},
eprint = {1404.4696},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KutzkovP14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoswamiJLP14,
author = {Mayank Goswami and
Allan Gr{\o}nlund J{\o}rgensen and
Kasper Green Larsen and
Rasmus Pagh},
title = {Approximate Range Emptiness in Constant Time and Optimal Space},
journal = {CoRR},
volume = {abs/1407.2907},
year = {2014},
url = {http://arxiv.org/abs/1407.2907},
eprinttype = {arXiv},
eprint = {1407.2907},
timestamp = {Mon, 28 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoswamiJLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChristianiP14,
author = {Tobias Christiani and
Rasmus Pagh},
title = {Generating k-independent variables in constant time},
journal = {CoRR},
volume = {abs/1408.2157},
year = {2014},
url = {http://arxiv.org/abs/1408.2157},
eprinttype = {arXiv},
eprint = {1408.2157},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChristianiP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/is/BotelhoPZ13,
author = {Fabiano C. Botelho and
Rasmus Pagh and
Nivio Ziviani},
title = {Practical perfect hashing in nearly optimal space},
journal = {Inf. Syst.},
volume = {38},
number = {1},
pages = {108--131},
year = {2013},
url = {https://doi.org/10.1016/j.is.2012.06.002},
doi = {10.1016/J.IS.2012.06.002},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/is/BotelhoPZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/Pagh13,
author = {Rasmus Pagh},
title = {Compressed matrix multiplication},
journal = {{ACM} Trans. Comput. Theory},
volume = {5},
number = {3},
pages = {9:1--9:17},
year = {2013},
url = {https://doi.org/10.1145/2493252.2493254},
doi = {10.1145/2493252.2493254},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/Pagh13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CampagnaKP13,
author = {Andrea Campagna and
Konstantin Kutzkov and
Rasmus Pagh},
editor = {Peter Sanders and
Norbert Zeh},
title = {On parallelizing matrix multiplication by the column-row method},
booktitle = {Proceedings of the 15th Meeting on Algorithm Engineering and Experiments,
{ALENEX} 2013, New Orleans, Louisiana, USA, January 7, 2013},
pages = {122--132},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611972931.11},
doi = {10.1137/1.9781611972931.11},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/CampagnaKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PaghSW13,
author = {Rasmus Pagh and
Gil Segev and
Udi Wieder},
title = {How to Approximate a Set without Knowing Its Size in Advance},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {80--89},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.17},
doi = {10.1109/FOCS.2013.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PaghSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/PhamP13,
author = {Ninh Pham and
Rasmus Pagh},
editor = {Inderjit S. Dhillon and
Yehuda Koren and
Rayid Ghani and
Ted E. Senator and
Paul Bradley and
Rajesh Parekh and
Jingrui He and
Robert L. Grossman and
Ramasamy Uthurusamy},
title = {Fast and scalable polynomial kernels via explicit feature maps},
booktitle = {The 19th {ACM} {SIGKDD} International Conference on Knowledge Discovery
and Data Mining, {KDD} 2013, Chicago, IL, USA, August 11-14, 2013},
pages = {239--247},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2487575.2487591},
doi = {10.1145/2487575.2487591},
timestamp = {Tue, 30 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/PhamP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsdm/KutzkovP13,
author = {Konstantin Kutzkov and
Rasmus Pagh},
editor = {Stefano Leonardi and
Alessandro Panconesi and
Paolo Ferragina and
Aristides Gionis},
title = {On the streaming complexity of computing local clustering coefficients},
booktitle = {Sixth {ACM} International Conference on Web Search and Data Mining,
{WSDM} 2013, Rome, Italy, February 4-8, 2013},
pages = {677--686},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2433396.2433480},
doi = {10.1145/2433396.2433480},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/wsdm/KutzkovP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-1188,
author = {Rasmus Pagh and
Gil Segev and
Udi Wieder},
title = {How to Approximate {A} Set Without Knowing Its Size In Advance},
journal = {CoRR},
volume = {abs/1304.1188},
year = {2013},
url = {http://arxiv.org/abs/1304.1188},
eprinttype = {arXiv},
eprint = {1304.1188},
timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-1188.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MitzenmacherP13,
author = {Michael Mitzenmacher and
Rasmus Pagh},
title = {Simple Multi-Party Set Reconciliation},
journal = {CoRR},
volume = {abs/1311.2037},
year = {2013},
url = {http://arxiv.org/abs/1311.2037},
eprinttype = {arXiv},
eprint = {1311.2037},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MitzenmacherP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PaghS13,
author = {Rasmus Pagh and
Francesco Silvestri},
title = {The Input/Output Complexity of Triangle Enumeration},
journal = {CoRR},
volume = {abs/1312.0723},
year = {2013},
url = {http://arxiv.org/abs/1312.0723},
eprinttype = {arXiv},
eprint = {1312.0723},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PaghS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaghT12,
author = {Rasmus Pagh and
Charalampos E. Tsourakakis},
title = {Colorful triangle counting and a MapReduce implementation},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {277--281},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.007},
doi = {10.1016/J.IPL.2011.12.007},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PaghT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/kais/CampagnaP12,
author = {Andrea Campagna and
Rasmus Pagh},
title = {Finding associations and computing similarity via biased pair sampling},
journal = {Knowl. Inf. Syst.},
volume = {31},
number = {3},
pages = {505--526},
year = {2012},
url = {https://doi.org/10.1007/s10115-011-0428-y},
doi = {10.1007/S10115-011-0428-Y},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/kais/CampagnaP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Pagh12,
author = {Rasmus Pagh},
editor = {Shafi Goldwasser},
title = {Compressed matrix multiplication},
booktitle = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
January 8-10, 2012},
pages = {442--451},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2090236.2090271},
doi = {10.1145/2090236.2090271},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Pagh12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/PhamP12,
author = {Ninh Pham and
Rasmus Pagh},
editor = {Qiang Yang and
Deepak Agarwal and
Jian Pei},
title = {A near-linear time approximation algorithm for angle-based outlier
detection in high-dimensional data},
booktitle = {The 18th {ACM} {SIGKDD} International Conference on Knowledge Discovery
and Data Mining, {KDD} '12, Beijing, China, August 12-16, 2012},
pages = {877--885},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2339530.2339669},
doi = {10.1145/2339530.2339669},
timestamp = {Fri, 12 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/PhamP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LarsenP12,
author = {Kasper Green Larsen and
Rasmus Pagh},
editor = {Yuval Rabani},
title = {I/O-efficient data structures for colored range and prefix reporting},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {583--592},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.49},
doi = {10.1137/1.9781611973099.49},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/LarsenP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-1111,
author = {Po{-}Shen Loh and
Rasmus Pagh},
title = {Thresholds for Extreme Orientability},
journal = {CoRR},
volume = {abs/1202.1111},
year = {2012},
url = {http://arxiv.org/abs/1202.1111},
eprinttype = {arXiv},
eprint = {1202.1111},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-1111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-0461,
author = {Andrea Campagna and
Konstantin Kutzkov and
Rasmus Pagh},
title = {On Parallelizing Matrix Multiplication by the Column-Row Method},
journal = {CoRR},
volume = {abs/1210.0461},
year = {2012},
url = {http://arxiv.org/abs/1210.0461},
eprinttype = {arXiv},
eprint = {1210.0461},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-0461.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BelazzouguiBPV11,
author = {Djamal Belazzougui and
Paolo Boldi and
Rasmus Pagh and
Sebastiano Vigna},
title = {Theory and practice of monotone minimal perfect hashing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2025378},
doi = {10.1145/1963190.2025378},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BelazzouguiBPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/PaghPR11,
author = {Anna Pagh and
Rasmus Pagh and
Milan Ruzic},
title = {Linear Probing with 5-wise Independence},
journal = {{SIAM} Rev.},
volume = {53},
number = {3},
pages = {547--558},
year = {2011},
url = {https://doi.org/10.1137/110827831},
doi = {10.1137/110827831},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/PaghPR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/CampagnaKP11,
author = {Andrea Campagna and
Konstantin Kutzkov and
Rasmus Pagh},
editor = {Myra Spiliopoulou and
Haixun Wang and
Diane J. Cook and
Jian Pei and
Wei Wang and
Osmar R. Za{\"{\i}}ane and
Xindong Wu},
title = {Frequent Pairs in Data Streams: Exploiting Parallelism and Skew},
booktitle = {Data Mining Workshops (ICDMW), 2011 {IEEE} 11th International Conference
on, Vancouver, BC, Canada, December 11, 2011},
pages = {145--150},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/ICDMW.2011.87},
doi = {10.1109/ICDMW.2011.87},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdm/CampagnaKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/AmossenP11,
author = {Rasmus Resen Amossen and
Rasmus Pagh},
title = {A New Data Layout for Set Intersection on GPUs},
booktitle = {25th {IEEE} International Symposium on Parallel and Distributed Processing,
{IPDPS} 2011, Anchorage, Alaska, USA, 16-20 May, 2011 - Conference
Proceedings},
pages = {698--708},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/IPDPS.2011.71},
doi = {10.1109/IPDPS.2011.71},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/AmossenP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1003,
author = {Rasmus Resen Amossen and
Rasmus Pagh},
title = {A New Data Layout For Set Intersection on GPUs},
journal = {CoRR},
volume = {abs/1102.1003},
year = {2011},
url = {http://arxiv.org/abs/1102.1003},
eprinttype = {arXiv},
eprint = {1102.1003},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-1003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-6073,
author = {Rasmus Pagh and
Charalampos E. Tsourakakis},
title = {Colorful Triangle Counting and a MapReduce Implementation},
journal = {CoRR},
volume = {abs/1103.6073},
year = {2011},
url = {http://arxiv.org/abs/1103.6073},
eprinttype = {arXiv},
eprint = {1103.6073},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-6073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-3084,
author = {Kasper Green Larsen and
Rasmus Pagh},
title = {I/O-Efficient Data Structures for Colored Range and Prefix Reporting},
journal = {CoRR},
volume = {abs/1104.3084},
year = {2011},
url = {http://arxiv.org/abs/1104.3084},
eprinttype = {arXiv},
eprint = {1104.3084},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-3084.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-1320,
author = {Rasmus Pagh},
title = {Compressed Matrix Multiplication},
journal = {CoRR},
volume = {abs/1108.1320},
year = {2011},
url = {http://arxiv.org/abs/1108.1320},
eprinttype = {arXiv},
eprint = {1108.1320},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-1320.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AmossenCP10,
author = {Rasmus Resen Amossen and
Andrea Campagna and
Rasmus Pagh},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Better Size Estimation for Sparse Matrix Products},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {406--419},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_31},
doi = {10.1007/978-3-642-15369-3\_31},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AmossenCP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BelazzouguiBPV10,
author = {Djamal Belazzougui and
Paolo Boldi and
Rasmus Pagh and
Sebastiano Vigna},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Fast Prefix Search in Little Space, with Applications},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {427--438},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_37},
doi = {10.1007/978-3-642-15775-2\_37},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BelazzouguiBPV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DietzfelbingerGMMPR10,
author = {Martin Dietzfelbinger and
Andreas Goerdt and
Michael Mitzenmacher and
Andrea Montanari and
Rasmus Pagh and
Michael Rink},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Tight Thresholds for Cuckoo Hashing via {XORSAT}},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {213--225},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_19},
doi = {10.1007/978-3-642-14165-2\_19},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerGMMPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/CampagnaP10a,
author = {Andrea Campagna and
Rasmus Pagh},
editor = {Wei Fan and
Wynne Hsu and
Geoffrey I. Webb and
Bing Liu and
Chengqi Zhang and
Dimitrios Gunopulos and
Xindong Wu},
title = {On Finding Similar Items in a Stream of Transactions},
booktitle = {{ICDMW} 2010, The 10th {IEEE} International Conference on Data Mining
Workshops, Sydney, Australia, 13 December 2010},
pages = {121--128},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/ICDMW.2010.152},
doi = {10.1109/ICDMW.2010.152},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdm/CampagnaP10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/CampagnaP10,
author = {Andrea Campagna and
Rasmus Pagh},
editor = {Geoffrey I. Webb and
Bing Liu and
Chengqi Zhang and
Dimitrios Gunopulos and
Xindong Wu},
title = {On Finding Frequent Patterns in Event Sequences},
booktitle = {{ICDM} 2010, The 10th {IEEE} International Conference on Data Mining,
Sydney, Australia, 14-17 December 2010},
pages = {755--760},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/ICDM.2010.132},
doi = {10.1109/ICDM.2010.132},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdm/CampagnaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PaghWYZ10,
author = {Rasmus Pagh and
Zhewei Wei and
Ke Yi and
Qin Zhang},
editor = {Jan Paredaens and
Dirk Van Gucht},
title = {Cache-oblivious hashing},
booktitle = {Proceedings of the Twenty-Ninth {ACM} {SIGMOD-SIGACT-SIGART} Symposium
on Principles of Database Systems, {PODS} 2010, June 6-11, 2010, Indianapolis,
Indiana, {USA}},
pages = {297--304},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1807085.1807124},
doi = {10.1145/1807085.1807124},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/PaghWYZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1005-0239,
author = {Andrea Campagna and
Rasmus Pagh},
title = {On Finding Frequent Patterns in Directed Acyclic Graphs},
journal = {CoRR},
volume = {abs/1005.0239},
year = {2010},
url = {http://arxiv.org/abs/1005.0239},
eprinttype = {arXiv},
eprint = {1005.0239},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1005-0239.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-4173,
author = {Rasmus Resen Amossen and
Andrea Campagna and
Rasmus Pagh},
title = {Better size estimation for sparse matrix products},
journal = {CoRR},
volume = {abs/1006.4173},
year = {2010},
url = {http://arxiv.org/abs/1006.4173},
eprinttype = {arXiv},
eprint = {1006.4173},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-4173.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-2358,
author = {Andrea Campagna and
Rasmus Pagh},
title = {On Finding Frequent Patterns in Event Sequences},
journal = {CoRR},
volume = {abs/1010.2358},
year = {2010},
url = {http://arxiv.org/abs/1010.2358},
eprinttype = {arXiv},
eprint = {1010.2358},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-2358.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-2371,
author = {Andrea Campagna and
Rasmus Pagh},
title = {On Finding Similar Items in a Stream of Transactions},
journal = {CoRR},
volume = {abs/1010.2371},
year = {2010},
url = {http://arxiv.org/abs/1010.2371},
eprinttype = {arXiv},
eprint = {1010.2371},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-2371.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pagh09,
author = {Rasmus Pagh},
title = {Dispersing hash functions},
journal = {Random Struct. Algorithms},
volume = {35},
number = {1},
pages = {70--82},
year = {2009},
url = {https://doi.org/10.1002/rsa.20257},
doi = {10.1002/RSA.20257},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pagh09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PaghPR09,
author = {Anna Pagh and
Rasmus Pagh and
Milan Ruzic},
title = {Linear Probing with Constant Independence},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {3},
pages = {1107--1120},
year = {2009},
url = {https://doi.org/10.1137/070702278},
doi = {10.1137/070702278},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PaghPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BelazzouguiBPV09,
author = {Djamal Belazzougui and
Paolo Boldi and
Rasmus Pagh and
Sebastiano Vigna},
editor = {Irene Finocchi and
John Hershberger},
title = {Theory and Practise of Monotone Minimal Perfect Hashing},
booktitle = {Proceedings of the Eleventh Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2009, New York, New York, USA, January 3, 2009},
pages = {132--144},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972894.13},
doi = {10.1137/1.9781611972894.13},
timestamp = {Wed, 03 Jan 2018 16:51:51 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BelazzouguiBPV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HreinssonKP09,
author = {J{\'{o}}hannes B. Hreinsson and
Morten Kr{\o}yer and
Rasmus Pagh},
editor = {Amos Fiat and
Peter Sanders},
title = {Storing a Compressed Function with Constant Time Access},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {730--741},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_65},
doi = {10.1007/978-3-642-04128-0\_65},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HreinssonKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/CampagnaP09,
author = {Andrea Campagna and
Rasmus Pagh},
editor = {Wei Wang and
Hillol Kargupta and
Sanjay Ranka and
Philip S. Yu and
Xindong Wu},
title = {Finding Associations and Computing Similarity via Biased Pair Sampling},
booktitle = {{ICDM} 2009, The Ninth {IEEE} International Conference on Data Mining,
Miami, Florida, USA, 6-9 December 2009},
pages = {61--70},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/ICDM.2009.35},
doi = {10.1109/ICDM.2009.35},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdm/CampagnaP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AmossenP09,
author = {Rasmus Resen Amossen and
Rasmus Pagh},
editor = {Ronald Fagin},
title = {Faster join-projects and sparse matrix multiplications},
booktitle = {Database Theory - {ICDT} 2009, 12th International Conference, St.
Petersburg, Russia, March 23-25, 2009, Proceedings},
series = {{ACM} International Conference Proceeding Series},
volume = {361},
pages = {121--126},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1514894.1514909},
doi = {10.1145/1514894.1514909},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdt/AmossenP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PaghS09,
author = {Rasmus Pagh and
Srinivasa Rao Satti},
editor = {Jan Paredaens and
Jianwen Su},
title = {Secondary indexing in one dimension: beyond b-trees and bitmap indexes},
booktitle = {Proceedings of the Twenty-Eigth {ACM} {SIGMOD-SIGACT-SIGART} Symposium
on Principles of Database Systems, {PODS} 2009, June 19 - July 1,
2009, Providence, Rhode Island, {USA}},
pages = {177--186},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1559795.1559824},
doi = {10.1145/1559795.1559824},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PaghS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BelazzouguiBPV09,
author = {Djamal Belazzougui and
Paolo Boldi and
Rasmus Pagh and
Sebastiano Vigna},
editor = {Claire Mathieu},
title = {Monotone minimal perfect hashing: searching a sorted table with \emph{O}(1)
accesses},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {785--794},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.86},
doi = {10.1137/1.9781611973068.86},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BelazzouguiBPV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-0112,
author = {Andrea Campagna and
Rasmus Pagh},
title = {Finding Associations and Computing Similarity via Biased Pair Sampling},
journal = {CoRR},
volume = {abs/0910.0112},
year = {2009},
url = {http://arxiv.org/abs/0910.0112},
eprinttype = {arXiv},
eprint = {0910.0112},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-0112.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-0287,
author = {Martin Dietzfelbinger and
Andreas Goerdt and
Michael Mitzenmacher and
Andrea Montanari and
Rasmus Pagh and
Michael Rink},
title = {Tight Thresholds for Cuckoo Hashing via {XORSAT}},
journal = {CoRR},
volume = {abs/0912.0287},
year = {2009},
url = {http://arxiv.org/abs/0912.0287},
eprinttype = {arXiv},
eprint = {0912.0287},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-0287.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JensenP08,
author = {Morten Skaarup Jensen and
Rasmus Pagh},
title = {Optimality in External Memory Hashing},
journal = {Algorithmica},
volume = {52},
number = {3},
pages = {403--411},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9155-x},
doi = {10.1007/S00453-007-9155-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JensenP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PaghP08,
author = {Anna Pagh and
Rasmus Pagh},
title = {Uniform Hashing in Constant Time and Optimal Space},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {1},
pages = {85--96},
year = {2008},
url = {https://doi.org/10.1137/060658400},
doi = {10.1137/060658400},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PaghP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DietzfelbingerP08,
author = {Martin Dietzfelbinger and
Rasmus Pagh},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Succinct Data Structures for Retrieval and Approximate Membership
(Extended Abstract)},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {385--396},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_32},
doi = {10.1007/978-3-540-70575-8\_32},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Pagh08,
author = {Rasmus Pagh},
editor = {Ming{-}Yang Kao},
title = {Cuckoo Hashing},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_97},
doi = {10.1007/978-0-387-30162-4\_97},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Pagh08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0803-3693,
author = {Martin Dietzfelbinger and
Rasmus Pagh},
title = {Succinct Data Structures for Retrieval and Approximate Membership},
journal = {CoRR},
volume = {abs/0803.3693},
year = {2008},
url = {http://arxiv.org/abs/0803.3693},
eprinttype = {arXiv},
eprint = {0803.3693},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0803-3693.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-2904,
author = {Rasmus Pagh and
S. Srinivasa Rao},
title = {Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes},
journal = {CoRR},
volume = {abs/0811.2904},
year = {2008},
url = {http://arxiv.org/abs/0811.2904},
eprinttype = {arXiv},
eprint = {0811.2904},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-2904.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BillePP07,
author = {Philip Bille and
Anna Pagh and
Rasmus Pagh},
editor = {Takeshi Tokuyama},
title = {Fast Evaluation of Union-Intersection Expressions},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {739--750},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_64},
doi = {10.1007/978-3-540-77120-3\_64},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BillePP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PaghPR07,
author = {Anna Pagh and
Rasmus Pagh and
Milan Ruzic},
editor = {David S. Johnson and
Uriel Feige},
title = {Linear probing with constant independence},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {318--327},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250839},
doi = {10.1145/1250790.1250839},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PaghPR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BotelhoPZ07,
author = {Fabiano C. Botelho and
Rasmus Pagh and
Nivio Ziviani},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {Simple and Space-Efficient Minimal Perfect Hash Functions},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {139--150},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_13},
doi = {10.1007/978-3-540-73951-7\_13},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BotelhoPZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0708-3259,
author = {Philip Bille and
Anna Pagh and
Rasmus Pagh},
title = {Fast evaluation of union-intersection expressions},
journal = {CoRR},
volume = {abs/0708.3259},
year = {2007},
url = {http://arxiv.org/abs/0708.3259},
eprinttype = {arXiv},
eprint = {0708.3259},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0708-3259.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0702159,
author = {Fabiano C. Botelho and
Rasmus Pagh and
Nivio Ziviani},
title = {Perfect Hashing for Data Management Applications},
journal = {CoRR},
volume = {abs/cs/0702159},
year = {2007},
url = {http://arxiv.org/abs/cs/0702159},
eprinttype = {arXiv},
eprint = {cs/0702159},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0702159.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0702170,
author = {Peter Tiedemann and
Henrik Reif Andersen and
Rasmus Pagh},
title = {Generic Global Constraints based on MDDs},
journal = {CoRR},
volume = {abs/cs/0702170},
year = {2007},
url = {http://arxiv.org/abs/cs/0702170},
eprinttype = {arXiv},
eprint = {cs/0702170},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0702170.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/DemaineHPP06,
author = {Erik D. Demaine and
Friedhelm Meyer auf der Heide and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {De Dictionariis Dynamicis Pauco Spatio Utentibus (\emph{lat.} On Dynamic
Dictionaries Using Little Space)},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {349--361},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_34},
doi = {10.1007/11682462\_34},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/DemaineHPP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PaghP06,
author = {Anna Pagh and
Rasmus Pagh},
editor = {Stijn Vansummeren},
title = {Scalable computation of acyclic joins},
booktitle = {Proceedings of the Twenty-Fifth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois,
{USA}},
pages = {225--232},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1142351.1142384},
doi = {10.1145/1142351.1142384},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PaghP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BergerHPPRT06,
author = {Mette Berger and
Esben Rune Hansen and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu and
Milan Ruzic and
Peter Tiedemann},
editor = {Phillip B. Gibbons and
Uzi Vishkin},
title = {Deterministic load balancing and dictionaries in the parallel disk
model},
booktitle = {{SPAA} 2006: Proceedings of the 18th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, Cambridge, Massachusetts, USA, July
30 - August 2, 2006},
pages = {299--307},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1148109.1148160},
doi = {10.1145/1148109.1148160},
timestamp = {Wed, 21 Nov 2018 11:13:10 +0100},
biburl = {https://dblp.org/rec/conf/spaa/BergerHPPRT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FagerbergPP06,
author = {Rolf Fagerberg and
Anna Pagh and
Rasmus Pagh},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {External String Sorting: Faster and Cache-Oblivious},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {68--79},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_4},
doi = {10.1007/11672142\_4},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FagerbergPP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0611141,
author = {Peter Tiedemann and
Henrik Reif Andersen and
Rasmus Pagh},
title = {A Generic Global Constraint based on MDDs},
journal = {CoRR},
volume = {abs/cs/0611141},
year = {2006},
url = {http://arxiv.org/abs/cs/0611141},
eprinttype = {arXiv},
eprint = {cs/0611141},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0611141.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0612055,
author = {Anna Pagh and
Rasmus Pagh and
Milan Ruzic},
title = {Linear Probing with Constant Independence},
journal = {CoRR},
volume = {abs/cs/0612055},
year = {2006},
url = {http://arxiv.org/abs/cs/0612055},
eprinttype = {arXiv},
eprint = {cs/0612055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0612055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FotakisPSS05,
author = {Dimitris Fotakis and
Rasmus Pagh and
Peter Sanders and
Paul G. Spirakis},
title = {Space Efficient Hash Tables with Worst Case Constant Access Time},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {229--248},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1195-x},
doi = {10.1007/S00224-004-1195-X},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FotakisPSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PaghPR05,
author = {Anna Pagh and
Rasmus Pagh and
S. Srinivasa Rao},
title = {An optimal Bloom filter replacement},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {823--829},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070548},
timestamp = {Tue, 11 Jun 2013 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/PaghPR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MortensenPP05,
author = {Christian Worm Mortensen and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {On dynamic range reporting in one dimension},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {104--111},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060606},
doi = {10.1145/1060590.1060606},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MortensenPP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0502032,
author = {Christian Worm Mortensen and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu},
title = {On Dynamic Range Reporting in One Dimension},
journal = {CoRR},
volume = {abs/cs/0502032},
year = {2005},
url = {http://arxiv.org/abs/cs/0502032},
eprinttype = {arXiv},
eprint = {cs/0502032},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0502032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0512081,
author = {Erik D. Demaine and
Friedhelm Meyer auf der Heide and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu},
title = {De Dictionariis Dynamicis Pauco Spatio Utentibus},
journal = {CoRR},
volume = {abs/cs/0512081},
year = {2005},
url = {http://arxiv.org/abs/cs/0512081},
eprinttype = {arXiv},
eprint = {cs/0512081},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0512081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/PaghR04,
author = {Rasmus Pagh and
Flemming Friche Rodler},
title = {Cuckoo hashing},
journal = {J. Algorithms},
volume = {51},
number = {2},
pages = {122--144},
year = {2004},
url = {https://doi.org/10.1016/j.jalgor.2003.12.002},
doi = {10.1016/J.JALGOR.2003.12.002},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/PaghR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PaghPT04,
author = {Anna Pagh and
Rasmus Pagh and
Mikkel Thorup},
editor = {Susanne Albers and
Tomasz Radzik},
title = {On Adaptive Integer Sorting},
booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3221},
pages = {556--579},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30140-0\_50},
doi = {10.1007/978-3-540-30140-0\_50},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/PaghPT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FotakisPSS03,
author = {Dimitris Fotakis and
Rasmus Pagh and
Peter Sanders and
Paul G. Spirakis},
editor = {Helmut Alt and
Michel Habib},
title = {Space Efficient Hash Tables with Worst Case Constant Access Time},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {271--282},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_25},
doi = {10.1007/3-540-36494-3\_25},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FotakisPSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/OstlinP03,
author = {Anna {\"{O}}stlin and
Rasmus Pagh},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Uniform hashing in constant time and linear space},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {622--628},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780633},
doi = {10.1145/780542.780633},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/OstlinP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Pagh02,
author = {Rasmus Pagh},
editor = {Ulrich Meyer and
Peter Sanders and
Jop F. Sibeyn},
title = {Basic External Memory Data Structures},
booktitle = {Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research
Seminar, March 10-14, 2002]},
series = {Lecture Notes in Computer Science},
volume = {2625},
pages = {14--35},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36574-5\_2},
doi = {10.1007/3-540-36574-5\_2},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Pagh02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/OstlinP02,
author = {Anna {\"{O}}stlin and
Rasmus Pagh},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {One-Probe Search},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {439--450},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_38},
doi = {10.1007/3-540-45465-9\_38},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/icalp/OstlinP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PaghP02,
author = {Rasmus Pagh and
Jakob Pagter},
editor = {David Eppstein},
title = {Optimal time-space trade-offs for non-comparison-based sorting},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {9--18},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545383},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/PaghP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HagerupMP01,
author = {Torben Hagerup and
Peter Bro Miltersen and
Rasmus Pagh},
title = {Deterministic Dictionaries},
journal = {J. Algorithms},
volume = {41},
number = {1},
pages = {69--85},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1171},
doi = {10.1006/JAGM.2001.1171},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HagerupMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Pagh01,
author = {Rasmus Pagh},
title = {Low Redundancy in Static Dictionaries with Constant Query Time},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {2},
pages = {353--363},
year = {2001},
url = {https://doi.org/10.1137/S0097539700369909},
doi = {10.1137/S0097539700369909},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Pagh01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PaghR01,
author = {Rasmus Pagh and
Flemming Friche Rodler},
editor = {Friedhelm Meyer auf der Heide},
title = {Cuckoo Hashing},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {121--133},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_10},
doi = {10.1007/3-540-44676-1\_10},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/PaghR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PaghR01a,
author = {Rasmus Pagh and
Flemming Friche Rodler},
editor = {Friedhelm Meyer auf der Heide},
title = {Lossy Dictionaries},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {300--311},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_25},
doi = {10.1007/3-540-44676-1\_25},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/PaghR01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Pagh01,
author = {Rasmus Pagh},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {On the cell probe complexity of membership and perfect hashing},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {425--432},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380836},
doi = {10.1145/380752.380836},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Pagh01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/Pagh00,
author = {Rasmus Pagh},
title = {A Trade-Off for Worst-Case Efficient Dictionaries},
journal = {Nord. J. Comput.},
volume = {7},
number = {3},
pages = {151--163},
year = {2000},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/Pagh00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Pagh00,
author = {Rasmus Pagh},
editor = {Jos{\'{e}} D. P. Rolim and
Andrei Z. Broder and
Andrea Corradini and
Roberto Gorrieri and
Reiko Heckel and
Juraj Hromkovic and
Ugo Vaccaro and
J. B. Wells},
title = {Dispersing Hash Functions},
booktitle = {{ICALP} Workshops 2000, Proceedings of the Satelite Workshops of the
27th International Colloquium on Automata, Languages and Programming,
Geneva, Switzerland, July 9-15, 2000},
pages = {53--68},
publisher = {Carleton Scientific, Waterloo, Ontario, Canada},
year = {2000},
timestamp = {Sat, 04 Apr 2020 17:15:23 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Pagh00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Pagh00,
author = {Rasmus Pagh},
editor = {David B. Shmoys},
title = {Faster deterministic dictionaries},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {487--493},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338595},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Pagh00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Pagh00,
author = {Rasmus Pagh},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {A New Trade-Off for Deterministic Dictionaries},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {22--31},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_4},
doi = {10.1007/3-540-44985-X\_4},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/Pagh00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Pagh99,
author = {Rasmus Pagh},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {Low Redundancy in Static Dictionaries with {O(1)} Worst Case Lookup
Time},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {595--604},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_56},
doi = {10.1007/3-540-48523-6\_56},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Pagh99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Pagh99,
author = {Rasmus Pagh},
editor = {Frank K. H. A. Dehne and
Arvind Gupta and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions},
booktitle = {Algorithms and Data Structures, 6th International Workshop, {WADS}
'99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1663},
pages = {49--54},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48447-7\_5},
doi = {10.1007/3-540-48447-7\_5},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/Pagh99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-14 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
