1 citations · 1 across the 5 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Sumsets, 3SUM, Subset Sum: Now for Real!
Nick Fischer
We study a broad class of algorithmic problems with an "additive flavor" such as computing sumsets, 3SUM, Subset Sum and geometric pattern matching. Our starting point is that thes…
cs.DS2024★ 1 cited
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time
Nick Fischer, Leo Wennmann
In this work we revisit the elementary scheduling problem . The goal is to select, among jobs with processing times and due dates, a subset of jobs with maximu…