Rasmus Pagh
Rasmus Pagh
Professor of computer science, IT University of Copenhagen
Verifierad e-postadress på itu.dk - Startsida
Titel
Citeras av
Citeras av
År
Cuckoo Hashing
R Pagh, FF Rodler
Journal of Algorithms 51 (2), 122-144, 2004
12342004
Low redundancy in static dictionaries with constant query time
R Pagh
SIAM Journal on Computing 31 (2), 353-363, 2001
247*2001
Fast and scalable polynomial kernels via explicit feature maps
N Pham, R Pagh
Proceedings of the 19th ACM SIGKDD international conference on Knowledge …, 2013
2352013
Space efficient hash tables with worst case constant access time
D Fotakis, R Pagh, P Sanders, P Spirakis
Theory of Computing Systems 38 (2), 229-248, 2005
1912005
An optimal Bloom filter replacement
A Pagh, R Pagh, SS Rao
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
1862005
Practical perfect hashing in nearly optimal space
FC Botelho, R Pagh, N Ziviani
Information Systems 38 (1), 108-131, 2013
152*2013
Uniform hashing in constant time and optimal space
A Pagh, R Pagh
SIAM Journal on Computing 38 (1), 85-96, 2008
145*2008
Advances and open problems in federated learning
P Kairouz, HB McMahan, B Avent, A Bellet, M Bennis, AN Bhagoji, ...
arXiv preprint arXiv:1912.04977, 2019
1422019
Colorful triangle counting and a mapreduce implementation
R Pagh, CE Tsourakakis
Information Processing Letters 112 (7), 277-281, 2012
1382012
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
N Pham, R Pagh
Proceedings of the 18th ACM SIGKDD international conference on Knowledge …, 2012
1142012
Tight thresholds for cuckoo hashing via XORSAT
M Dietzfelbinger, A Goerdt, M Mitzenmacher, A Montanari, R Pagh, ...
International Colloquium on Automata, Languages, and Programming, 213-225, 2010
1112010
Deterministic dictionaries
T Hagerup, PB Miltersen, R Pagh
Journal of Algorithms 41 (1), 69-85, 2001
1112001
Monotone Minimal Perfect Hashing: Searching a Sorted Table with O(1) Accesses
D Belazzougui, P Boldi, R Pagh, S Vigna
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
1042009
Cuckoo hashing for undergraduates
R Pagh
IT University of Copenhagen 6, 2006
862006
Compressed matrix multiplication
R Pagh
ACM Transactions on Computation Theory (TOCT) 5 (3), 1-17, 2013
852013
Succinct data structures for retrieval and approximate membership
M Dietzfelbinger, R Pagh
International Colloquium on Automata, Languages, and Programming, 385-396, 2008
732008
Linear probing with constant independence
A Pagh, R Pagh, M Ruzic
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
732007
Mapreduce triangle enumeration with guarantees
HM Park, F Silvestri, U Kang, R Pagh
Proceedings of the 23rd ACM International Conference on Conference on …, 2014
702014
Faster join-projects and sparse matrix multiplications
RR Amossen, R Pagh
Proceedings of the 12th International Conference on Database Theory, 121-126, 2009
672009
On dynamic range reporting in one dimension
CW Mortensen, R Pagh, M Pǎtraįcu
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
612005
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20