Anders Aamand

Anders Aamand

PhD Student


Publication year:
  1. 2021
  2. Published

    Classifying convex bodies by their contact and intersection graphs

    Aamand, Anders, Abrahamsen, Mikkel, Knudsen, J. B. T. & Rasmussen, Peter Michael Reichstein, 2021, 37th International Symposium on Computational Geometry, SoCG 2021. Buchin, K. & de Verdiere, E. C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16 p. 3. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 189).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  3. In preparation

    No Repetition: Fast Streaming with Highly Concentrated Hashing

    Aamand, Anders, Das, D., Kipouridis, Evangelos, Knudsen, J. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2021, (In preparation) 10 p.

    Research output: Working paperResearch

  4. 2020
  5. Published

    Disks in Curves of Bounded Convex Curvature

    Aamand, Anders, Abrahamsen, Mikkel & Thorup, Mikkel, 2020, In: American Mathematical Monthly. 127, 7, p. 579-593 15 p.

    Research output: Contribution to journalJournal articleResearchpeer-review

  6. Published

    Fast hashing with strong concentration bounds

    Aamand, Anders, Knudsen, J. B. T., Knudsen, M. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1265-1278 (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  7. Published

    Simple Hashing-Based Algorithms with Strong Theoretical Guarantees

    Aamand, Anders, 2020, Department of Computer Science, Faculty of Science, University of Copenhagen. 189 p.

    Research output: Book/ReportPh.D. thesisResearch

  8. 2019
  9. Published

    Non-empty Bins with Simple Tabulation Hashing

    Aamand, Anders & Thorup, Mikkel, 2 Jan 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (ed.). Society for Industrial and Applied Mathematics, p. 2498-2512

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

  10. 2018
  11. Published

    One-wasy trail orientation

    Aamand, Anders, Hjuler, N., Holm, Jacob & Rotenberg, E., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 13 p. 6. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 107).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  12. Published

    Power of d choices with simple tabulation

    Aamand, Anders, Knudsen, M. B. T. & Thorup, Mikkel, 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14 p. 5. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 107).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

ID: 135863734