|
121 |
Simple algorithms for disjoint Steiner trees and paths packing problems in planar graphs Wagner, Dorothea. - Berlin : TU, Fachbereich 3, 1993, Als Ms. vervielfältigt
|
|
|
122 |
Static and dynamic algorithms for k-point clustering problems Saarbrücken : MPI Informatik, 1993
|
|
|
123 |
Study of jet reconstruction algorithms for HERA ep collider events Hamburg : DESY, 1993
|
|
|
124 |
Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection Mehlhorn, Kurt. - Saarbrücken : MPI Informatik, 1993
|
|
|
125 |
The visibility problem for single valued surface (z Slavkovsky, Peter. - München : SFB 342, 1993
|
|
|
126 |
Towards dynamic randomized algorithms in computational geometry Teillaud, Monique. - Berlin : Springer, 1993
|
|
|
127 |
Using graphics algorithms as subroutines in collision detection Müller, Heinrich. - Dortmund : Dekanat Informatik, Univ., 1993
|
|
|
128 |
A method for obtaining randomized algorithms with small tail probalities Saarbrücken : MPI Informatik, 1992
|
|
|
129 |
Algorithmen in C++ Sedgewick, Robert. - Bonn : Addison-Wesley, 1992, 1. Aufl.
|
|
|
130 |
Algorithmen in C Sedgewick, Robert. - Bonn : Addison-Wesley, 1992, 1. Aufl.
|
|