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