|
171 |
Sequential and parallel algorithms for the k closest pairs problem Lenhof, Hans-Peter. - Saarbrücken : MPI Informatik, 1992
|
|
|
172 |
Shorter paths to graph algorithms Möller, Bernhard. - Augsburg : Inst. für Mathematik, 1992
|
|
|
173 |
Simple randomized algorithms for closest pair problems Saarbrücken : MPI Informatik, 1992
|
|
|
174 |
Stochastic models, statistical methods, and algorithms in image analysis Berlin : Springer, 1992
|
|
|
175 |
The design and analysis of algorithms Kozen, Dexter. - New York : Springer, 1992
|
|
|
176 |
The influence of lookahead in competitive on-line algorithms Albers, Susanne. - Saarbrücken : MPI Informatik, 1992
|
|
|
177 |
A unified approach to interior point algorithms for linear complementarity problems Berlin : Springer, 1991
|
|
|
178 |
Algorithms and classification in combinatorial group theory New York : Springer, 1991
|
|
|
179 |
Algorithms and complexity for continuous problems Saarbrücken : Geschäftsstelle Schloss Dagstuhl, 1991
|
|
|
180 |
Algorithms and data structures Berlin : Springer, 1991
|
|