The first worst-case linear-time algorithm for selection was discovered ...
Generative-adversarial networks (GANs) have been used to produce data cl...
Selection on the Cartesian product is a classic problem in computer scie...
The layer-ordered heap (LOH) is a simple, recently proposed data structu...
The theoretical computation of isotopic distribution of compounds is cru...
Selection on the Cartesian sum, A+B, is a classic and important problem....
Selection on X_1+X_2+... + X_m is an important problem with many
applica...
The isotope masses and relative abundances for each element are fundamen...
Convolution trees, loopy belief propagation, and fast numerical p-convol...
The bit-reversed permutation is a famous task in signal processing and i...
Fast multidimensional convolution can be performed naively in quadratic ...
[abridged] Context: Multidimensional arrays are used by many different
a...
Max-convolution is an important problem closely resembling standard
conv...
Observations depending on sums of random variables are common throughout...