|
161 |
New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance
Enthalten in The journal of supercomputing 20.11.2017: 1-20
|
|
|
|
162 |
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms
Enthalten in Algorithmica 6.6.2017: 1-22
|
|
|
|
163 |
Control of force during rapid visuomotor force-matching tasks can be described by discrete time PID control algorithms
Enthalten in Experimental brain research 29.5.2017: 1-13
|
|
|
164 |
A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
Raghvendra, Sharath. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
165 |
Beating Ratio 0.5 for Weighted Oblivious Matching Problems
Abolhassani, Melika. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
166 |
Bipartite Matching with Linear Edge Weights
Domanic, Nevzat Onur. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
167 |
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap
Amir, Amihood. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
168 |
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching
Brubach, Brian. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
169 |
On the Complexity of Matching Cut in Graphs of Fixed Diameter
Le, Hoang-Oanh. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
170 |
On the Power of Advice and Randomization for Online Bipartite Matching
Dürr, Christoph. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
Administration
