Papers of Rasmus Pagh

The copyrights for journal and conference proceedings papers generally belong to the publisher. The papers may be downloaded for personal or research purposes only. The official and final publications are available at SpringerLink, IEEE Explore, ACM Digital Library, and other publisher archives.

For a list of publications ordered by number of citations, see my Google Scholar page.

Peer-reviewed research papers

[90] Scalable and robust set similarity join
Tobias Christiani, Rasmus Pagh, Johan Sivertsen. Submitted, 2017
[89] Distance-sensitive hashing
Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri. Submitted, 2017
[88] Range-efficient consistent sampling and locality-sensitive hashing for polygons
Joachim Gudmundsson, Rasmus Pagh. Submitted, 2017
[87] Enumerating Trillion Subgraphs On Distributed Systems
Ha-Myung Park, Francesco Silvestri, Rasmus Pagh, Chin-Wan Chung, Sung-Hyon Myaeng, U Kang. Submitted, 2017
Code and data sets.
[86] Set Similarity Search Beyond Minhash
Tobias Christiani, Rasmus Pagh. Proceedings of 47th ACM Symposium on Theory of Computing (STOC), 2017
Presentation slides. Also presented as a poster.
[85] I/O-efficient Similarity Join
Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel. To appear in Algorithmica, 2017
[84] Distance Sensitive Bloom Filters Without False Negatives
Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen. Proceedings of 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017
[83] Parameter-free Locality Sensitive Hashing for Spherical Range Reporting
Thomas D. Ahle, Martin Aumüller, Rasmus Pagh. Proceedings of 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017
[82] Efficiently Correcting Matrix Products
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama. Algorithmica , 2016
[81] Approximate Furthest Neighbor with Application to Annulus Query
Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala. Information Systems, special issue for SISAP, 2016
[80] Scalability and Total Recall with Fast CoveringLSH
Ninh Pham, Rasmus Pagh. Proceedings of International Conference on Information and Knowledge Management (CIKM), 2016
[79] On the Complexity of Inner Product Similarity Join
Thomas D. Ahle, Rasmus Pagh, Ilya Razenshteyn, Francesco Silvestri. Proceedings of the 35th ACM Symposium on Principles of Database Systems (PODS), 2016
[78] Triangle counting in dynamic graph streams
Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh. Algorithmica 76, 2016
Strengthens the result of the SWAT '14 paper of the same name.
[77] Locality-sensitive Hashing without False Negatives
Rasmus Pagh. Proceedings of 27th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2016
Presentation slides. A simple Python implementation is available. A long version with slightly stronger results is available.
[76] Simple Multi-Party Set Reconciliation
Michael Mitzenmacher, Rasmus Pagh. Submitted, 2015
[75] Approximate Furthest Neighbor in High Dimensions
Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala. Proceedings of 8th International Conference on Similarity Search and Applications (SISAP), 2015
Superseded by [81] Approximate Furthest Neighbor with Application to Annulus Query, 2016.
[74] I/O-efficient Similarity Join in High Dimensions
Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel. Proceedings of the 23rd European Symposium on Algorithms (ESA), 2015
Presentation slides. Superseded by [85] I/O-efficient Similarity Join, 2017.
[73] From Independence to Expansion and Back
Tobias Christiani, Rasmus Pagh, Mikkel Thorup. Proceedings of 47th ACM Symposium on Theory of Computing (STOC), 2015
Presentation slides.
[72] Approximate Range Emptiness in Constant Time and Optimal Space
Mayank Goswami, Allan Grønlund, Kasper Green Larsen, Rasmus Pagh. Proceedings of Symposium on Discrete Algorithms (SODA), 2015
Presentation slides.
[71] MapReduce Triangle Enumeration With Guarantees
Ha-Myung Park, Francesco Silvestri, U Kang, Rasmus Pagh. Proceedings of Conference on Information and Knowledge Management (CIKM), 2014
Superseded by [87] Enumerating Trillion Subgraphs On Distributed Systems, 2017. Code and data sets.
[70] Generating k-independent variables in constant time
Tobias Christiani, Rasmus Pagh. Proceedings of Foundations of Computer Science (FOCS), 2014
Presentation slides. Full version available on arXiv.
[69] The Input/Output Complexity of Sparse Matrix Multiplication
Rasmus Pagh, Morten Stöckel. Proceedings of European Symposium on Algorithms (ESA), 2014
Presentation slides. Also presented at SIAM Conference on Applied Linear Algebra, 2015.
[68] Triangle counting in dynamic graph streams
Konstantin Kutzkov, Rasmus Pagh. Proceedings of 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2014
Presentation slides. Superseded by [78] Triangle counting in dynamic graph streams, 2016.
[67] Consistent subset sampling
Konstantin Kutzkov, Rasmus Pagh. Proceedings of 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2014
Presentation slides. Full version available on arXiv.
[66] Listing Triangles
Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick. Proceedings of 41st International Colloquium on Automata, Languages and Programming (ICALP), 2014
[65] Is Min-Wise Hashing Optimal for Summarizing Set Intersection?
Rasmus Pagh, Morten Stöckel, David P. Woodruff. Proceedings of the 33rd ACM Symposium on Principles of Database Systems (PODS), 2014
[64] The Input/Output Complexity of Triangle Enumeration
Rasmus Pagh, Francesco Silvestri. Proceedings of the 33rd ACM Symposium on Principles of Database Systems (PODS), 2014
[63] Efficient Estimation for High Similarities using Odd Sketches
Michael Mitzenmacher, Rasmus Pagh, Ninh Pham. Proceedings of 23rd International World Wide Web Conference (WWW), 2014
Presentation slides. Winner of best paper award. Selected as a Notable Computing Article of 2014 by ACM Computing Reviews.
[62] Thresholds for Extreme Orientability
Po-Shen Loh, Rasmus Pagh. Algorithmica 69 (3), 2014
[61] How to Approximate A Set Without Knowing Its Size in Advance
Rasmus Pagh, Gil Segev, Udi Wieder. Proceedings of 54th IEEE Foundations of Computer Science (FOCS), 2013
[60] Fast and Scalable Polynomial Kernels via Explicit Feature Maps
Ninh Pham, Rasmus Pagh. Proceedings of 19th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 2013
Source code is available in Matlab (by Ninh Pham) and C++ (by Johan von Tangen Sivertsen).
[59] Compressed Matrix Multiplication
Rasmus Pagh. ACM Transactions on Computation Theory, August 2013
Presentation slides. Special issue for ITCS 2012. Selected as a Notable Computing Article of 2013 by ACM Computing Reviews. The version on this page corrects a typo in the pseudocode of the published version.
[58] Cache-oblivious Hashing
Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang. Algorithmica, March 2013
[57] Practical Perfect Hashing Algorithm in Nearly Optimal Space
Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani. Information Systems Journal 38(1), 2013
Implementation available in CMPH.
[56] On the streaming complexity of computing local clustering coefficients
Konstantin Kutzkov, Rasmus Pagh. Proceedings of 6th ACM conference on Web Search and Data Mining (WSDM), 2013
[55] On Parallelizing Matrix Multiplication by the Column-Row Method
Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh. Proceedings of the 15th Workshop on Algorithm Engineering and Experiments (ALENEX), 2013
[54] Better Size Estimation for Sparse Matrix Products
Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh. Algorithmica, March 2013
Presentation slides. Note: A preliminary version appeared at RANDOM 2010.
[53] A Near-linear Time Approximation Algorithm for Angle-based Outlier Detection in High-dimensional Data
Ninh Pham, Rasmus Pagh. Proceedings of 18th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 2012
Source code is available here.
[52] Compressed Matrix Multiplication
Rasmus Pagh. Proceedings of ACM Innovations in Theoretical Computer Science (ITCS), 2012
Presentation slides. Superseded by [59] Compressed Matrix Multiplication, August 2013.
[51] I/O-Efficient Data Structures for Colored Range and Prefix Reporting
Kasper Green Larsen, Rasmus Pagh. Proceedings of 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012
Presentation slides.
[50] Colorful Triangle Counting and a MapReduce Implementation
Rasmus Pagh, Charalampos E. Tsourakakis. Information Processing Letters 112 (7), 2012
Revised version to appear.
[49] Finding Associations and Computing Similarity via Biased Pair Sampling
Andrea Campagna, Rasmus Pagh. Knowledge and Information Systems 31 (3), 2012
Invited paper from ICDM 2009. Can be seen as a generalization of Edith Cohen, David D. Lewis: Approximating Matrix Multiplication for Pattern Recognition Tasks. J. Algorithms 30(2): 211-252 (1999) (not cited in the paper).
[48] Frequent Pairs in Data Streams: Exploiting Parallelism and Skew
Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh. Proceedings of IEEE International Conference on Data Mining Workshops (KDCloud), 2011
[47] Linear probing with 5-wise independence
Anna Pagh, Rasmus Pagh, Milan Ružić. SIAM Review 53, 2011
Published in the SIGEST section, which "highlights a recent paper from one of SIAM's nine specialized research journals, chosen on the basis of exceptional interest to the entire SIAM community".
[46] Theory and Practice of Monotone Minimal Perfect Hashing
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. ACM Journal of Experimental Algorithmics 16, 2011
Implementations available in Sux.
[45] A New Data Layout For Set Intersection on GPUs
Rasmus Resen Amossen, Rasmus Pagh. Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2011
Presentation slides. Note: Tightness of the space bound shown in this paper is now known.
[44] On Finding Frequent Patterns in Event Sequences
Andrea Campagna, Rasmus Pagh. Proceedings of IEEE International Conference on Data Mining, 2010
[43] On Finding Similar Items in a Stream of Transactions
Andrea Campagna, Rasmus Pagh. Proceedings of IEEE International Conference on Data Mining Workshops (KDCloud), 2010
[42] Better Size Estimation for Sparse Matrix Products
Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh. Proceedings of the 14th International Workshop on Randomization and Computation (RANDOM), LNCS 6302, 2010
Presentation slides. Superseded by [54] Better Size Estimation for Sparse Matrix Products, March 2013. Note: The version published in the RANDOM proceedings contained a mistake that matters whenever z<n. This has been corrected in the journal version.
[41] Fast Prefix Search in Little Space, with Applications
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. Proceedings of the 18th European Symposium on Algorithms (ESA), LNCS 2161, 2010
Presentation slides.
[40] Tight Thresholds for Cuckoo Hashing via XORSAT
Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink. Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 6198, 2010
[39] Cache-oblivious Hashing
Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang. Proceedings of the 29th ACM Symposium on Principles of Database Systems (PODS), 2010
[38] Linear probing with constant independence
Anna Pagh, Rasmus Pagh, Milan Ružić. SIAM Journal on Computing 39, 2009
Special issue for STOC 2007. Optimality of 5-wise independence has been shown by Pătraşcu and Thorup in in 2010.
[37] Dispersing Hash Functions
Rasmus Pagh. Random Structures and Algorithms 35, 2009
[36] Finding Associations and Computing Similarity via Biased Pair Sampling
Andrea Campagna, Rasmus Pagh. Proceedings of the 9th IEEE International Conference on Data Mining, 2009
Presentation slides. Superseded by [49] Finding Associations and Computing Similarity via Biased Pair Sampling, 2012. Can be seen as a generalization of Edith Cohen, David D. Lewis: Approximating Matrix Multiplication for Pattern Recognition Tasks. J. Algorithms 30(2): 211-252 (1999) (not cited in the paper).
[35] Storing a Compressed Function with Constant Time Access
Jóhannes B. Hreinsson, Morten Krøyer, Rasmus Pagh. Proceedings of the 17th European Symposium on Algorithms (ESA), LNCS 5757, 2009
Presentation slides.
[34] Faster join-projects and sparse matrix multiplications
Rasmus Resen Amossen, Rasmus Pagh. Proceedings of 12th International Conference on Database Theory (ICDT), 2009
Presentation slides. Note: There is an error in section 3.2, where 2/(1+β+k) should be replaced by (1+β)/(1+β+k), which makes the running time O(N2/3 Z2/3 + N0.862 Z0.546). Presentation in .mov format.
[33] Theory and Practise of Monotone Minimal Perfect Hashing
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX), 2009
Superseded by [46] Theory and Practice of Monotone Minimal Perfect Hashing, 2011. Implementations available in Sux.
[32] Monotone Minimal Perfect Hashing: Searching a Sorted Table
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2009
Presentation slides. Implementation available in Sux.
[31] Secondary indexing in one dimension: Beyond B-trees and bitmap indexes
Rasmus Pagh, S. Srinivasa Rao. Proceedings of the 28th ACM Symposium on Principles of Database Systems (PODS), 2009
Presentation slides.
[30] Optimality in External Memory Hashing
Morten Skaarup Jensen, Rasmus Pagh. Algorithmica 52, 2008
[29] Uniform Hashing in Constant Time and Optimal Space
Anna Pagh, Rasmus Pagh. SIAM Journal on Computing 38, 2008
[28] Succinct Data Structures for Retrieval and Approximate Membership
Martin Dietzfelbinger, Rasmus Pagh. Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 5125, 2008
Presentation slides.
[27] Linear probing with constant independence
Anna Pagh, Rasmus Pagh, Milan Ružić. Proceedings of 39th ACM Symposium on Theory of Computing (STOC), 2007
Presentation slides. Superseded by [38] Linear probing with constant independence, 2009.
[26] Simple and Space-Efficient Minimal Perfect Hash Functions
Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani. Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS), 2007
Presentation slides. Superseded by [57] Practical Perfect Hashing Algorithm in Nearly Optimal Space, 2013. Implementation available in CMPH.
[25] Fast evaluation of union-intersection expressions
Philip Bille, Anna Pagh, Rasmus Pagh. Proceedings of the 18th International Symposium on Algorithms And Computation (ISAAC), LNCS 4835, 2007
Presentation slides. Note: A practical version of our approach has been proposed by Bolin Ding and Arnd Christian König, VLDB 2011.
[24] Scalable computation of acyclic joins
Anna Pagh, Rasmus Pagh. Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), 2006
Presentation slides. (.mov format.)
[23] Deterministic load balancing and dictionaries in the parallel disk model
Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Pătraşcu, Milan Ružić, Peter Tiedemann. Proceedings of the 18th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2006
Presentation slides.
[22] De Dictionariis Dynamicis Pauco Spatio Utentibus
Erik Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Pătraşcu. Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN), 2006
Presentation slides. Note: A stronger result has been shown by Arbitman, Naor, and Segev in 2010.
[21] External String Sorting: Faster and Cache-Oblivious
Rolf Fagerberg, Anna Pagh, Rasmus Pagh. Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 1373, 2006
[20] An Optimal Bloom Filter Replacement
Anna Pagh, Rasmus Pagh, S. Srinivasa Rao. Proceedings of 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005
Presentation slides.
[19] On Dynamic Range Reporting in One Dimension
Christian Worm Mortensen, Rasmus Pagh, Mihai Pătraşcu. Proceedings of 37th ACM Symposium on Theory of Computing (STOC), 2005
Presentation slides.
[18] Space Efficient Hash Tables with Worst Case Constant Access Time
Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis. Theory of Computing Systems 38, 2005
Special issue for STACS 2003.
[17] On Adaptive Integer Sorting
Anna Pagh, Rasmus Pagh, Mikkel Thorup. Proceedings of the 12th European Symposium on Algorithms (ESA), LNCS 3221, 2004
Presentation slides.
[16] Cuckoo Hashing
Rasmus Pagh, Flemming Friche Rodler. Journal of Algorithms 51, 2004
Other resources: Description on Wikipedia; Open problems on cuckoo hashing. Implementation in C available.
[15] Space Efficient Hash Tables with Worst Case Constant Access Time
Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis. Proceedings of the 20th Symposium on Theoretical Aspects of Computer Science (STACS), 2003
Presentation slides. Superseded by [18] Space Efficient Hash Tables with Worst Case Constant Access Time, 2005.
[14] Uniform Hashing in Constant Time and Linear Space
Anna Östlin, Rasmus Pagh. Proceedings of 35th ACM Symposium on Theory of Computing (STOC), 2003
Presentation slides. Superseded by [29] Uniform Hashing in Constant Time and Optimal Space, 2008.
[13] One-Probe Search
Anna Östlin, Rasmus Pagh. Proceedings of 29th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 2380, 2002
Presentation slides.
[12] Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting
Rasmus Pagh, Jakob Pagter. Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002
Presentation slides.
[11] Low Redundancy in Static Dictionaries with Constant Query Time
Rasmus Pagh. SIAM Journal on Computing 31, 2001
Note: Stronger results have been shown by Mihai Pătraşcu in in 2008.
[10] Lossy Dictionaries
Rasmus Pagh, Flemming Friche Rodler. Proceedings of the 9th European Symposium on Algorithms (ESA), LNCS 2161, 2001
Presentation slides. Extended version.
[9] Cuckoo Hashing
Rasmus Pagh, Flemming Friche Rodler. Proceedings of the 9th European Symposium on Algorithms (ESA), LNCS 2161, 2001
Presentation slides. Superseded by [16] Cuckoo Hashing, 2004. Received best student paper award. Implementation in C available.
[8] On the Cell Probe Complexity of Membership and Perfect Hashing
Rasmus Pagh. Proceedings of 33rd ACM Symposium on Theory of Computing (STOC), 2001
Presentation slides.
[7] A Trade-Off for Worst-Case Efficient Dictionaries
Rasmus Pagh. Nordic Journal of Computing 7, 2000
Special issue for SWAT 2000.
[6] A new trade-off for deterministic dictionaries
Rasmus Pagh. Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT), 2000
Presentation slides. Superseded by [7] A Trade-Off for Worst-Case Efficient Dictionaries, 2000.
[5] Deterministic Dictionaries
Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh. Journal of Algorithms 41, 2001
Note: Stronger results have been shown by Milan Ružić in in 2008.
[4] Dispersing Hash Functions
Rasmus Pagh. Proceedings of the 4th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), 2000
Presentation slides. Superseded by [37] Dispersing Hash Functions, 2009.
[3] Faster Deterministic Dictionaries
Rasmus Pagh. Proceedings of 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000
Presentation slides. Superseded by [5] Deterministic Dictionaries, 2001.
[2] Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
Rasmus Pagh. Proceedings of the 6th international Workshop on Algorithms and Data Structures (WADS), LNCS 1663, 1999
Presentation slides. Superseded by [26] Simple and Space-Efficient Minimal Perfect Hash Functions, 2007.
[1] Low Redundancy in Static Dictionaries with O(1) Lookup Time
Rasmus Pagh. Proceedings of 26th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 1644, 1999
Presentation slides. Superseded by [11] Low Redundancy in Static Dictionaries with Constant Query Time, 2001.

Other publications, invited talks

Dimension Reduction with Certainty
Rasmus Pagh. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery (ECML-PKDD), 2016
Large-Scale Similarity Joins With Guarantees
Rasmus Pagh. Similarity Search and Applications (SISAP), Invited talk, 2015
Presentation slides. Further details can be found in our papers in ESA '15 and SODA '16.
Correlated Locality-Sensitive Hashing
Rasmus Pagh. ALGO plenary talk, 2015
Presentation slides.
On Multiseed Lossless Filtration
Rasmus Pagh. Symposium on Combinatorial Pattern Matching (CPM), Invited talk, 2015
Presentation slides.
Large-Scale Similarity Joins With Guarantees
Rasmus Pagh. International Conference on Database Theory (ICDT), Invited paper, 2015
Presentation slides. Further details can be found in our paper in ESA '15.
Association Rule Mining using Maximum Entropy
Rasmus Pagh, Morten Stöckel. Technical report, 2015
Cuckoo Hashing
Rasmus Pagh. Encyclopedia of Algorithms, Springer, 2008
High-performance pseudorandomness
Rasmus Pagh. Invited talk at Symposium on Experimental Algorithms (SEA), 2014
Basic External Memory Data Structures
Rasmus Pagh. Algorithms for Memory Hierarchies. Advanced lectures, LNCS 2625, 2003
Presentation slides.
Hashing, randomness and dictionaries
Rasmus Pagh. PhD thesis, University of Aarhus, x + 167 pp., 2002
Presentation slides. (.mov and .ppt format.)
Fast Random Access to Wavelet Compressed Volumetric Data Using Hashing
Rasmus Pagh, Flemming Friche Rodler. BRICS RS-01-34, 2001
Tetris er svært
Rasmus Pagh. Aktuel Naturvidenskab 4, 2002
Overbeviselsens kunst
Rasmus Pagh. Aktuel Naturvidenskab 5, 2001
Also in Jyllandsposten, September 22, 2002.
Naturvidenskab@home
Jan Gorodkin, Rasmus Pagh. Aktuel Naturvidenskab 4, 2001
Kan computere gætte?
Rasmus Pagh. Aktuel Naturvidenskab 3, 2001

Miscellaneous

Big Data
Rasmus Pagh. OpenITU talk, 2015
Understanding Algorithms and Algorithms for Understanding (Big Data)
Rasmus Pagh. Inaugural lecture, 2013
Cuckoo Hashing for Undergraduates
Rasmus Pagh. Lecture note, 2006
Will the I/O model survive till the 22nd century?
Rasmus Pagh. Talk at the Dagstuhl seminar on Cache-oblivious and cache-aware algorithms, 2004

List of co-authors (73) and number of joint papers

Allan Grønlund (1), Andrea Campagna (8), Andrea Montanari (1), Andreas Björklund (1), Andreas Goerdt (1), Andrzej Lingas (1), Anna Pagh (9), Anna Östlin (2), Charalampos E. Tsourakakis (1), Chin-Wan Chung (1), Christian Worm Mortensen (1), Christos Levcopoulos (1), David P. Woodruff (1), Dimitris Fotakis (2), Djamal Belazzougui (4), Erik Demaine (1), Esben Rune Hansen (1), Fabiano C. Botelho (2), Flemming Friche Rodler (4), Francesco Silvestri (10), Friedhelm Meyer auf der Heide (1), Gil Segev (1), Ha-Myung Park (2), Ilya Razenshteyn (1), Jakob Pagter (1), Jan Gorodkin (1), Joachim Gudmundsson (1), Johan Sivertsen (4), Jóhannes B. Hreinsson (1), Kasper Green Larsen (2), Ke Yi (2), Konstantin Kutzkov (6), Laurent Bulteau (1), Leszek Gasieniec (1), Martin Aumüller (2), Martin Dietzfelbinger (2), Matthew Skala (2), Mayank Goswami (2), Mette Berger (1), Michael Mitzenmacher (3), Michael Rink (1), Mihai Pătraşcu (3), Mikkel Thorup (2), Milan Ružić (4), Morten Krøyer (1), Morten Skaarup Jensen (1), Morten Stöckel (5), Ninh Pham (6), Nivio Ziviani (2), Paolo Boldi (4), Paul Spirakis (2), Peter Bro Miltersen (1), Peter Sanders (2), Peter Tiedemann (1), Philip Bille (1), Po-Shen Loh (1), Qin Zhang (2), Rasmus Pagh (109), Rasmus Resen Amossen (4), Rolf Fagerberg (1), S. Srinivasa Rao (2), Sebastiano Vigna (4), Sung-Hyon Myaeng (1), Takeshi Tokuyama (1), Thomas D. Ahle (2), Tobias Christiani (5), Torben Hagerup (1), U Kang (2), Udi Wieder (1), Uri Zwick (1), Vincent Froese (1), Virginia Vassilevska Williams (1), Zhewei Wei (2),

Updated: 2017-06-26


Valid HTML 4.01 Transitional