Travelled to:1 × Czech Republic
1 × Denmark
1 × France
1 × Greece
1 × Iceland
1 × Spain
2 × China
9 × USA
Collaborated with:N.Pham A.Östlin ∅ A.Pagh F.Silvestri M.Dietzfelbinger S.R.Satti T.Christiani M.Thorup M.Stöckel D.P.Woodruff M.Ruzic C.W.Mortensen M.Patrascu H.Park U.Kang A.Björklund V.V.Williams U.Zwick Z.Wei K.Yi Q.Zhang A.Goerdt M.Mitzenmacher A.Montanari M.Rink
Talks about:hash (5) triangl (3) linear (3) probe (3) time (3) one (3) membership (2) independ (2) constant (2) approxim (2)
Person: Rasmus Pagh
DBLP: Pagh:Rasmus
Contributed to:
2015
2014
2014
2014
2013201220102010200920082007200620052003200220011999Wrote 18 papers:
- STOC-2015-ChristianiPT #independence
- From Independence to Expansion and Back Again (TC, RP, MT), pp. 813–820.
- CIKM-2014-ParkSKP #pipes and filters
- MapReduce Triangle Enumeration With Guarantees (HMP, FS, UK, RP), pp. 1739–1748.
- ICALP-v1-2014-BjorklundPWZ
- Listing Triangles (AB, RP, VVW, UZ), pp. 223–234.
- PODS-2014-PaghS #complexity
- The input/output complexity of triangle enumeration (RP, FS), pp. 224–233.
- PODS-2014-PaghSW #question #set
- Is min-wise hashing optimal for summarizing set intersection? (RP, MS, DPW), pp. 109–120.
- KDD-2013-PhamP #kernel #performance #polynomial #scalability
- Fast and scalable polynomial kernels via explicit feature maps (NP, RP), pp. 239–247.
- KDD-2012-PhamP #algorithm #approximate #detection
- A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data (NP, RP), pp. 877–885.
- ICALP-v1-2010-DietzfelbingerGMMPR #satisfiability
- Tight Thresholds for Cuckoo Hashing via XORSAT (MD, AG, MM, AM, RP, MR), pp. 213–225.
- PODS-2010-PaghWYZ
- Cache-oblivious hashing (RP, ZW, KY, QZ), pp. 297–304.
- PODS-2009-PaghS
- Secondary indexing in one dimension: beyond b-trees and bitmap indexes (RP, SRS), pp. 177–186.
- ICALP-A-2008-DietzfelbingerP #approximate #data type #retrieval
- Succinct Data Structures for Retrieval and Approximate Membership (MD, RP), pp. 385–396.
- STOC-2007-PaghPR #constant #independence #linear
- Linear probing with constant independence (AP, RP, MR), pp. 318–327.
- PODS-2006-PaghP #scalability
- Scalable computation of acyclic joins (AP, RP), pp. 225–232.
- STOC-2005-MortensenPP #on the
- On dynamic range reporting in one dimension (CWM, RP, MP), pp. 104–111.
- STOC-2003-OstlinP #constant #linear
- Uniform hashing in constant time and linear space (AÖ, RP), pp. 622–628.
- ICALP-2002-OstlinP
- One-Probe Search (AÖ, RP), pp. 439–450.
- STOC-2001-Pagh #complexity #on the
- On the cell probe complexity of membership and perfect hashing (RP), pp. 425–432.
- ICALP-1999-Pagh
- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time (RP), pp. 595–604.