Report (47)
241.
Report
Optimizing over all combinatorial embeddings of a planar graph. Max-Planck-Institut für Informatik, Saarbrücken (1998), 23 pp.
242.
Report
Strategies for conformance testing. Max-Planck-Institut für Informatik, Saarbrücken (1998), 24 pp.
243.
Report
On Wallace's method for the generation of normal variates. Max-Planck-Institut für Informatik, Saarbrücken (1998), 17 pp.
244.
Report
Robustness and precision issues in geometric computation. Max-Planck-Institut für Informatik, Saarbrücken (1998), 34 pp.
245.
Report
Parameterized implementations of classical planar convex hull algorithms and extreme point compuations. Max-Planck-Institut für Informatik, Saarbrücken (1998), 93 pp.
246.
Report
E-unification for subsystems of S4. Max-Planck-Institut für Informatik, Saarbrücken (1998), 30 pp.
247.
Report
Resolution-based Theorem Proving for SHn-Logics. Technische Universität Wien, Vienna, Austria (1998)
248.
Report
2-Approximation algorithm for finding a spanning tree with maximum number of leaves. Max-Planck-Institut für Informatik, Saarbrücken (1998), 16 pp.
249.
Report
Hybridizing concept languages. Max-Planck-Institut für Informatik, Saarbrücken (1998), 33 pp.
250.
Report
The relation between second-order unification and simultaneous rigid \sl E-unification. Max-Planck-Institut für Informatik, Saarbrücken (1998), 26 pp.
251.
Report
The undecidability of the first-order theories of one step rewriting in linear canonical systems. Max-Planck-Institut für Informatik, Saarbrücken (1998), 59 pp.
252.
Report
AE-Equational theory of context unification is Co-RE-Hard. Max-Planck-Institut für Informatik, Saarbrücken (1998), 20 pp.
253.
Report
The most nonelementary theory (a direct lower bound proof). Max-Planck-Institut für Informatik, Saarbrücken (1998), 36 pp.
254.
Report
Satisfiability of Functional+Record Subtype Constraints is NP-Hard. Max-Planck-Institut für Informatik, Saarbrücken (1998), 16 pp.
Other (1)
255.
Other
Some Notes on Nonmonotonic Probabilistic Inference, (1998)