Chaudhuri, S.; Hagerup, T.; Raman, R.: Approximate and exact deterministic parallel selection. Max-Planck-Institut für Informatik, Saarbrücken (1993), 10 S.

Chaudhuri, S.; Radhakrishnan, J.: The complexity of parallel prefix problems on small domains. Max-Planck-Institut für Informatik, Saarbrücken (1993), 17 S.

Cvetković, D.: The logic of preference and decision supporting systems. Max-Planck-Institut für Informatik, Saarbrücken (1993), 71 S.

Dimopoulos, Y.; Magirou, V.; Papadimitriou, C.: On kernels, defaults and even graphs. Max-Planck-Institut für Informatik, Saarbrücken (1993), 11 S.

Dimopoulos, Y.; Torres, A.: Graph theoretical structures in logic programs and default theories. Max-Planck-Institut für Informatik, Saarbrücken (1993), 28 S.

Dobrindt, K.; Mehlhorn, K.; Yvinec, M.: A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. Max-Planck-Institut für Informatik, Saarbrücken (1993), 14 S.

Dubhashi, D. P.: Quantifier elimination in p-adic fields. Max-Planck-Institut für Informatik, Saarbrücken (1993), 21 S.

Dubhashi, D. P.; Mehlhorn, K.; Ranjan, D.; Thiel, C.: Searching, sorting and randomised algorithms for central elements and ideal counting in posets. Max-Planck-Institut für Informatik, Saarbrücken (1993), 8 S.

Gabbay, D. M.: Classical vs non-classical logics: the universality of classical logic. Max-Planck-Institut für Informatik, Saarbrücken (1993), 101 S.

Ganzinger, H.; Bachmair, L.; Waldmann, U.: Superposition with simplification as a decision procedure for the monadic class with equality. Max-Planck-Institut für Informatik, Saarbrücken (1993), 14 S.

Golin, M. J.; Raman, R.; Schwarz, C.; Smid, M.: Randomized Data Structures for the Dynamic Closest-Pair Problem. Max-Planck-Institut für Informatik, Saarbrücken (1993), 32 S.

Graf, P.; Kirsch, C. M.: Extended path-indexing. Max-Planck-Institut für Informatik, Saarbrücken (1993)

Grolmusz, V.: On multi-party communication complexity of random functions. Max-Planck-Institut für Informatik, Saarbrücken (1993), 10 S.

Grolmusz, V.: Harmonic analysis, real approximation, and the communication complexity of Boolean functions. Max-Planck-Institut für Informatik, Saarbrücken (1993), 15 S.

Grolmusz, V.: MOD m gates do not help on the ground floor. Max-Planck-Institut für Informatik, Saarbrücken (1993), 13 S.

Grolmusz, V.: Multi-party protocols and spectral norms. Max-Planck-Institut für Informatik, Saarbrücken (1993), 11 S.

Gupta, P.; Janardan, R.; Smid, M.: Efficient algorithms for generalized intersection searching on non-iso-oriented objects. Max-Planck-Institut für Informatik, Saarbrücken (1993), 32 S.

Gupta, P.; Janardan, R.; Smid, M.: On Intersection Searching Problems Involving Curved Objects. Max-Planck-Institut für Informatik, Saarbrücken (1993), 43 S.

Hagerup, T.: Optimal parallel string algorithms: sorting, merching and computing the minimum. Max-Planck-Institut für Informatik, Saarbrücken (1993), 25 S.

Hagerup, T.; Maas, M.: Generalized topological sorting in linear time. Max-Planck-Institut für Informatik, Saarbrücken (1993), 10 S.