ITU

Algorithms

Organisational unit: Research Group

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

Contact information

Research Group Coordinator

Thore Husfeldt (thore@itu.dk)

Organisation profile

The Algorithms Research Group

The Algorithms Research Group investigates in producing software that makes efficient use of a computer’s resources, such as data processing capacity and memory usage. Research on algorithms has paved the way for revolutionary innovations such as the quick route planning of the GPS and Google’s search engine. Modern research deals with big amounts of data. The essential issue for many biologists, oceanographers and geographers is no longer whether they have enough data, but whether it is even possible to calculate the results.

Visit the group’s own website:
http://itu-algorithms.github.io/

  1. 2020
  2. Published

    On the I/O Complexity of the k-Nearest Neighbors Problem

    Goswami, M., Jacob, R. & Pagh, R., Jun 2020, PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, p. 205-212 (ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems).

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

  3. Published

    DaNewsroom: A Large-scale Danish Summarisation Dataset

    Varab, D. & Schluter, N., Apr 2020, Proceedings of the 12th Conference on Language Resources and Evaluation (LREC 2020). European Language Resources Association, p. 6731–6739

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

  4. Published

    Algorithm Engineering for High-Dimensional Similarity Search Problems (Invited Talk)

    Aumüller, M., 2020, 18th International Symposium on Experimental Algorithms (SEA 2020). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, p. 1:1–1:3 1. (Leibniz International Proceedings in Informatics (LIPIcs)).

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

  5. Published

    Approximately counting and sampling small witnesses using a colourful decision oracle

    Dell, H., Lapinskas, J. & Meeks, K., 2020, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Chawla, S. (ed.). Society for Industrial and Applied Mathematics, p. 2201-2211 11 p.

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

  6. Published

    Composable Sketches for Functions of Frequencies: Beyond the Worst Case

    Cohen, E., Geri, O. & Pagh, R., 2020, Proceedings of the 37 th International Conference on Machine Learning. ML Research Press

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

  7. Published

    Confirmation Sampling for Exact Nearest Neighbor Search

    Christiani, T. L., Pagh, R. & Thorup, M., 2020, SISAP 2020: Similarity Search and Applications. Springer, p. 97-110 (Lecture Notes in Computer Science, Vol. 12440).

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

  8. Published

    Differentially Private Sketches for Jaccard Similarity Estimation

    Aumüller, M., Bourgeat & Schmurr, 2020, International Conference on Similarity Search and Applications: SISAP 2020. Springer, p. 18-32 (Lecture Notest in Computer Science, Vol. 12440).

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

  9. Published

    Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. PODS

    Aumüller, M., Pagh, R. & Silvestri, F., 2020, PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, p. 191–204

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

  10. Published

    Oblivious Sketching of High-Degree Polynomial Kernels

    Ahle, T. D., Kapralov, M., Knudsen, J. B. T., Pagh, R., Velingker, A., Woodruff, D. & Zandieh, A., 2020, SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, 20 p.

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

  11. Published

    Private Aggregation from Fewer Anonymous Messages

    Ghazi, B., Manurangsi, P., Pagh, R. & Velingker, A., 2020, Advances in Cryptology – EUROCRYPT 2020. Springer, p. 798-827 (Lecture Notes in Computer Science, Vol. 12106).

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

Previous 1 2 3 4 5 6 7 8 ...18 Next