NF
Nick Fischer
cs.DScs.CCcs.CGcs.DMcs.DBcs.LGmath.RT
On Valency
published · living versionsW_9etwc8me·v1 · currentpublished
The Hyperclique Hypothesis is False
1 version
W_qh8txmgc·v1published
Preprints & journals
39 papers in the corpus · 2020–2026Robustifying Sparse Matrix Multiplication2607.01427v1 · Karl Bringmann, Nick Fischer, Vasileios Nakos2026 · 0 citationsarXiv
Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration2606.02183v2 · Karl Bringmann, Nick Fischer, Yanheng Wang2026 · 0 citationsarXiv
An Optimal Algorithm for Binary Closest String2605.31417v1 · Nick Fischer, Mursalin Habib2026 · 0 citationsarXiv
Node-Weighted Triangles: Faster and Simpler2605.08588v1 · Shyan Akmal, Nick Fischer2026 · 0 citationsarXiv
Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection2603.28843v1 · Bart\lomiej Dudek, Nick Fischer, Geri Gokaj et al.2026 · 0 citationsarXiv
Universe Reduction for APSP: Equivalence of Three Fine-Grained Hypotheses2603.27736v1 · Nick Fischer2026 · 0 citationsarXiv
Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts2601.16923v1 · Nick Fischer, Marvin Kunnemann, Mirza Redzic2026 · 0 citationsarXiv
Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems2510.20341v1 · Aaron Bernstein, Sayan Bhattacharya, Nick Fischer et al.2025 · 0 citationsarXiv
Sparse Recovery via Weighted Hypergraph Peeling2510.20361v1 · Nick Fischer, Vasileios Nakos2025 · 0 citationsarXiv
A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection2507.18845v3 · Amir Abboud, Shyan Akmal, Nick Fischer2025 · 0 citationsarXiv
All-Pairs Shortest Paths with Few Weights per Node2506.20017v1 · Amir Abboud, Nick Fischer, Ce Jin et al.2025 · 1 citationarXiv
Hardness of Median and Center in the Ulam Metric2504.16437v1 · Nick Fischer, Elazar Goldenberg, Mursalin Habib et al.2025 · 0 citationsarXiv
Near-Optimal Directed Low-Diameter Decompositions2502.05687v1 · Karl Bringmann, Nick Fischer, Bernhard Haeupler et al.2025 · 0 citationsarXiv
A Faster Algorithm for Constrained Correlation Clustering2501.03154v1 · Nick Fischer, Evangelos Kipouridis, Jonas Klausen et al.2025 · 0 citationsarXiv
Beating Bellman's Algorithm for Subset Sum2410.21942v1 · Karl Bringmann, Nick Fischer, Vasileios Nakos2024 · 2 citationsarXiv
Sumsets, 3SUM, Subset Sum: Now for Real!2410.21953v1 · Nick Fischer2024 · 1 citationarXiv
New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching2410.20764v1 · Nick Fischer, Ce Jin, Yinzhan Xu2024 · 2 citationsarXiv
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths2410.20959v1 · Nick Fischer, Bernhard Haeupler, Rustam Latypov et al.2024 · 0 citationsarXiv
Recognizing Sumsets is NP-Complete2410.18661v2 · Amir Abboud, Nick Fischer, Ron Safier et al.2024 · 2 citationsarXiv
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time2402.13357v3 · Nick Fischer, Leo Wennmann2024 · 1 citationTheoretiCS, Volume 4 (July 17, 2025) theoretics:14069
Faster Combinatorial k-Clique Algorithms2401.13502v2 · Amir Abboud, Nick Fischer, Yarin Shechter2024 · 5 citationsarXiv
The Effect of Sparsity on -Dominating Set and Related First-Order Graph Properties2312.14593v1 · Nick Fischer, Marvin Kunnemann, Mirza Redzic2023 · 2 citationsarXiv
Faster Sublinear-Time Edit Distance2312.01759v1 · Karl Bringmann, Alejandro Cassis, Nick Fischer et al.2023 · 3 citationsarXiv
New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms2311.09095v2 · Amir Abboud, Nick Fischer, Zander Kelley et al.2023 · 5 citationsarXiv
Dynamic Dynamic Time Warping2310.18128v3 · Karl Bringmann, Nick Fischer, Ivor van der Hoog et al.2023 · 23 citationsarXiv
Deterministic 3SUM-Hardness2310.12913v2 · Nick Fischer, Piotr Kaliciak, Adam Polak2023 · 1 citationarXiv
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem2310.11913v1 · Nick Fischer2023 · 2 citationsarXiv
The Time Complexity of Fully Sparse Matrix Multiplication2309.06317v1 · Amir Abboud, Karl Bringmann, Nick Fischer et al.2023 · 7 citationsarXiv
Can You Solve Closest String Faster than Exhaustive Search?2305.16878v2 · Amir Abboud, Nick Fischer, Elazar Goldenberg et al.2023 · 0 citationsarXiv
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!2304.05279v1 · Karl Bringmann, Alejandro Cassis, Nick Fischer2023 · 8 citationsarXiv
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics2211.07058v2 · Amir Abboud, Karl Bringmann, Nick Fischer2022 · 12 citationsarXiv
Improved Sublinear-Time Edit Distance for Preprocessed Strings2204.14137v1 · Karl Bringmann, Alejandro Cassis, Nick Fischer et al.2022 · 5 citationsarXiv
A Structural Investigation of the Approximability of Polynomial-Time Problems2204.11681v1 · Karl Bringmann, Alejandro Cassis, Nick Fischer et al.2022 · 1 citationarXiv
Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime2202.08066v2 · Karl Bringmann, Alejandro Cassis, Nick Fischer et al.2022 · 6 citationsarXiv
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution2107.07625v1 · Karl Bringmann, Nick Fischer, Vasileios Nakos2021 · 8 citationsarXiv
Fine-Grained Completeness for Optimization in P2107.01721v1 · Karl Bringmann, Alejandro Cassis, Nick Fischer et al.2021 · 1 citationarXiv
Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution2105.05984v2 · Karl Bringmann, Nick Fischer, Vasileios Nakos2021 · 8 citationsarXiv
Faster Minimization of Tardy Processing Time on a Single Machine2003.07104v2 · Karl Bringmann, Nick Fischer, Danny Hermelin et al.2020 · 5 citationsarXiv
The Computational Complexity of Plethysm Coefficients2002.00788v1 · Nick Fischer, Christian Ikenmeyer2020 · 20 citationsarXiv
Career total: 52 works. 39 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.