Search Results - "Rasmussen, Peter R."

A Case Series of Eustachian Valve Endocarditis: An Under-Diagnosed and Rare Entity by Salehin, Salman, Abu Jazar, Deaa, Rasmussen, Peter R., Mai, Steven L., Safder, Zaid, Jenkins, Sarah, Hasan, Syed Mustajab, Hornak, Joseph P., Raja, Muhammad W.

“…Case series Patients: Male, 62-year-old • Male, 57-year-old Final Diagnosis: Eustachian valve endocarditis Symptoms: Fever • shortness of breath Medication: —…”
Get full text

Combinatorial classification of quantum lens spaces by Jensen, Peter, Klausen, Frederik, Rasmussen, Peter

Get full text

Support of Closed Walks and Second Eigenvalue Multiplicity of the Normalized Adjacency Matrix by McKenzie, Theo, Rasmussen, Peter M. R, Srivastava, Nikhil

“…STOC 2021 We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree $\Delta$ is bounded by…”
Get full text

Expander Graphs are Non-Malleable Codes by Rasmussen, Peter M. R, Sahai, Amit

“…Any $d$-regular graph on $n$ vertices with spectral expansion $\lambda$ satisfying $n = \Omega(d^3\log(d)/\lambda)$ yields a…”
Get full text

Optimal Decremental Connectivity in Non-Sparse Graphs by Aaman, Anders, Karczmarz, Adam, Łącki, Jakub, Parotsidis, Nikos, Rasmussen, Peter M. R, Thorup, Mikkel

“…We present a dynamic algorithm for maintaining the connected and 2-edge-connected components in an undirected graph subject to edge deletions. The algorithm is…”
Get full text

Tiling with Squares and Packing Dominos in Polynomial Time by Aamand, Anders, Abrahamsen, Mikkel, Ahle, Thomas D, Rasmussen, Peter M. R

“…A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling…”
Get full text

No Repetition: Fast Streaming with Highly Concentrated Hashing by Aamand, Anders, Das, Debarati, Kipouridis, Evangelos, Knudsen, Jakob B. T, Rasmussen, Peter M. R, Thorup, Mikkel

“…To get estimators that work within a certain error bound with high probability, a common strategy is to design one that works with constant probability, and…”
Get full text

Fast hashing with Strong Concentration Bounds by Aamand, Anders, Knudsen, Jakob B. T, Knudsen, Mathias B. T, Rasmussen, Peter M. R, Thorup, Mikkel

“…Previous work on tabulation hashing by Patrascu and Thorup from STOC'11 on simple tabulation and from SODA'13 on twisted tabulation offered Chernoff-style…”
Get full text

Combinatorial classification of quantum lens spaces by Jensen, Peter Lunding, Klausen, Frederik Ravn, Rasmussen, Peter M. R

“…Pacific J. Math. 297 (2018) 339-365 We answer the question of how large the dimension of a quantum lens space must be, compared to the primary parameter $r$,…”
Get full text