3 citations · 6 across the 4 of their papers we have counts for
5 papers
Selection on via Cartesian product tree
Patrick Kreitzberg, Kyle Lucke, Jake Pennington +1
Selection on the Cartesian product is a classic problem in computer science. Recently, an optimal algorithm for selection on , based on soft heaps, was introduced. By combinin…
Optimal construction of a layer-ordered heap
Jake Pennington, Patrick Kreitzberg, Kyle Lucke +1
The layer-ordered heap (LOH) is a simple, recently proposed data structure used in optimal selection on , thealgorithm with the best known runtime for selection on $X_1+X_2+\c…
Fast exact computation of the most abundant isotope peaks with layer-ordered heaps
Patrick Kreitzberg, Jake Pennington, Kyle Lucke +1
The theoretical computation of isotopic distribution of compounds is crucial in many important applications of mass spectrometry, especially as machine precision grows. A considera…
Selection on with layer-ordered heaps
Patrick Kreitzberg, Kyle Lucke, Oliver Serang
Selection on is an important problem with many applications in areas such as max-convolution, max-product Bayesian inference, calculating most probable isoto…
Most abundant isotope peaks and efficient selection on
Patrick Kreitzberg, Kyle Lucke, Oliver Serang
The isotope masses and relative abundances for each element are fundamental chemical knowledge. Computing the isotope masses of a compound and their relative abundances is an impor…