default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter M. R. Rasmussen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Anders Aamand
, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. ACM Trans. Algorithms 19(3): 30:1-30:28 (2023)- [c8]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP 2023: 6:1-6:17 - 2022
- [j3]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing. Proc. VLDB Endow. 15(13): 3989-4001 (2022) - [c7]Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. SoCG 2022: 1:1-1:17 - 2021
- [c6]Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen:
Classifying Convex Bodies by Their Contact and Intersection Graphs. SoCG 2021: 3:1-3:16 - [c5]Theo McKenzie, Peter Michael Reichstein Rasmussen, Nikhil Srivastava:
Support of closed walks and second eigenvalue multiplicity of graphs. STOC 2021: 396-407 - [i11]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR abs/2111.09376 (2021) - 2020
- [c4]Peter Michael Reichstein Rasmussen, Amit Sahai:
Expander Graphs Are Non-Malleable Codes. ITC 2020: 6:1-6:10 - [c3]Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup:
Fast hashing with strong concentration bounds. STOC 2020: 1265-1278 - [i10]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast Streaming with Highly Concentrated Hashing. CoRR abs/2004.01156 (2020) - [i9]Theo McKenzie, Peter M. R. Rasmussen, Nikhil Srivastava:
Support of Closed Walks and Second Eigenvalue Multiplicity of Regular Graphs. CoRR abs/2007.12819 (2020) - [i8]Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. CoRR abs/2011.10983 (2020)
2010 – 2019
- 2019
- [i7]Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen:
Classifying Convex Bodies by their Contact and Intersection Graphs. CoRR abs/1902.01732 (2019) - [i6]Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
Fast hashing with Strong Concentration Bounds. CoRR abs/1905.00369 (2019) - 2018
- [c2]Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter M. R. Rasmussen, Amit Sahai:
Threshold Cryptosystems from Threshold Fully Homomorphic Encryption. CRYPTO (1) 2018: 565-596 - [i5]Peter M. R. Rasmussen, Amit Sahai:
Expander Graphs are Non-Malleable Codes. CoRR abs/1810.00106 (2018) - [i4]Peter M. R. Rasmussen, Amit Sahai:
Expander Graphs are Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2018: 929 (2018) - 2017
- [c1]Rex Fernando, Peter M. R. Rasmussen, Amit Sahai:
Preventing CLT Attacks on Obfuscation with Linear Overhead. ASIACRYPT (3) 2017: 242-271 - [i3]Aayush Jain, Peter M. R. Rasmussen, Amit Sahai:
Threshold Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2017: 257 (2017) - [i2]Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter M. R. Rasmussen, Amit Sahai:
Threshold Cryptosystems From Threshold Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2017: 956 (2017) - 2016
- [i1]Rex Fernando, Peter M. R. Rasmussen, Amit Sahai:
Preventing CLT Zeroizing Attacks on Obfuscation. IACR Cryptol. ePrint Arch. 2016: 1070 (2016) - 2015
- [j2]Sebastian Tim Holdum, Frederik Ravn Klausen, Peter Michael Reichstein Rasmussen:
Powers in Prime Bases and a Problem on Central Binomial Coefficients. Integers 15: A43 (2015) - [j1]Sebastian Tim Holdum, Frederik Ravn Klausen, Peter Michael Reichstein Rasmussen:
On a Conjecture on the Representation of Positive Integers as the Sum of Three Terms of the Sequence ⌊ n2/a ⌋. J. Integer Seq. 18(6): 15.6.3 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
