Peter M. R. Rasmussen

Orcid: 0000-0001-9219-8410

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Tiling with Squares and Packing Dominos in Polynomial Time.
ACM Trans. Algorithms, July, 2023

Optimal Decremental Connectivity in Non-Sparse Graphs.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing.
Proc. VLDB Endow., 2022

2021
Support of closed walks and second eigenvalue multiplicity of graphs.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Classifying Convex Bodies by Their Contact and Intersection Graphs.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Support of Closed Walks and Second Eigenvalue Multiplicity of Regular Graphs.
CoRR, 2020

No Repetition: Fast Streaming with Highly Concentrated Hashing.
CoRR, 2020

Fast hashing with strong concentration bounds.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2018
Expander Graphs are Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2018

2017
Threshold Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2017

Threshold Cryptosystems From Threshold Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2017

Preventing CLT Attacks on Obfuscation with Linear Overhead.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Preventing CLT Zeroizing Attacks on Obfuscation.
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 ⌋.
J. Integer Seq., 2015

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


  Loading...