11 citations · 35 across the 16 of their papers we have counts for
16 papers
static_maps: consteval std::map and std::unordered_map Implementations in C++23
Isaac D. Myhal, Oliver Serang
Using consteval from C++23, we implement efficient, new versions of std::map and std::unordered_map for use when the keys are known at compile time. We demonstrate superior perform…
Median of heaps: linear-time selection by recursively constructing binary heaps
Oliver Serang
The first worst-case linear-time algorithm for selection was discovered in 1973; however, linear-time binary heap construction was first published in 1964. Here we describe another…
Adversarial network training using higher-order moments in a modified Wasserstein distance
Oliver Serang
Generative-adversarial networks (GANs) have been used to produce data closely resembling example data in a compressed, latent space that is close to sufficient for reconstruction i…
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…