Report (51)

61.
Report
Barnett, R.; Basin, D. A.; Hesketh, J.: A recursion planning analysis of inductive completion. Max-Planck-Institut für Informatik, Saarbrücken (1992), 14 pp.
MPG.PuRe
Full
62.
Report
Barth, P.: CLP(PB) - A Meta-Interpreter in CLP(R). Max-Planck-Institut für Informatik, Saarbrücken (1992), 18 pp.
MPG.PuRe
Full
63.
Report
Basin, D.; Constable, R. L.: Metalogical frameworks. Max-Planck-Institut für Informatik, Saarbrücken (1992), 20 pp.
MPG.PuRe
Full
64.
Report
Basin, D.; Walsh, T.: Difference matching. Max-Planck-Institut für Informatik, Saarbrücken (1992), 12 pp.
MPG.PuRe
Full
65.
Report
Basin, D.; Wash, T.: Difference unification. Max-Planck-Institut für Informatik, Saarbrücken (1992), 15 pp.
MPG.PuRe
Full
66.
Report
Baumgarten, H.; Jung, H.; Mehlhorn, K.: Dynamic point location in general subdivisions. Max-Planck-Institut für Informatik, Saarbrücken (1992), 30 pp.
MPG.PuRe
Full
67.
Report
Brink, C.; Britz, K.; Schmidt, R. A.: Peirce algebras. Max-Planck-Institut für Informatik, Saarbrücken (1992), 22 pp.
MPG.PuRe
Full
68.
Report
Clarkson, K. L.; Mehlhorn, K.: Four results on randomized incremental constructions. Max-Planck-Institut für Informatik, Saarbrücken (1992), 21 pp.
MPG.PuRe
Full
69.
Report
Fleischer, R.: A new lower bound technique for decision trees. Max-Planck-Institut für Informatik, Saarbrücken (1992), 21 pp.
MPG.PuRe
publisher-version
70.
Report
Fleischer, R.: A simple balanced search tree with 0(1) worst-case update time. Max-Planck-Institut für Informatik, Saarbrücken (1992), 10 pp.
MPG.PuRe
Full
71.
Report
Gabbay, D. M.; Ohlbach, H. J.: Quantifier Elimination in Second-order Predicate Logic. Max-Planck-Institut für Informatik, Saarbrücken (1992), 18 pp.
MPG.PuRe
Full
72.
Report
Ganzinger, H.; Bachmair, L.; Waldmann, U.: Set constraints are the Monadic class. Max-Planck-Institut für Informatik, Saarbrücken (1992), 13 pp.
MPG.PuRe
Full
73.
Report
Golin, M. J.; Raman, R.; Schwarz, C.; Smid, M.: Simple randomized algorithms for closest pair problems. Max-Planck-Institut für Informatik, Saarbrücken (1992), 14 pp.
MPG.PuRe
Full
74.
Report
Graf, P.: Path indexing for term retrieval. Max-Planck-Institut für Informatik, Saarbrücken (1992), 12 pp.
MPG.PuRe
Full
75.
Report
Grolmusz, V.: Separating the communication complexities of MOD m and MOD p circuits. Max-Planck-Institut für Informatik, Saarbrücken (1992), 16 pp.
MPG.PuRe
Full
76.
Report
Grolmusz, V.: Circuits and multi-party protocols. Max-Planck-Institut für Informatik, Saarbrücken (1992), 16 pp.
MPG.PuRe
Full
77.
Report
Hagerup, T.: Fast deterministic processor allocation. Max-Planck-Institut für Informatik, Saarbrücken (1992), 11 pp.
MPG.PuRe
Full
78.
Report
Hagerup, T.; Kutylowski, M.: Fast integer merging on the EREW PRAM. Max-Planck-Institut für Informatik, Saarbrücken (1992), 12 pp.
MPG.PuRe
Full
79.
Report
Hagerup, T.; Raman, R.: Waste makes haste: tight bounds for loose parallel sorting. Max-Planck-Institut für Informatik, Saarbrücken (1992), 185 pp.
MPG.PuRe
Full
80.
Report
Hanus, M.: Analysis of nonlinear constraints in CLP(R). Max-Planck-Institut für Informatik, Saarbrücken (1992), 31 pp.
MPG.PuRe
Full
Web-View
Print Page
Open in new window
Estimated DIN-A4 page-width
Go to Editor View