Peter Michael Reichstein Rasmussen

Search results

• 2023

  Optimal Decremental Connectivity in Non-Sparse Graphs

  Aamand, A., Karczmarz, A., Łącki, J., Parotsidis, N., Rasmussen, P. M. R. & Thorup, M., 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-17 6. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 261).

  Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  Open Access

  File
  1 Citation (Scopus)

  13 Downloads (Pure)

• Tiling with Squares and Packing Dominos in Polynomial Time

  Aamand, A., Abrahamsen, M., Rasmussen, P. M. R. & Ahle, T. D., 2023, In: ACM Transactions on Algorithms. 19, 3, p. 1-28 30.

  Research output: Contribution to journal › Journal article › Research › peer-review

  Open Access

  File
  2 Citations (Scopus)

  8 Downloads (Pure)
• 2022

  No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing

  Aamand, A., Das, D., Kipouridis, E., Knudsen, J. B. T., Rasmussen, P. M. R. & Thorup, M., 2022, In: Proceedings of the VLDB Endowment. 15, 13, p. 3989-4001

  Research output: Contribution to journal › Conference article › Research › peer-review

  Open Access

  File
  1 Citation (Scopus)

  91 Downloads (Pure)

• Tiling with Squares and Packing Dominos in Polynomial Time

  Aamand, A., Abrahamsen, M., Ahle, T. & Rasmussen, P. M. R., 2022, 38th International Symposium on Computational Geometry, SoCG 2022. Goaoc, X. & Kerber, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 1. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 224).

  Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  Open Access

  File
  1 Citation (Scopus)

  18 Downloads (Pure)
• 2021

  Classifying convex bodies by their contact and intersection graphs

  Aamand, A., Abrahamsen, M., Knudsen, J. B. T. & Rasmussen, P. M. R., 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 proceeding › Article in proceedings › Research › peer-review

  Open Access

  File
  2 Citations (Scopus)

  40 Downloads (Pure)

• Support of closed walks and second eigenvalue multiplicity of graphs

  McKenzie, T., Rasmussen, P. M. R. & Srivastava, N., 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, Inc., p. 396-407

  Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  Open Access

  File
  4 Citations (Scopus)

  21 Downloads (Pure)
• 2020

  Expander graphs are non-malleable codes

  Rasmussen, P. M. R. & Sahai, A., 2020, 1st Conference on Information-Theoretic Cryptography, ITC 2020. Kalai, Y. T., Smith, A. D. & Wichs, D. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-10 6. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 163).

  Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  Open Access

  File
  1 Citation (Scopus)

  32 Downloads (Pure)

• Fast hashing with strong concentration bounds

  Aamand, A., Knudsen, J. B. T., Knudsen, M. B. T., Rasmussen, P. M. R. & Thorup, M., 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 proceeding › Article in proceedings › Research › peer-review

  Open Access

  File
  4 Citations (Scopus)

  102 Downloads (Pure)

• No Repetition: Fast Streaming with Highly Concentrated Hashing

  Aamand, A., Das, D., Kipouridis, E., Knudsen, J. B. T., Rasmussen, P. M. R. & Thorup, M., 2020, arXiv.org, 10 p.

  Research output: Working paper › Research

  Open Access

  File
  65 Downloads (Pure)
• 2018

  Combinatorial classification of quantum lens spaces

  Jensen, P. L., Klausen, F. R. & Rasmussen, P. M. R., Dec 2018, In: Pacific Journal of Mathematics. 297, 2, p. 339-365

  Research output: Contribution to journal › Journal article › Research › peer-review
  2 Citations (Scopus)

• Threshold cryptosystems from threshold fully homomorphic encryption

  Boneh, D., Gennaro, R., Goldfeder, S., Jain, A., Kim, S., Rasmussen, P. M. R. & Sahai, A., 2018, Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Boldyreva, A. & Shacham, H. (eds.). Springer, p. 565-596 32 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 10991 LNCS).

  Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
  122 Citations (Scopus)
• 2015

  On a Conjecture on the Representation of Positive Integers as the Sum of Three Terms of the Sequence ⌊ n2/a ⌋

  Holdum, S. T., Klausen, F. R. & Rasmussen, P. M. R., 1 Feb 2015, In: Journal of Integer Sequences. 18, 6, 15.6.3.

  Research output: Contribution to journal › Journal article › Research › peer-review

  1 Citation (Scopus)

• Powers in prime bases and a problem on central binomial coefficients

  Holdum, S. T., Klausen, F. R. & Rasmussen, P. M. R., 2015, In: Integers. 15, 13 p., A43.

  Research output: Contribution to journal › Journal article › Research › peer-review