Имейл: [email protected]
Д-р Ник Фишер
За мен:
Аз съм изследовател с широк интерес към теоретичната информатика. Моите специфични изследователски интереси включват детайлна сложност и проектиране на алгоритми, изчислителни проблеми, свързани с адитивната комбинаторика, алгоритми за низове и алгебрични методи.
В момента съм постдокторант в INSAIT, под ръководството на Амир Абуд. Преди това бях постдокторант в Института по наука Вайцман, също под ръководството на Амир Абуд. Преди това завърших докторантурата си в университета в Саарланд и Института Макс Планк за информатика, под ръководството на Карл Брингман.
2025
Nick Fischer, Ce Jin, Yinzhan Xu.
New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
Nick Fischer
Sumsets, 3SUM, Subset Sum: Now for Real!
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
Amir Abboud, Nick Fischer, Ron Safier, Nathan Wallheimer
Recognizing Sumsets is NP-Complete
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
Karl Bringmann, Nick Fischer, Vasileios Nakos
Beating Bellman’s Algorithm for Subset Sum
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio Sulser
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight
In: SIAM Symposium on Simplicity in Algorithms (SOSA 2025)
Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
Near-Optimal Directed Low-Diameter Decompositions
In: EATCS International Colloquium on Automata, Languages and Programming (ICALP 2025)
Nick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S.
Hardness of Median and Center in the Ulam Metric
In: The European Symposium on Algorithms (ESA 2025)
Nick Fischer, Vasileios Nakos
ℓ2/ℓ2 Sparse Recovery via Weighted Hypergraph Peeling
In: The 57th ACM Symposium on Theory of Computing (STOC 2025)
Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
Near-Optimal Directed Low-Diameter Decompositions
In: International Colloquium on Automata, Languages and Programming (ICALP 2025)
Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup
A Faster Algorithm for Constrained Correlation Clustering
In: Symposium on Theoretical Aspects of Computer Science (STACS 2025)
Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi
All-Pairs Shortest Paths with Few Weights per Node
In: The 57th ACM Symposium on Theory of Computing (STOC 2025)
Nick Fischer, Marvin Künnemann, Mirza Redzic, Julian Stieß
The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs
In: International Colloquium on Automata, Languages and Programming (ICALP 2025)
Nick Fischer, Melvin Kallmayer, Leo Wennmann
A Simple Algorithm for Trimmed Multipoint Evaluation
In: European Symposium on Algorithms (ESA 2025)
