Peter M. R. Rasmussen

According to our database, Peter M. R. Rasmussen authored at least 15 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Tiling with Squares and Packing Dominos in Polynomial Time.

Anders Aamand, Mikkel Abrahamsen, Peter M. R. Rasmussen, Thomas D. Ahle

ACM Trans. Algorithms, July, 2023

Optimal Decremental Connectivity in Non-Sparse Graphs.

Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing.

Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup

Proc. VLDB Endow., 2022

2021

Support of closed walks and second eigenvalue multiplicity of graphs.

Theo McKenzie, Peter Michael Reichstein Rasmussen, Nikhil Srivastava

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Classifying Convex Bodies by Their Contact and Intersection Graphs.

Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Support of Closed Walks and Second Eigenvalue Multiplicity of Regular Graphs.

Theo McKenzie, Peter M. R. Rasmussen, Nikhil Srivastava

CoRR, 2020

No Repetition: Fast Streaming with Highly Concentrated Hashing.

Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup

CoRR, 2020

Fast hashing with strong concentration bounds.

Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2018

Expander Graphs are Non-Malleable Codes.

Peter M. R. Rasmussen, Amit Sahai

IACR Cryptol. ePrint Arch., 2018

2017

Threshold Fully Homomorphic Encryption.

Aayush Jain, Peter M. R. Rasmussen, Amit Sahai

IACR Cryptol. ePrint Arch., 2017

Threshold Cryptosystems From Threshold Fully Homomorphic Encryption.

Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter M. R. Rasmussen, Amit Sahai

IACR Cryptol. ePrint Arch., 2017

Preventing CLT Attacks on Obfuscation with Linear Overhead.

Rex Fernando, Peter M. R. Rasmussen, Amit Sahai

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Preventing CLT Zeroizing Attacks on Obfuscation.

Rex Fernando, Peter M. R. Rasmussen, Amit Sahai

IACR Cryptol. ePrint Arch., 2016

2015

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

Sebastian Tim Holdum, Frederik Ravn Klausen, Peter Michael Reichstein Rasmussen

J. Integer Seq., 2015

Powers in Prime Bases and a Problem on Central Binomial Coefficients.

Sebastian Tim Holdum, Frederik Ravn Klausen, Peter Michael Reichstein Rasmussen

Integers, 2015