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 - 10 out of 76Page size: 10
  1. 2019
  2. Published

    Hardness of Bichromatic Closest Pair with Jaccard Similarity

    Pagh, R., Nielsen, N. M. S. & Thorup, M., 2019, LIPIcs - Leibniz International Proceedings in Informatics - 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Vol. 144. p. 80:1–80:13 13 p. 80. (Leibniz International Proceedings in Informatics).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  3. Published

    PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors

    Christiani, T. L., Pagh, R., Aumüller, M. & Vesterli, M. E., 2019, 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 1-16 16 p. 10

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  4. Published

    Space-efficient Feature Maps for String Alignment Kernels

    Tabei, Y., Yamanishi, Y. & Pagh, R., 2019, IEEE International Conference on Data Mining (ICDM). IEEE Computer Society Press, (IEEE International Conference on Data Mining (ICDM)).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  5. 2018
  6. 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 Journal › Journal article › Research › peer-review

  7. 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 chapter › Article in proceedings › Research › peer-review

  8. 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 chapter › Article in proceedings › Research › peer-review

  9. 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 chapter › Article in proceedings › Research › peer-review

  10. Published

    Similarity Sketching

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

    Research output: Conference Article in Proceeding or Book/Report chapter › Encyclopedia chapter › Communication

  11. 2017
  12. 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 chapter › Article in proceedings › Research › peer-review

  13. Published

    Hardness and Approximation of High-Dimensional Search Problems

    Pagh, R., 2017.

    Research output: Contribution to conference - NOT published in proceeding or journal › Conference abstract for conference › Research › peer-review

Previous 1 2 3 4 5 6 7 8 Next

ID: 263376