|
91 |
A non-sequential refinement approach to improve word embeddings using GPU-based string matching algorithms
Enthalten in Cluster computing 9.6.2021: 1-12
|
|
|
|
92 |
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design
Enthalten in Preprint Reihe Mathematik 1998, 591
|
|
|
93 |
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk)
Husfeldt, Thore. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
94 |
Algorithms for Distribution Matching
Schulte, Patrick. - München : Universitätsbibliothek der TU München, 2020
|
|
|
95 |
Applied matching algorithms
Reischmann, Tobias. - Münster, 2020
|
|
|
|
96 |
Dynamic Matching Algorithms in Practice
Henzinger, Monika. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
97 |
Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching
Panagiotas, Ioannis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
98 |
Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences
Kobayashi, Satoshi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
99 |
Fine-Grained Complexity of Regular Expression Pattern Matching and Membership
Schepper, Philipp. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
100 |
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms
Lafond, Manuel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
Administration
