96 citations · 442 across the 64 of their papers we have counts for
Showing 2026 · cs.DSShow all
2 papers · 2 filters
cs.DS2026
Robustifying Sparse Matrix Multiplication
Karl Bringmann, Nick Fischer, Vasileios Nakos
In the seminal sparse matrix multiplication problem the goal is to compute the product of two matrices when the matrices are sparse, i.e., when the number of nonzeros…
cs.DS2026★ 1 cited
Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
Karl Bringmann, Anita Dürr, Karol Węgrzycki
Bin Packing with bins is a fundamental optimisation problem in which we are given a set of integers and a capacity and the goal is to partition the set into subsets…