Nick Fischer

Available identifiers

Publication	Date of Publication	Type
Can you solve closest string faster than exhaustive search?	2025-01-06	Paper
Dynamic dynamic time warping	2024-11-28	Paper
Faster sublinear-time edit distance	2024-11-28	Paper
Deterministic sparse pattern matching via the Baur-Strassen theorem	2024-11-28	Paper
The time complexity of fully sparse matrix multiplication	2024-11-28	Paper
The effect of sparsity on \(k\)-Dominating Set and related first-order graph properties	2024-11-28	Paper
Deterministic and Las Vegas algorithms for sparse nonnegative convolution	2024-07-19	Paper
A structural investigation of the approximability of polynomial-time problems	2024-06-24	Paper
Improved sublinear-time edit distance for preprocessed strings	2024-06-24	Paper
Faster combinatorial \(k\)-clique algorithms	2024-05-31	Paper
Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics	2024-05-08	Paper
Almost-optimal sublinear-time edit distance in the low distance regime	2023-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q6090879	2023-11-20	Paper
Sparse nonnegative convolution is equivalent to dense nonnegative convolution	2023-11-14	Paper
A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties	2022-07-27	Paper
Faster minimization of tardy processing time on a single machine	2022-05-03	Paper
The computational complexity of plethysm coefficients	2021-05-25	Paper
Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours	2018-12-19	Paper

This page was built for person: Nick Fischer