|
91 |
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching
Konrad, Christian. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
92 |
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities
Albers, Susanne. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
93 |
Pattern Masking for Dictionary Matching
Charalampopoulos, Panagiotis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
94 |
Secretary Matching Meets Probing with Commitment
Borodin, Allan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
95 |
Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint
Huang, Chien-Chung. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
96 |
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time
Chen, Jianer. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
97 |
Streaming Pattern Matching (Invited Talk)
Starikovskaya, Tatiana. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
98 |
A non-sequential refinement approach to improve word embeddings using GPU-based string matching algorithms
Enthalten in Cluster computing 9.6.2021: 1-12
|
|
|
|
99 |
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design
Enthalten in Preprint Reihe Mathematik 1998, 591
|
|
|
|
100 |
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk)
Husfeldt, Thore. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
Administration
