Hagerup, T.; Raman, R.: Waste Makes Haste: Tight Bounds for Loose Parallel Sorting. In: Proceedings of the 33th Annual IEEE Symposium on Foundations of Computer Science, S. 628 - 637. 33th Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, USA, 24. Oktober 1992 - 27. Oktober 1992. IEEE, New York, NY, USA (1992)

Hanus, M.: Improving Control of Logic Programs by Using Functional Logic Languages. In: Proceedings 4th International Symposium on Programming Language Implementation and Logic Programming, S. 1 - 23 (Hg. Bruynooghe, M.; Wirsing, M.). Untitled Event, Leuven, Belgium, 1992. Springer, Berlin, Germany (1992)

Hanus, M.: Incremental Rewriting in Narrowing Derivations. In: Proceedings of the 3rd International Conference on Algebraic and Logic Programming (ALP-92), S. 228 - 243 (Hg. Kirchner, H.; Levi, G.). Untitled Event, Volterra, Italy, 1992. Springer, Berlin, Germany (1992)

Hanus, M.: On the Completeness of Residuation. In: Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming, S. 192 - 206 (Hg. Apt, K.). Untitled Event, Washington, D.C., 1992. MIT Press, Cambridge, USA (1992)

Hustadt, U.: A Complete Transformation System for Polymorphic Higher-Order Unification. In: Proceedings of Sixth International Workshop on Unification, S. 61 - 65 (Hg. Baader, F.; Siekmann, J.; Snyder, W.). Sixth International Workshop on Unification, Wadern, Germany, 29. Juli 1992 - 31. Juli 1992. OpenBU, Boston, MA (1992)

Kaufmann, M.; Sibeyn, J. F.: Optimal Multi-packet Routing on the Torus. In: Algorithms Theory - SWAT' 92, S. 118 - 128 (Hg. Nurmi, O.). 3th Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, 08. Juli 1992 - 10. Juli 1992. Springer, Berlin, Germany (1992)

Lenhof, H.-P.; Smid, M.: Enumerating the k closest pairs optimally. In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), S. 380 - 386. Untitled Event, Pittsburgh, Pennsylvania, USA, 1992. IEEE, Los Alamitos (1992)

Lenhof, H.-P.; Smid, M.: Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity. In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, S. 388 - 398 (Hg. Nurmi, O.; Ukkonen, E.). Untitled Event, Helsinki, Finland, 08. Juli 1992 - 10. Juli 1992. Springer, Berlin, Germany (1992)

Madden, P.: Automated Program Transformation Through Proof Transformation. In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), S. 446 - 460 (Hg. Kapur, D.). Untitled Event, Saratoga Springs, NY, 1992. Springer, Heidelberg, Germany (1992)

Mehlhorn, K.: Recent Developments in Algorithms for the Maximum Flow Problem (Abstract). In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), S. 404 - 404. Untitled Event, New Delhi, India, 18. Dezember 1992. Springer, Berlin, Germany (1992)

Mehlhorn, K.; Näher, S.: Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. In: Information Processing '92, Volume 1, S. 493 - 508. 12th World Computer Congress on Algorithms, Software, Architecture, Madrid, Spain, 07. September 1992 - 11. September 1992. Elsevier, Amsterdam, The Netherlands (1992)

Mehlhorn, K.; Sharir, M.; Welzl, E.: Tail Estimates for the Space Complexity of Randomised Incremental Algorithms. In: Discrete algorithms (SODA-92): 3rd annual ACM-SIAM symposium, S. 89 - 93. Untitled Event, Orlando, FL, USA, 27. Januar 1992. SIAM, Philadelphia, USA (1992)

Schmidt, R. A.: Terminological Representation, Natural Language & Relation Algebra. In: GWAI-92: Advances in Artificial Inteligence, S. 357 - 371 (Hg. Ohlbach, H. J.). 16th German Conference on Artificial Intelligence, Bonn, Germany, 31. August 1992 - 03. September 1992. Springer, Berlin (1992)

Schwarz, C.; Smid, M.: An O(n log n log log n) Algorithm for the On-line Closes Pair Problem. In: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, S. 280 - 285. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, FL, USA, 27. Januar 1992. SIAM, Philadelphia, USA (1992)

Schwarz, C.; Smid, M.; Snoeyink, J.: An Optimal Algorithm for the On-line Closest-pair Problem. In: Proceedings of the 8th Annual Symposium on Computational Geometry, S. 330 - 336. 8th Annual Symposium on Computational Geometry, Berlin, Germany, 10. Juni 1992 - 12. Juni 1992. ACM, New York, NY (1992)

Socher‐Ambrosius, R.: A Goal Oriented Strategy Based on Completion. In: Algebraic and Logic Programming, S. 435 - 445 (Hg. Kirchner, H.; Levi, G.). Third International Conference on Algebraic and Logic Programming, Volterra, Italy, 02. September 1992 - 04. September 1992. Springer, Volterra, Italy (1992)

Theune, D.; Thiele, R.; Lengauer, T.; Feldmann, A.: HERO: Hierarchical EMC-constrained Routing. In: IEEE/ACM International Conference on Computer-Aided Design, S. 468 - 472 (Hg. Trevillyan, L.; Lightner, M. R.). IEEE/ACM International Conference on Computer-Aided Design, Santa Clara, CA, USA, 08. November 1992 - 12. November 1992. IEEE Computer Society, Los Alamitos, CA (1992)

Graf, P.: Unification Using Dynamic Sorts. Master, Universität des Saarlandes, Saarbrücken (1992)

Albers, S.: The influence of lookahead in competitive on-line algorithms. Max-Planck-Institut für Informatik, Saarbrücken (1992), 56 S.

Alt, H.; Guibas, L.; Mehlhorn, K.; Karp, R.; Widgerson, A.: A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Max-Planck-Institut für Informatik, Saarbrücken (1992), 5 S.