|
251 |
On the existence of fair matching algorithms
Enthalten in Theory and decision Bd. 26, Nr. 3, date:5.1989: 305-322
|
|
|
|
252 |
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
Enthalten in Combinatorica Bd. 9, Nr. 2, date:6.1989: 161-187
|
|
|
253 |
Programming in Networks and Graphs
Derigs, Ulrich. - New York, NY : Springer New York, 1988
|
|
|
254 |
Programming in networks and graphs
Derigs, Ulrich. - Berlin : Springer, 1988
|
|
|
|
255 |
A probabilistic analysis of some greedy cardinality matching algorithms
Enthalten in Annals of operations research Bd. 1, Nr. 3, date:10.1984: 239-254
|
|
|
|
256 |
An analysis of alternate strategies for implementing matching algorithms
Ball, Michael O.. - Bonn : Inst. für Ökonometrie u. Operations-Research, 1982
|
|
|
|
257 |
ADaM: augmenting existing approximate fast matching algorithms with efficient and exact range queries
Enthalten in BMC bioinformatics Bd. 15, 28.5.2014, Nr. 7, date:5.2014: 1-11
|
|
|
|
258 |
Algorithms for matching partially labelled sequence graphs
Enthalten in Algorithms for molecular biology Bd. 12, 25.9.2017, Nr. 1, date:12.2017: 1-22
|
|
|
|
259 |
Algorithms for Matching Strings with Fuzzy Context-Free and Automata Patterns
Enthalten in Pattern recognition and image analysis Bd. 34, 10.4.2024, Nr. 1, date:3.2024: 110-115
|
|
|
|
260 |
An Efficient VLSI Architecture for Full-Search Block Matching Algorithms
Enthalten in The journal of VLSI signal processing systems for signal, image, and video technology Bd. 15, 1.3.1997, Nr. 3, date:3.1997: 275-282
|
|
Administration
