11 citations · 35 across the 16 of their papers we have counts for
4 papers · 1 filter
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…
Optimally selecting the top values from with layer-ordered heaps
Oliver Serang
Selection and sorting the Cartesian sum, , are classic and important problems. Here, a new algorithm is presented, which generates the top values of the form . Th…