Sibeyn, J. F.; Grammatikakis, M.D.; Hsu, D.F.; Kraetzl, M.: Packet Routing in Fixed-Connection Networks: A Survey. Journal of Parallel and Distributed Computing 54, pp. 77 - 132 (1998)

Sibeyn, J. F.; Juurlink, B.; Rao, P. S.: Gossiping on Meshes and Tori. IEEE Transactions on Parallel and Distributed Systems 9 (6), pp. 513 - 525 (1998)

Slusallek, P.; Stamminger, M.; Heidrich, W.; Popp, J.-C.; Seidel, H.-P.: Composite Lighting Simulations with Lighting Networks. IEEE Computer Graphics and Applications 18 (2), pp. 22 - 31 (1998)

Sridharan, K.; Subramanian, C. R.; Sudha, N.: Some Properties of Touching Distances for Polygons and Polyhedra. Applied Mathematics Letters 11 (5), pp. 1 - 7 (1998)

Stamminger, M.; Schirmacher, H.; Slusallek, P.; Seidel, H.-P.: Getting Rid of Links in Hierarchical Radiosity. Computer Graphics Forum 17 (3), pp. 165 - 174 (1998)

Stuber, J.: Superposition theorem proving for abelian groups represented as integer modules. Theoretical Computer Science 208 (1/2), pp. 149 - 177 (1998)

Subramanian, C. R.; Fürer, M.; Veni Madhavan, C. E.: Algorithms for Coloring Semi-random Graphs. Random Structures & Algorithms 13 (2), pp. 125 - 158 (1998)

Waldmann, U.: Extending reduction orderings to ACU-compatible reduction orderings. Information Processing Letters 67 (1), pp. 43 - 49 (1998)

Weidenbach, C.; Meyer, C.; Cohrs, C.; Engel, T.; Keen, E.: SPASS V0.77. Journal of Automated Reasoning 21 (1), p. 113 - 113 (1998)

Werner, A.; Bockmayr, A.; Krischer, S.: How to realize LSE narrowing. New Generation Computing 16 (4), pp. 397 - 434 (1998)

Wu, J.; Liu, Z.: Well-Behaved Inference Rules for First-Order Theorem Proving. Journal of Automated Reasoning 21 (3), pp. 381 - 400 (1998)

Wu, J.; Tan, H.; Li, Y.: An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics. Journal of Applied Non-Classical Logics 8 (4), pp. 353 - 360 (1998)

Albers, S.; Westbrook, J.: Self-organizing data structures. In: Online Algorithms: The State of the Art, pp. 13 - 51 (Eds. Fiat, A.; Woeginger, G. J.). Springer, Berlin, Germany (1998)

Bachmair, L.; Ganzinger, H.: Equational Reasoning in Saturation-Based Theorem Proving. In: Automated Deduction: A Basis for Applications, Vol. I, pp. 353 - 397 (Eds. Bibel, W.; Schmitt, P. H.). Kluwer, Dordrecht, The Netherlands (1998)

Eades, P.; Mutzel, P.: Graph Drawing Algorithms. In: Algorithms and Theory of Computation Handbook, pp. 9 - 26 (Ed. Atallah, M. J.). CRC Press, New York, USA (1998)

Mehlhorn, K.: Amortisierte Analyse. In: Prinzipien des Algorithmenentwurfs, pp. 91 - 102 (Ed. Ottmann, T.). Spektrum, Heidelberg, Germany (1998)

Schmidt, R. A.: Resolution is a Decision Procedure for Many Propositional Modal Logics. In: Advances in Modal Logic, Volume 1, pp. 189 - 208 (Eds. Kracht, M.; de Rijke, M.; Wansing, H.; Zakharyaschev, M.). CSLI, Stanford, USA (1998)

Stuber, J.: Superposition theorem proving for commutative rings. In: Automated Deduction - A Basis for Applications. Volume III. Applications, pp. 31 - 55 (Eds. Bibel, W.; Schmitt, P. H.). Kluwer, Dordrecht, The Netherlands (1998)

Weidenbach, C.: Rechnen in sortierter Prädikatenlogik. In: Ausgezeichnete Informatikdissertationen 1997, pp. 183 - 197 (Eds. Fiedler, H.; Gorny, P.; Grass, W.; Hölldobler, S.; Hotz, G. et al.). Teubner, Stuttgart, Germany (1998)

Weidenbach, C.: Sorted Unification and Tree Automata. In: Automated Deduction - A Basis for Applications, pp. 291 - 320 (Eds. Bibel, W.; Schmitt, P. H.). Kluwer, Dordrecht, The Netherlands (1998)