default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNick Fischer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Nick Fischer, Leo Wennmann:
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time. ICALP 2024: 64:1-64:15- [c19]Nick Fischer, Piotr Kaliciak, Adam Polak
:
Deterministic 3SUM-Hardness. ITCS 2024: 49:1-49:24 - [c18]Amir Abboud, Nick Fischer, Yarin Shechter:
Faster Combinatorial k-Clique Algorithms. LATIN (1) 2024: 193-206 - [c17]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. SODA 2024: 208-242 - [c16]Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka:
Faster Sublinear-Time Edit Distance. SODA 2024: 3274-3301 - [c15]Nick Fischer:
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem. SODA 2024: 3333-3353 - [c14]Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann:
The Time Complexity of Fully Sparse Matrix Multiplication. SODA 2024: 4670-4703 - [c13]Nick Fischer, Marvin Künnemann, Mirza Redzic:
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties. SODA 2024: 4704-4727 - [c12]Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka:
New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. STOC 2024: 935-943 - [i22]Amir Abboud, Nick Fischer, Yarin Shechter:
Faster Combinatorial k-Clique Algorithms. CoRR abs/2401.13502 (2024) - [i21]Nick Fischer, Leo Wennmann:
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time. CoRR abs/2402.13357 (2024) - 2023
- [b1]Nick Fischer:
Algorithms for sparse convolution and sublinear edit distance. Saarland University, Saarbrücken, Germany, 2023 - [c11]Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier:
Can You Solve Closest String Faster Than Exhaustive Search? ESA 2023: 3:1-3:17 - [c10]Karl Bringmann, Alejandro Cassis, Nick Fischer:
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! FOCS 2023: 515-538 - [c9]Amir Abboud, Karl Bringmann, Nick Fischer:
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. STOC 2023: 391-404 - [i20]Karl Bringmann, Alejandro Cassis, Nick Fischer:
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! CoRR abs/2304.05279 (2023) - [i19]Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier:
Can You Solve Closest String Faster than Exhaustive Search? CoRR abs/2305.16878 (2023) - [i18]Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann:
The Time Complexity of Fully Sparse Matrix Multiplication. CoRR abs/2309.06317 (2023) - [i17]Nick Fischer:
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem. CoRR abs/2310.11913 (2023) - [i16]Nick Fischer, Piotr Kaliciak, Adam Polak:
Deterministic 3SUM-Hardness. CoRR abs/2310.12913 (2023) - [i15]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. CoRR abs/2310.18128 (2023) - [i14]Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka:
New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. CoRR abs/2311.09095 (2023) - [i13]Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka:
Faster Sublinear-Time Edit Distance. CoRR abs/2312.01759 (2023) - [i12]Nick Fischer, Marvin Künnemann, Mirza Redzic:
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties. CoRR abs/2312.14593 (2023) - [i11]Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka:
New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j3]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. Algorithmica 84(5): 1341-1356 (2022) - [c8]Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann:
A Structural Investigation of the Approximability of Polynomial-Time Problems. ICALP 2022: 30:1-30:20 - [c7]Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
Improved Sublinear-Time Edit Distance for Preprocessed Strings. ICALP 2022: 32:1-32:20 - [c6]Karl Bringmann, Nick Fischer, Vasileios Nakos:
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. SODA 2022: 3069-3090 - [c5]Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
Almost-optimal sublinear-time edit distance in the low distance regime. STOC 2022: 1102-1115 - [i10]Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime. CoRR abs/2202.08066 (2022) - [i9]Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann:
A Structural Investigation of the Approximability of Polynomial-Time Problems. CoRR abs/2204.11681 (2022) - [i8]Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos:
Improved Sublinear-Time Edit Distance for Preprocessed Strings. CoRR abs/2204.14137 (2022) - [i7]Amir Abboud, Karl Bringmann, Nick Fischer:
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. CoRR abs/2211.07058 (2022) - 2021
- [c4]Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann:
Fine-Grained Completeness for Optimization in P. APPROX-RANDOM 2021: 9:1-9:22 - [c3]Karl Bringmann, Nick Fischer, Vasileios Nakos:
Sparse nonnegative convolution is equivalent to dense nonnegative convolution. STOC 2021: 1711-1724 - [i6]Karl Bringmann, Nick Fischer, Vasileios Nakos:
Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution. CoRR abs/2105.05984 (2021) - [i5]Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann:
Fine-Grained Completeness for Optimization in P. CoRR abs/2107.01721 (2021) - [i4]Karl Bringmann, Nick Fischer, Vasileios Nakos:
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. CoRR abs/2107.07625 (2021) - 2020
- [j2]Nick Fischer, Christian Ikenmeyer:
The Computational Complexity of Plethysm Coefficients. Comput. Complex. 29(2): 8 (2020) - [c2]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. ICALP 2020: 19:1-19:12 - [i3]Nick Fischer, Christian Ikenmeyer:
The Computational Complexity of Plethysm Coefficients. CoRR abs/2002.00788 (2020) - [i2]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. CoRR abs/2003.07104 (2020)
2010 – 2019
- 2019
- [j1]Nick Fischer, Rob van Glabbeek:
Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours. J. Log. Algebraic Methods Program. 102: 64-102 (2019) - [c1]Karl Bringmann, Nick Fischer, Marvin Künnemann:
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties. CCC 2019: 31:1-31:27 - 2018
- [i1]Nick Fischer, Rob van Glabbeek:
Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State Behaviours. CoRR abs/1810.07488 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
