|
391 |
An analysis of alternate strategies for implementing matching algorithms Ball, Michael O.. - Bonn : Inst. für Ökonometrie u. Operations-Research, 1982
|
|
|
392 |
Bounds for multifit scheduling algorithms on uniform multiprocessor systems Kunde, Manfred. - Kiel : Inst. für Informatik u. Prakt. Mathematik, 1982
|
|
|
393 |
Complexity of matroid property algorithms Jensen, Per M.. - Bonn : Inst. für Ökonometrie u. Operations-Research, [1982 ?]
|
|
|
394 |
Fast Fourier transform and convolution algorithms Nussbaumer, Henri J.. - Berlin : Springer, 1982, 2., corr. and updated ed.
|
|
|
395 |
Fitting linear models MacIntosh, Allen. - New York : Springer, 1982
|
|
|
396 |
Group-theoretic algorithms and graph isomorphism Hoffmann, Christoph M.. - Berlin : Springer, 1982
|
|
|
397 |
Mathematics for the analysis of algorithms Greene, Daniel H.. - Boston : Birkhäuser, 1982, 2. ed.
|
|
|
398 |
On two computational models for probabilistic algorithms Lautemann, Clemens. - Berlin : Techn. Univ., Fachbereich 20 - Informatik, 1982
|
|
|
399 |
Algorithmen Horowitz, Ellis. - Berlin : Springer, 1981
|
|
|
400 |
Algorithms for evaluating separable, mixed, state independent queueing networks or improving (slightly) on mean value analysis Beilner, Heinz. - Dortmund : Abt. Informatik, Univ., 1981
|
|