Selection on $X_1 + X_1 + \cdots X_m$ via Cartesian product tree
- Patrick A. KreitzbergKyle LuckeJake PenningtonO. Serang
- 16 August 2020
Computer Science
Performance of algorithms for selection on $X_1+X-2+\cdots+X_m$ are compared empirically, demonstrating the benefit of the algorithm proposed here.
On Solving Probabilistic Linear Diophantine Equations
- Patrick A. KreitzbergO. Serang
- 2021
Mathematics, Computer Science
The “trimmed p -convolution tree” is introduced an approach that generalizes the applicability of the existing methods and achieves a runtime within a log -factor or better compared to the best existing methods.
Understanding the correlation function of the inhomogeneous hard-sphere fluid
- Jeff B. SchultePatrick A. KreitzbergChris V. HaglundD. Roundy
- 20 March 2013
Physics
Soft fundamental measure theory functional for the Weeks-Chandler-Andersen repulsive potential.
- K. FinsterEric J. KrebsChristopher J. MayPatrick A. KreitzbergD. Roundy
- 1 December 2022
Physics
We introduce a soft fundamental measure theory functional for the purely repulsive Weeks-Chandler-Andersen (WCA) fluid. This classical density functional could serve as a reference fluid for…
Selection on X1+X2+⋅⋅⋅ + Xm with layer-ordered heaps
- Patrick A. KreitzbergKyle LuckeO. Serang
- 2019
Mathematics, Computer Science
Selection on X1 + X1 + ... Xm via Cartesian product tree
- Patrick A. KreitzbergKyle LuckeJake PenningtonO. Serang
- 2020
Mathematics, Computer Science
ZERO-KNOWLEDGE DE NOVO ALGORITHMS FOR ANALYZING SMALL MOLECULES USING MASS SPECTROMETRY
- Patrick A. Kreitzberg
- 2019
Chemistry
Optimal construction of a layer-ordered heap
- Jake PenningtonPatrick A. KreitzbergKyle LuckeO. Serang
- 27 July 2020
Chemistry, Computer Science
A few algorithms for constructing LOHs are introduced, their complexity is analyzed, and it is demonstrated that one algorithm is optimal for building a LOH of any rank $\alpha$.
Selection on $X_1+X_2+\cdots + X_m$ with layer-ordered heaps
- Patrick A. KreitzbergKyle LuckeO. Serang
- 26 October 2019
Computer Science, Mathematics
The ``layer-ordered heap,'' a simple special class of heap with which a new, fast selection algorithm on the Cartesian product of arrays of length $n$ has runtime is introduced.
...
...