|
211 |
Fast and Memory-Efficient BWT Construction of Repetitive Texts Using Lyndon Grammars
Olbrich, Jannik. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
212 |
Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares
Nakashima, Yuto. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
213 |
Fast Gaussian Elimination for Low Treewidth Matrices
Fürer, Martin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
214 |
Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences
Pham, Tuyen. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
215 |
Fast Pseudoalignment Queries on Compressed Colored de Bruijn Graphs
Campanelli, Alessio. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
216 |
Fast quantitative T1 mapping based on simultaneous-multi-slice acquisitions using spiral gradients and model-based reconstruction algorithms applied to whole head MR imaging at 3 Tesla
De Araujo Bibiano, Juliana. - Würzburg : Universität Würzburg, 2025
|
|
|
|
217 |
Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
Kociumaka, Tomasz. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
218 |
Faster Algorithm for Second (s,t)-Mincut and Breaking Quadratic Barrier for Dual Edge Sensitivity for (s,t)-Mincut
Baswana, Surender. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
219 |
Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique
Chan, Timothy M.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
220 |
Faster Algorithms on Linear Delta-Matroids
Koana, Tomohiro. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
