ITU
ITU
Rasmus Pagh

Rasmus Pagh

Full Professor

IT University of Copenhagen
Rued Langgaards Vej 7
DK-2300 Copenhagen S
Denmark

Building: 4B06

Phone: +45 7218 5284

Information Desk: 72185000

Research Group Coordinator

Algorithms

View graph of relations

  1. 2018
  2. Published

    CoveringLSH: Locality-sensitive Hashing without False Negatives

    Pagh, R., 2018, In : A C M Transactions on Algorithms. 14, 3, 29.

    Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

  3. Published

    Distance-Sensitive Hashing

    Aumüller, M., Christiani, T. L., Pagh, R. & Silvestri, F., 2018, Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database System. New York, NY, USA: Association for Computing Machinery, p. 89-104 15 p.

    Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

  4. Published

    Scalable and Robust Set Similarity Join

    Christiani, T. L., Pagh, R. & Sivertsen, J. V. T., 2018, Proceedings of IEEE 34th International Conference on Data Engineering (ICDE). IEEE, (Proceedings of the International Conference on Data Engineering).

    Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

  5. Published

    Set Similarity Search for Skewed Data

    McCauley, S., Mikkelsen, J. W. & Pagh, R., 2018, Proceedings of Principles of Database Systems (PODS). Association for Computing Machinery

    Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

  6. Published

    Similarity Sketching

    Pagh, R., 2018, Encyclopedia of Big Data Technologies. Springer

    Research output: Conference Article in Proceeding or Book/Report chapterEncyclopedia chapterCommunication

  7. 2017
  8. Published

    Distance Sensitive Bloom Filters Without False Negatives

    Goswami, M., Pagh, R., Silvestri, F. & Sivertsen, J., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. Society for Industrial and Applied Mathematics, p. 257-269 13 p.

    Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

  9. Published

    Hardness and Approximation of High-Dimensional Search Problems

    Pagh, R., 2017.

    Research output: Contribution to conference - NOT published in proceeding or journalConference abstract for conferenceResearchpeer-review

  10. Published

    I/O-efficient Similarity Join

    Pagh, R., Pham, N. D., Silvestri, F. & Stöckel, M. D., 2017, In : Algorithmica. 78

    Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

  11. Published

    Parameter-free Locality Sensitive Hashing for Spherical Range Reporting

    Ahle, T. D., Pagh, R. & Aumüller, M., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 18 p.

    Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

  12. Published

    Range-efficient consistent sampling and locality-sensitive hashing for polygons

    Gudmundsson, J. & Pagh, R., 2017, Proceedings of 28th International Symposium on Algorithms and Computation (ISAAC 2017). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 15 p. (Leibniz International Proceedings in Informatics).

    Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

Previous 1 2 3 4 5 6 7 8 Next

ID: 263376