1. Faster knapsack algorithms via bounded monotone min-plus-convolution;Bringmann,2022
2. Tree edit distance cannot be computed in strongly subcubic time (unless APSP can);Bringmann,2018
3. Tree edit distance cannot be computed in strongly subcubic time (unless APSP can);Bringmann;ACM Trans. Algorithms,2020
4. Truly sub-cubic algorithms for language edit distance and RNA-folding via fast bounded-difference min-plus product;Bringmann,2016
5. Clustered integer 3SUM via additive combinatorics;Chan,2015