受强制性开放获取政策约束的文章 - Nick Fischer了解详情
可在其他位置公开访问的文章：14 篇
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
强制性开放获取政策： European Commission
The computational complexity of plethysm coefficients
N Fischer, C Ikenmeyer
computational complexity 29, 1-43, 2020
强制性开放获取政策： German Research Foundation
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
强制性开放获取政策： European Commission
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
强制性开放获取政策： European Commission
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
强制性开放获取政策： European Commission
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
强制性开放获取政策： European Commission
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
强制性开放获取政策： Danish Council for Independent Research, Villum Foundation, European Commission
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
强制性开放获取政策： European Commission
New graph decompositions and combinatorial boolean matrix multiplication algorithms
A Abboud, N Fischer, Z Kelley, S Lovett, R Meka
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 935-943, 2024
强制性开放获取政策： European Commission
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
强制性开放获取政策： European Commission
Faster Combinatorial k-Clique Algorithms
A Abboud, N Fischer, Y Shechter
Latin American Symposium on Theoretical Informatics, 193-206, 2024
强制性开放获取政策： European Commission
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem
N Fischer
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
强制性开放获取政策： European Commission
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties
N Fischer, M Künnemann, M Redzic
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
强制性开放获取政策： German Research Foundation, European Commission
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
强制性开放获取政策： European Commission
出版信息和资助信息由计算机程序自动确定