Hochschulschrift - Master (10)
221.
Hochschulschrift - Master
Navigation on a Mobile Robot. Master, Universität des Saarlandes, University of Edinburgh, Saarbrücken (2001)
Forschungspapier (1)
222.
Forschungspapier
A Remark on the Sign Variation Method for Real Root Isolation. (2001)
Bericht (18)
223.
Bericht
Fifth Biennial Report: June 1999 - August 2001 (Biennial Report / Max-Planck-Institut für Informatik, 5). Max-Planck-Institut für Informatik, Saarbrücken (2001), 278 S.
224.
Bericht
Experiments with iterative improvement algorithms on completely unimodel hypercubes. Max-Planck-Institut für Informatik, Saarbrücken (2001), 25 S.
225.
Bericht
Linear one-sided stability of MAT for weakly injective domain. Max-Planck-Institut für Informatik, Saarbrücken (2001), 18 S.
226.
Bericht
A Randomized On-line Algorithm for the k-Server Problem on a Line. DIMACS-Center for Discrete Mathematics & Theoretical Computer Science, Piscataway, NJ (2001)
227.
Bericht
Efficient light transport using precomputed visibility. Max-Planck-Institut für Informatik, Saarbrücken (2001), 32 S.
228.
Bericht
Proceeding of the Second International Workshop of the Implementation of Logics. Max-Planck-Institut für Informatik, Saarbrücken (2001), 102 S.
229.
Bericht
An adaptable and extensible geometry kernel. Max-Planck-Institut für Informatik, Saarbrücken (2001), 27 S.
230.
Bericht
Approximating minimum size 1,2-connected networks. Max-Planck-Institut für Informatik, Saarbrücken (2001), 22 S.
231.
Bericht
A framework for the acquisition, processing and interactive display of high quality 3D models. Max-Planck-Institut für Informatik, Saarbrücken (2001), 39 S.
232.
Bericht
Image-based reconstruction of spatially varying materials. Max-Planck-Institut für Informatik, Saarbrücken (2001), 20 S.
233.
Bericht
A framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web. Max-Planck-Institut für Informatik, Saarbrücken (2001), 20 S.
234.
Bericht
Directed single-source shortest-paths in linear average-case time. Max-Planck-Institut für Informatik, Saarbrücken (2001), 32 S.
235.
Bericht
Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches. Max-Planck-Institut für Informatik, Saarbrücken (2001), 24 S.
236.
Bericht
Partitioning techniques for the Steiner problem. Max-Planck-Institut für Informatik, Saarbrücken (2001), 21 S.
237.
Bericht
On Steiner trees and minimum spanning trees in hypergraphs. Max-Planck-Institut für Informatik, Saarbrücken (2001), 15 S.
238.
Bericht
Implementation of planar Nef polyhedra. Max-Planck-Institut für Informatik, Saarbrücken (2001), 345 S.
239.
Bericht
Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators. Max-Planck-Institut für Informatik, Saarbrücken (2001), 41 S.
240.
Bericht
Superposition and chaining for totally ordered divisible abelian groups. Max-Planck-Institut für Informatik, Saarbrücken (2001), 40 S.