P. Rasmussen

Most-cited papers

Threshold Cryptosystems From Threshold Fully Homomorphic Encryption
D. Boneh, R. Gennaro, Steven Goldfeder, Aayush Jain +3 more
2018IACR Cryptology ePrint Archive282 citations
Semantic Scholar
Threshold Fully Homomorphic Encryption
Aayush Jain, P. Rasmussen, Amit Sahai
2017IACR Cryptology ePrint Archive49 citations
Semantic Scholar
Fast hashing with strong concentration bounds
Anders Aamand, Jakob Bæk Tejs Knudsen, M. B. T. Knudsen, P. Rasmussen +1 more
2019Symposium on the Theory of Computing19 citations Open access
Semantic Scholar
Preventing CLT Attacks on Obfuscation with Linear Overhead
R. Fernando, P. Rasmussen, Amit Sahai
2017International Conference on the Theory and Application of Cryptology and Information Security15 citations
Semantic Scholar
Tiling with Squares and Packing Dominos in Polynomial Time
Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, P. Rasmussen
2020International Symposium on Computational Geometry11 citations Open access
Semantic Scholar
Optimal Decremental Connectivity in Non-Sparse Graphs
Anders Aamand, Adam Karczmarz, J. Lacki, Nikos Parotsidis +2 more
2021International Colloquium on Automata, Languages and Programming10 citations
Semantic Scholar
Support of closed walks and second eigenvalue multiplicity of graphs
T. McKenzie, P. Rasmussen, N. Srivastava
2021Symposium on the Theory of Computing9 citations Open access
Semantic Scholar
Preventing CLT Zeroizing Attacks on Obfuscation
R. Fernando, P. Rasmussen, Amit Sahai
2016IACR Cryptology ePrint Archive6 citations
Semantic Scholar
Expander Graphs are Non-Malleable Codes
P. Rasmussen, Amit Sahai
2018IACR Cryptology ePrint Archive5 citations
Semantic Scholar
Combinatorial classification of quantum lens spaces
Peter Lunding Jensen, Frederik Ravn Klausen, P. Rasmussen
2017Pacific Journal of Mathematics4 citations Open access
Semantic Scholar
Classifying Convex Bodies by their Contact and Intersection Graphs
Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, P. Rasmussen
2019International Symposium on Computational Geometry3 citations
Semantic Scholar
Powers in Prime Bases and a Problem on Central Binomial Coefficients
Sebastian Tim Holdum, Frederik Ravn Klausen, P. Rasmussen
2015Integers3 citations
Semantic Scholar
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing
Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen +2 more
2022Proceedings of the VLDB Endowment2 citations Open access
Semantic Scholar
No Repetition: Fast Streaming with Highly Concentrated Hashing
Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen +2 more
2020arXiv.org2 citations
Semantic Scholar
Support of Closed Walks and Second Eigenvalue Multiplicity of the Normalized Adjacency Matrix
T. McKenzie, P. Rasmussen, N. Srivastava
20201 citations
Semantic Scholar
Support of Closed Walks and Second Eigenvalue Multiplicity of Regular Graphs
T. McKenzie, P. Rasmussen, N. Srivastava
2020arXiv.org1 citations
Semantic Scholar
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, P. Rasmussen
2015Journal of Integer Sequences1 citations
Semantic Scholar
Powers in prime bases and a problem on central binomial coefficients
Sebastian Tim Holdum, Frederik Ravn Klausen, P. Rasmussen
20260 citations
Semantic Scholar
PASSBY MEASURMENTS VS. STSF PASSBY SIMULATIONS
S. Gade, P. Rasmussen, N. Taylor
2024Noise Control0 citations Open access
Semantic Scholar
A Mathematical Introduction to Spectral Expansion
P. Rasmussen
20190 citations
Semantic Scholar
Flow Equivalence of Shift Spaces
P. Rasmussen
20150 citations
Semantic Scholar
On a Conjecture on the Representation of Positive Integers as the Sum of Three Terms of the Sequence $\left\lfloor \frac{n^2}{a} \right\rfloor$
Sebastian Tim Holdum, Frederik Ravn Klausen, P. Rasmussen
20150 citations
Semantic Scholar