ITU

Algorithms

Organisational unit: Research Group

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

Contact information

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. 2021
  2. Published

    A full complexity dichotomy for immanant families

    Curticapean, R-C., 15 Jun 2021, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 1770 14 p.

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

  3. Published

    Improved Differentially Private Euclidean Distance Approximation

    Nielsen, N. M. S., Jun 2021, PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Interactions IX: Association of Computing Machinery ACM, Vol. 40. p. 42–56 56

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

  4. Published

    Fragile Complexity of Adaptive Algorithms

    Jacob, R., Fagerberg, R., Bose, P., Cano, P., Iacono, J. & Langerman, S., 10 May 2021, International Conference on Algorithms and Complexity. Springer, Vol. LNCS 12701. p. 144-157 14 p. (LNCS, Vol. 12701).

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

  5. Published

    Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model

    Jacob, R., Sitchinava, N. & Goodrich, M. T., 14 Jan 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, p. 2141-2153 13 p.

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

  6. Published

    Computational Complexity of Computing a Quasi-Proper Equilibrium

    Lund, T. B. & Hansen, K. A., 2021, Fundamentals of Computation Theory : 23rd International Symposium, FCT 2021 Athens, Greece, September 12–15, 2021 Proceedings. Cham, p. 259-271 13 p. (Lecture Notes in Computer Science, Vol. 12867).

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

  7. Published

    Differential Privacy in Distributed Settings

    Nielsen, N. M. S., 2021, IT-Universitetet i København. 102 p. (ITU-DS; No. 185).

    Research output: Book / Anthology / Report / Ph.D. thesisPh.D. thesisResearch

  8. Published

    Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access

    Aumüller, M., Pagh, R. & Lebeda, C. J., 2021, Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, 14 p.

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

  9. Published

    Efficient Differentially Private F0 Linear Sketching

    Pagh, R. & Nielsen, N. M. S., 2021, 24th International Conference on Database Theory (ICDT 2021). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, (Leibniz International Proceedings in Informatics (LIPIcs)).

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

  10. Published

    Fair near neighbor search via sampling

    Aumüller, M., Har-Peled, S., Mahabadi, S., Pagh, R. & Silvestri, F., 2021, In: S I G M O D Record. 50, 01

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

  11. Published

    Fine-Grained Reductions from Approximate Counting to Decision

    Dell, H. & Lapinskas, J., 2021, In: ACM Transactions on Computation Theory. 13, 2, p. 1-24 8.

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

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