| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Rasmus Pagh, Charalampos E. Tsourakakis |
Colorful triangle counting and a MapReduce implementation.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Campagna, Rasmus Pagh |
Finding associations and computing similarity via biased pair sampling. |
Knowl. Inf. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Po-Shen Loh, Rasmus Pagh |
Thresholds for Extreme Orientability |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Kasper Green Larsen, Rasmus Pagh |
I/O-efficient data structures for colored range and prefix reporting. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Rasmus Pagh |
Compressed matrix multiplication. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Pagh, Rasmus Pagh, Milan Ruzic |
Linear Probing with 5-wise Independence. |
SIAM Review |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Resen Amossen, Rasmus Pagh |
A New Data Layout For Set Intersection on GPUs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rasmus Pagh |
Compressed Matrix Multiplication |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kasper Green Larsen, Rasmus Pagh |
I/O-Efficient Data Structures for Colored Range and Prefix Reporting |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rasmus Pagh, Charalampos E. Tsourakakis |
Colorful Triangle Counting and a MapReduce Implementation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna |
Theory and practice of monotone minimal perfect hashing. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh |
Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. |
ICDM Workshops |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Resen Amossen, Rasmus Pagh |
A New Data Layout for Set Intersection on GPUs. |
IPDPS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Campagna, Rasmus Pagh |
On Finding Frequent Patterns in Directed Acyclic Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrea Campagna, Rasmus Pagh |
On Finding Similar Items in a Stream of Transactions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrea Campagna, Rasmus Pagh |
On Finding Frequent Patterns in Event Sequences |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh |
Better size estimation for sparse matrix products |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrea Campagna, Rasmus Pagh |
On Finding Frequent Patterns in Event Sequences. |
ICDM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Campagna, Rasmus Pagh |
On Finding Similar Items in a Stream of Transactions. |
ICDM Workshops |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna |
Fast Prefix Search in Little Space, with Applications. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink |
Tight Thresholds for Cuckoo Hashing via XORSAT. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh |
Better Size Estimation for Sparse Matrix Products. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang |
Cache-oblivious hashing. |
PODS |
2010 |
DBLP DOI BibTeX RDF |
hashing, cache-oblivious algorithms |
| 1 | Rasmus Pagh |
Dispersing hash functions. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink |
Tight Thresholds for Cuckoo Hashing via XORSAT |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrea Campagna, Rasmus Pagh |
Finding Associations and Computing Similarity via Biased Pair Sampling |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anna Pagh, Rasmus Pagh, Milan Ruzic |
Linear Probing with Constant Independence. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Campagna, Rasmus Pagh |
Finding Associations and Computing Similarity via Biased Pair Sampling. |
ICDM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jóhannes B. Hreinsson, Morten Krøyer, Rasmus Pagh |
Storing a Compressed Function with Constant Time Access. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna |
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna |
Theory and Practise of Monotone Minimal Perfect Hashing. |
ALENEX |
2009 |
DBLP BibTeX RDF |
|
| 1 | Rasmus Resen Amossen, Rasmus Pagh |
Faster join-projects and sparse matrix multiplications. |
ICDT |
2009 |
DBLP DOI BibTeX RDF |
collapsing join-project, relational algebra, matrix multiplication |
| 1 | Rasmus Pagh, Srinivasa Rao Satti |
Secondary indexing in one dimension: beyond b-trees and bitmap indexes. |
PODS |
2009 |
DBLP DOI BibTeX RDF |
range query, b-tree, bitmap index |
| 1 | Morten Skaarup Jensen, Rasmus Pagh |
Optimality in External Memory Hashing. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Index, Hashing, Dictionary, External memory |
| 1 | Martin Dietzfelbinger, Rasmus Pagh |
Succinct Data Structures for Retrieval and Approximate Membership |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Rasmus Pagh, S. Srinivasa Rao |
Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anna Pagh, Rasmus Pagh |
Uniform Hashing in Constant Time and Optimal Space. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh |
Cuckoo Hashing. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Rasmus Pagh |
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh |
Generic Global Constraints based on MDDs |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Anna Pagh, Rasmus Pagh |
Fast evaluation of union-intersection expressions |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani |
Perfect Hashing for Data Management Applications |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani |
Simple and Space-Efficient Minimal Perfect Hash Functions. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Anna Pagh, Rasmus Pagh |
Fast Evaluation of Union-Intersection Expressions. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Pagh, Rasmus Pagh, Milan Ruzic |
Linear probing with constant independence. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
hashing, linear probing |
| 1 | Anna Pagh, Rasmus Pagh, Milan Ruzic |
Linear Probing with Constant Independence |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh |
A Generic Global Constraint based on MDDs |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Fagerberg, Anna Pagh, Rasmus Pagh |
External String Sorting: Faster and Cache-Oblivious. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
parallel disk model, hashing, dictionary, expander graph, deterministic |
| 1 | Anna Pagh, Rasmus Pagh |
Scalable computation of acyclic joins. |
PODS |
2006 |
DBLP DOI BibTeX RDF |
acyclic join, algorithm, relational algebra, external memory |
| 1 | Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu |
De Dictionariis Dynamicis Pauco Spatio Utentibus |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu |
On Dynamic Range Reporting in One Dimension |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis |
Space Efficient Hash Tables with Worst Case Constant Access Time. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Pagh, Rasmus Pagh, S. Srinivasa Rao |
An optimal Bloom filter replacement. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu |
On dynamic range reporting in one dimension. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
bloomier filters, integer search, range reporting, perfect hashing |
| 1 | Rasmus Pagh, Flemming Friche Rodler |
Cuckoo hashing. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Pagh, Rasmus Pagh, Mikkel Thorup |
On Adaptive Integer Sorting. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis |
Space Efficient Hash Tables with Worst Case Constant Access Time. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Östlin, Rasmus Pagh |
Uniform hashing in constant time and linear space. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
uniform hashing, data structures, hash function |
| 1 | Rasmus Pagh, Jakob Pagter |
Optimal time-space trade-offs for non-comparison-based sorting. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Östlin, Rasmus Pagh |
One-Probe Search. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh |
Basic External Memory Data Structures. |
Algorithms for Memory Hierarchies |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh |
Deterministic Dictionaries. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh |
Low Redundancy in Static Dictionaries with Constant Query Time. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh, Flemming Friche Rodler |
Lossy Dictionaries. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh, Flemming Friche Rodler |
Cuckoo Hashing. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh |
On the cell probe complexity of membership and perfect hashing. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh |
A Trade-Off for Worst-Case Efficient Dictionaries. |
Nord. J. Comput. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Rasmus Pagh |
Faster deterministic dictionaries. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh |
Dispersing Hash Functions. |
ICALP Satellite Workshops |
2000 |
DBLP BibTeX RDF |
|
| 1 | Rasmus Pagh |
A New Trade-Off for Deterministic Dictionaries. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh |
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh |
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")