| A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^ k-Forall-Quantified First-Order Graph Properties K Bringmann, N Fischer, M Künnemann 34th computational complexity conference (CCC 2019), 2019 | 21 | 2019 |
| Stronger 3-sum lower bounds for approximate distance oracles via additive combinatorics A Abboud, K Bringmann, N Fischer Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 391-404, 2023 | 20 | 2023 |
| Sparse nonnegative convolution is equivalent to dense nonnegative convolution K Bringmann, N Fischer, V Nakos Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 15 | 2021 |
| The computational complexity of plethysm coefficients N Fischer, C Ikenmeyer computational complexity 29, 1-43, 2020 | 15 | 2020 |
| Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution∗ K Bringmann, N Fischer, V Nakos Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 13 | 2022 |
| Faster minimization of tardy processing time on a single machine K Bringmann, N Fischer, D Hermelin, D Shabtay, P Wellnitz Algorithmica 84 (5), 1341-1356, 2022 | 11 | 2022 |
| Almost-optimal sublinear-time edit distance in the low distance regime K Bringmann, A Cassis, N Fischer, V Nakos Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 10 | 2022 |
| Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours N Fischer, R van Glabbeek Journal of Logical and Algebraic Methods in Programming 102, 64-102, 2019 | 9 | 2019 |
| Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! K Bringmann, A Cassis, N Fischer 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 8 | 2023 |
| Improved sublinear-time edit distance for preprocessed strings K Bringmann, A Cassis, N Fischer, V Nakos arXiv preprint arXiv:2204.14137, 2022 | 8 | 2022 |
| New graph decompositions and combinatorial boolean matrix multiplication algorithms A Abboud, N Fischer, Z Kelley, S Lovett, R Meka arXiv preprint arXiv:2311.09095, 2023 | 4 | 2023 |
| Faster Combinatorial k-Clique Algorithms A Abboud, N Fischer, Y Shechter Latin American Symposium on Theoretical Informatics, 193-206, 2024 | 3 | 2024 |
| Deterministic 3SUM-Hardness N Fischer, P Kaliciak, A Polak arXiv preprint arXiv:2310.12913, 2023 | 3 | 2023 |
| Fine-grained completeness for optimization in P K Bringmann, A Cassis, N Fischer, M Künnemann arXiv preprint arXiv:2107.01721, 2021 | 3 | 2021 |
| A structural investigation of the approximability of polynomial-time problems K Bringmann, A Cassis, N Fischer, M Künnemann arXiv preprint arXiv:2204.11681, 2022 | 2 | 2022 |
| Minimizing tardy processing time on a single machine in near-linear time N Fischer, L Wennmann arXiv preprint arXiv:2402.13357, 2024 | 1 | 2024 |
| Faster Sublinear-Time Edit Distance K Bringmann, A Cassis, N Fischer, T Kociumaka Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 1 | 2024 |
| Dynamic Dynamic Time Warping K Bringmann, N Fischer, I van der Hoog, E Kipouridis, T Kociumaka, ... Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 1 | 2024 |
| Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem N Fischer Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 1 | 2024 |
| The Time Complexity of Fully Sparse Matrix Multiplication A Abboud, K Bringmann, N Fischer, M Künnemann Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 1 | 2024 |
