Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Rasmus Pagh
2010 – today
- 2013
[j14]Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani: Practical perfect hashing in nearly optimal space. Inf. Syst. 38(1): 108-131 (2013)- [c43]Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: On parallelizing matrix multiplication by the column-row method. ALENEX 2013: 122-132
- [c42]Konstantin Kutzkov, Rasmus Pagh: On the streaming complexity of computing local clustering coefficients. WSDM 2013: 677-686
- [i22]Rasmus Pagh, Gil Segev, Udi Wieder: How to Approximate A Set Without Knowing Its Size In Advance. CoRR abs/1304.1188 (2013)
- 2012
- [j13]Rasmus Pagh, Charalampos E. Tsourakakis: Colorful triangle counting and a MapReduce implementation. Inf. Process. Lett. 112(7): 277-281 (2012)
- [j12]Andrea Campagna, Rasmus Pagh: Finding associations and computing similarity via biased pair sampling. Knowl. Inf. Syst. 31(3): 505-526 (2012)
- [c41]
- [c40]
- [c39]Kasper Green Larsen, Rasmus Pagh: I/O-efficient data structures for colored range and prefix reporting. SODA 2012: 583-592
- [i21]
- [i20]Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: On Parallelizing Matrix Multiplication by the Column-Row Method. CoRR abs/1210.0461 (2012)
- 2011
- [j11]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Theory and practice of monotone minimal perfect hashing. ACM Journal of Experimental Algorithmics 16 (2011)
- [j10]Anna Pagh, Rasmus Pagh, Milan Ruzic: Linear Probing with 5-wise Independence. SIAM Review 53(3): 547-558 (2011)
- [c38]Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. ICDM Workshops 2011: 145-150
- [c37]Rasmus Resen Amossen, Rasmus Pagh: A New Data Layout for Set Intersection on GPUs. IPDPS 2011: 698-708
- [i19]Rasmus Resen Amossen, Rasmus Pagh: A New Data Layout For Set Intersection on GPUs. CoRR abs/1102.1003 (2011)
- [i18]Rasmus Pagh, Charalampos E. Tsourakakis: Colorful Triangle Counting and a MapReduce Implementation. CoRR abs/1103.6073 (2011)
- [i17]Kasper Green Larsen, Rasmus Pagh: I/O-Efficient Data Structures for Colored Range and Prefix Reporting. CoRR abs/1104.3084 (2011)
- [i16]
- 2010
- [c36]Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh: Better Size Estimation for Sparse Matrix Products. APPROX-RANDOM 2010: 406-419
- [c35]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Fast Prefix Search in Little Space, with Applications. ESA (1) 2010: 427-438
- [c34]Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink: Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) 2010: 213-225
- [c33]Andrea Campagna, Rasmus Pagh: On Finding Similar Items in a Stream of Transactions. ICDM Workshops 2010: 121-128
- [c32]
- [c31]
- [i15]Andrea Campagna, Rasmus Pagh: On Finding Frequent Patterns in Directed Acyclic Graphs. CoRR abs/1005.0239 (2010)
- [i14]Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh: Better size estimation for sparse matrix products. CoRR abs/1006.4173 (2010)
- [i13]Andrea Campagna, Rasmus Pagh: On Finding Frequent Patterns in Event Sequences. CoRR abs/1010.2358 (2010)
- [i12]Andrea Campagna, Rasmus Pagh: On Finding Similar Items in a Stream of Transactions. CoRR abs/1010.2371 (2010)
2000 – 2009
- 2009
- [j9]
- [j8]Anna Pagh, Rasmus Pagh, Milan Ruzic: Linear Probing with Constant Independence. SIAM J. Comput. 39(3): 1107-1120 (2009)
- [c30]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Theory and Practise of Monotone Minimal Perfect Hashing. ALENEX 2009: 132-144
- [c29]Jóhannes B. Hreinsson, Morten Krøyer, Rasmus Pagh: Storing a Compressed Function with Constant Time Access. ESA 2009: 730-741
- [c28]Andrea Campagna, Rasmus Pagh: Finding Associations and Computing Similarity via Biased Pair Sampling. ICDM 2009: 61-70
- [c27]Rasmus Resen Amossen, Rasmus Pagh: Faster join-projects and sparse matrix multiplications. ICDT 2009: 121-126
- [c26]Rasmus Pagh, Srinivasa Rao Satti: Secondary indexing in one dimension: beyond b-trees and bitmap indexes. PODS 2009: 177-186
- [c25]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. SODA 2009: 785-794
- [i11]Andrea Campagna, Rasmus Pagh: Finding Associations and Computing Similarity via Biased Pair Sampling. CoRR abs/0910.0112 (2009)
- [i10]Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink: Tight Thresholds for Cuckoo Hashing via XORSAT. CoRR abs/0912.0287 (2009)
- 2008
- [j7]Morten Skaarup Jensen, Rasmus Pagh: Optimality in External Memory Hashing. Algorithmica 52(3): 403-411 (2008)
- [j6]Anna Pagh, Rasmus Pagh: Uniform Hashing in Constant Time and Optimal Space. SIAM J. Comput. 38(1): 85-96 (2008)
- [c24]Martin Dietzfelbinger, Rasmus Pagh: Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). ICALP (1) 2008: 385-396
- [r1]
- [i9]Martin Dietzfelbinger, Rasmus Pagh: Succinct Data Structures for Retrieval and Approximate Membership. CoRR abs/0803.3693 (2008)
- [i8]Rasmus Pagh, S. Srinivasa Rao: Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes. CoRR abs/0811.2904 (2008)
- 2007
- [c23]Philip Bille, Anna Pagh, Rasmus Pagh: Fast Evaluation of Union-Intersection Expressions. ISAAC 2007: 739-750
- [c22]
- [c21]Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani: Simple and Space-Efficient Minimal Perfect Hash Functions. WADS 2007: 139-150
- [i7]Philip Bille, Anna Pagh, Rasmus Pagh: Fast evaluation of union-intersection expressions. CoRR abs/0708.3259 (2007)
- [i6]Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani: Perfect Hashing for Data Management Applications. CoRR abs/cs/0702159 (2007)
- [i5]Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh: Generic Global Constraints based on MDDs. CoRR abs/cs/0702170 (2007)
- 2006
- [c20]Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu: De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). LATIN 2006: 349-361
- [c19]
- [c18]Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann: Deterministic load balancing and dictionaries in the parallel disk model. SPAA 2006: 299-307
- [c17]Rolf Fagerberg, Anna Pagh, Rasmus Pagh: External String Sorting: Faster and Cache-Oblivious. STACS 2006: 68-79
- [i4]Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh: A Generic Global Constraint based on MDDs. CoRR abs/cs/0611141 (2006)
- [i3]Anna Pagh, Rasmus Pagh, Milan Ruzic: Linear Probing with Constant Independence. CoRR abs/cs/0612055 (2006)
- 2005
- [j5]Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis: Space Efficient Hash Tables with Worst Case Constant Access Time. Theory Comput. Syst. 38(2): 229-248 (2005)
- [c16]
- [c15]Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu: On dynamic range reporting in one dimension. STOC 2005: 104-111
- [i2]Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu: On Dynamic Range Reporting in One Dimension. CoRR abs/cs/0502032 (2005)
- [i1]Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu: De Dictionariis Dynamicis Pauco Spatio Utentibus. CoRR abs/cs/0512081 (2005)
- 2004
- [j4]
- [c14]
- 2003
- [c13]Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis: Space Efficient Hash Tables with Worst Case Constant Access Time. STACS 2003: 271-282
- [c12]
- 2002
- [c11]
- [c10]
- [c9]Rasmus Pagh, Jakob Pagter: Optimal time-space trade-offs for non-comparison-based sorting. SODA 2002: 9-18
- 2001
- [j3]Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh: Deterministic Dictionaries. J. Algorithms 41(1): 69-85 (2001)
- [j2]Rasmus Pagh: Low Redundancy in Static Dictionaries with Constant Query Time. SIAM J. Comput. 31(2): 353-363 (2001)
- [c8]
- [c7]
- [c6]
- 2000
- [j1]Rasmus Pagh: A Trade-Off for Worst-Case Efficient Dictionaries. Nord. J. Comput. 7(3): 151-163 (2000)
- [c5]
- [c4]
- [c3]
1990 – 1999
- 1999
- [c2]Rasmus Pagh: Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. ICALP 1999: 595-604
- [c1]Rasmus Pagh: Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. WADS 1999: 49-54
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:33 CEST by the dblp team