Report (716)
11701.
Report
Rewrite-based equational theorem proving with selection and simplification. Max-Planck-Institut für Informatik, Saarbrücken (1991), 24 pp.
11702.
Report
Logic programming with pseudo-Boolean constraints. Max-Planck-Institut für Informatik, Saarbrücken (1991), 20 pp.
11703.
Report
An o(n³)-time maximum-flow algorithm. Max-Planck-Institut für Informatik, Saarbrücken (1991), 30 pp.
11704.
Report
A lower bound for the nondeterministic space complexity of contextfree recognition. Max-Planck-Institut für Informatik, Saarbrücken (1991), 4 pp.
11705.
Report
Algorithms for dense graphs and networks. Max-Planck-Institut für Informatik, Saarbrücken (1991), 29 pp.
11706.
Report
Deduction systems based on resolution. Max-Planck-Institut für Informatik, Saarbrücken (1991), 68 pp.
11707.
Report
A tight lower bound for the worst case of bottom-up-heapsort. Max-Planck-Institut für Informatik, Saarbrücken (1991), 13 pp.
11708.
Report
Simultaneous inner and outer aproximation of shapes. Max-Planck-Institut für Informatik, Saarbrücken (1991), 24 pp.
11709.
Report
On a compaction theorem of ragde. Max-Planck-Institut für Informatik, Saarbrücken (1991), 6 pp.
11710.
Report
Fast parallel space allocation, estimation an integer sorting. Max-Planck-Institut für Informatik, Saarbrücken (1991), 28 pp.
11711.
Report
Approximate decision algorithms for point set congruence. Max-Planck-Institut für Informatik, Saarbrücken (1991), 25 pp.
11712.
Report
On embeddings in cycles. Max-Planck-Institut für Informatik, Saarbrücken (1991), 22 pp.
11713.
Report
A complete transformation system for polymorphic higher-order unification. Max-Planck-Institut für Informatik, Saarbrücken (1991), 22 pp.
11714.
Report
An optimal construction method for generalized convex layers. Max-Planck-Institut für Informatik, Saarbrücken (1991), 25 pp.
11715.
Report
Tail estimates for the space complexity of randomized incremantal algorithms. Max-Planck-Institut für Informatik, Saarbrücken (1991), 8 pp.
11716.
Report
Natural semantics and some of its meta-theory in Elf. Max-Planck-Institut für Informatik, Saarbrücken (1991), 26 pp.
11717.
Report
Optimal embedding of a toroidal mesh in a path. Max-Planck-Institut für Informatik, Saarbrücken (1991), 6 pp.
11718.
Report
Algebraic terminological representation. Max-Planck-Institut für Informatik, Saarbrücken (1991), 113 pp.
11719.
Report
An optimal algorithm for the on-line closest-pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 11 pp.
11720.
Report
An O(n log n log log n) algorithm for the on-line closes pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 21 pp.