Report (717)
11801.
Report
A complete transformation system for polymorphic higher-order unification. Max-Planck-Institut für Informatik, Saarbrücken (1991), 22 pp.
11802.
Report
An optimal construction method for generalized convex layers. Max-Planck-Institut für Informatik, Saarbrücken (1991), 25 pp.
11803.
Report
Tail estimates for the space complexity of randomized incremantal algorithms. Max-Planck-Institut für Informatik, Saarbrücken (1991), 8 pp.
11804.
Report
Natural semantics and some of its meta-theory in Elf. Max-Planck-Institut für Informatik, Saarbrücken (1991), 26 pp.
11805.
Report
Optimal embedding of a toroidal mesh in a path. Max-Planck-Institut für Informatik, Saarbrücken (1991), 6 pp.
11806.
Report
Algebraic terminological representation. Max-Planck-Institut für Informatik, Saarbrücken (1991), 113 pp.
11807.
Report
An optimal algorithm for the on-line closest-pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 11 pp.
11808.
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.
11809.
Report
Maintaining the minimal distance of a point set in polylogarithmic time (revised version). Max-Planck-Institut für Informatik, Saarbrücken (1991), 17 pp.
11810.
Report
Range trees with slack parameter. Max-Planck-Institut für Informatik, Saarbrücken (1991), 11 pp.
11811.
Report
Dynamic rectangular point location, with an application to the closest pair problem. Max-Planck-Institut für Informatik, Saarbrücken (1991), 28 pp.
11812.
Report
Edge separators for graphs of bounded genus with applications. Max-Planck-Institut für Informatik, Saarbrücken (1991), 10 pp.
11813.
Report
On crossing numbers of hypercubes and cube connected cycles. Max-Planck-Institut für Informatik, Saarbrücken (1991), 6 pp.
11814.
Report
A sorted logic using dynamic sorts. Max-Planck-Institut für Informatik, Saarbrücken (1991), 71 pp.
11815.
Report
Hidden line elimination for isooriented rectangles. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1990)
11816.
Report
89). Institut für Ökonometrie und Operations Research, Bonn (1989)
Routing Problems in Grid Graphs (Report, 11817.
Report
89/05). Teubner, Bonn, Germany (1989)
Routing Problems in Grid Graphs (SFB Report, 11818.
Report
On the Construction of Abstract Voronoi Diagrams, II. Universtität des Saarlandes / Fachbereich Informatik, Saarbrücken (1989)
11819.
Report
On the construction of abstract Voronoi diagrams. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1989)
11820.
Report
Data structures. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken (1989)