( en | de | ru )

 

Disambiguation of "Bringmann, Karl"

Author of the publication

copydeleteadd this publication to your clipboard
Top-k-convolution and the quest for near-linear output-sensitive subset sum.

, and . STOC, page 982-995. ACM, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Karl Bringmann

Karl Bringmann

Karl Bringmann

Karl Bringmann

Karl Bringmann

 

Other publications of authors with the same name

Multivariate Analysis of Orthogonal Range Searching and Graph Distances., , and . IPEC, volume 115 of LIPIcs, page 4:1-4:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)., , , and . ACM Trans. Algorithms, 16 (4): 48:1-48:22 (2020)On Near-Linear-Time Algorithms for Dense Subset Sum., and . CoRR, (2020)Multivariate Analysis of Orthogonal Range Searching and Graph Distances., , and . Algorithmica, 82 (8): 2292-2315 (2020)Polyline simplification has cubic complexity., and . J. Comput. Geom., 11 (2): 94-130 (2020)Faster Sublinear-Time Edit Distance., , , and . CoRR, (2023)The Time Complexity of Fully Sparse Matrix Multiplication., , , and . SODA, page 4670-4703. SIAM, (2024)Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution., , and . SODA, page 3069-3090. SIAM, (2022)Faster Minimization of Tardy Processing Time on a Single Machine., , , , and . ICALP, volume 168 of LIPIcs, page 19:1-19:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties., , and . CCC, volume 137 of LIPIcs, page 31:1-31:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)