Sibeyn, J. F.: List Ranking on Interconnection Networks. In: Euro-Par '96, Parallel Processing, S. 529 - 541 (Hg. Bougé, L.; Fraigniaud, P.; Mignotte, A.; Robert, Y.). Second International Euro-Par Conference, Lyon, France, 26. August 1996 - 29. August 1996. Springer, Berlin (1996)

Sibeyn, J.: Routing on Triangles, Tori and Honeycombs. In: Mathematical Foundations of Computer Science 1996, S. 529 - 541 (Hg. Penczek, W.; Szalas, A.). 21st International Symposium on Mathematical Foundations of Computer Science, Cracow, Poland, 02. September 1996 - 06. September 1996. Springer, Berlin (1996)

Slusallek, P.; Seidel, H.-P.: Towards an Open Rendering Kernel for Image Synthesis. In: Rendering Techniques ’96, S. 51 - 60 (Hg. Pueyo, X.; Schröder, P.). Eurographics Workshop on Rendering Techniques, Porto, Portugal, 17. Juni 1996 - 19. Juni 1996. Springer, Berlin (1996)

Srinivasan, A.: An Extension of the Lovász Local Lemma, and its Applications to Integer Programming. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, S. 6 - 15. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Georgia, USA, 28. Januar 1996 - 30. Januar 1996. SIAM, Philadelphia, PA (1996)

Stuber, J.: Superposition Theorem Proving for Abelian Groups Represented as Integer Modules. In: Rewriting Techniques and Applications, S. 33 - 47 (Hg. Ganzinger, H.). 7th International Conference on Rewriting Techniques and Applications, New Brunswick, NJ, USA, 27. Juli 1996 - 30. Juli 1996. Springer, Berlin, Germany (1996)

Träff, J. L.; Zaroliagis, C.: A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs. In: Parallel Algorithms for Irregularly Structured Problems, S. 183 - 194 (Hg. Ferreira, A.; Rolim, J.; Saad, Y.; Yang, T.). 3rd International Workshop on Parallel Algorithms for Irregularly Structured Problems, Santa Barbara, CA, USA, 19. August 1996 - 21. August 1996. Springer, Berlin (1996)

Vorobyov, S.: An improved lower bound for the elementary theories of trees. In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), S. 275 - 287 (Hg. McRobbie, M. A.; Slaney, J. K.). Untitled Event, New Brunswick, USA, 1996. Springer, Berlin, Germany (1996)

Vorobyov, S.: On the Bounded Theories of Finite Trees. In: Concurrency and Parallelism, Programming, Networking, and Security, S. 152 - 161 (Hg. Jaffar, J.; Yap, R. H. C.). Second Asian Computing Science Conference, Singapore, 02. Dezember 1996 - 05. Dezember 1996. Springer, Berlin, Germany (1996)

Weidenbach, C.: Sorted Unification and Its Application to Automated Theorem Proving. In: Proceedings of the CADE-13 Workshop: Term Schematizations and Their Applications, S. 67 - 76 (Hg. Hermann, M.; Salzer, G.). Untitled Event, New Brunswick, USA, 1996. Self (1996)

Weidenbach, C.: Unification in Pseudo-Linear Sort Theories is Decidable. In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), S. 343 - 357 (Hg. McRobbie, M. A.; Slaney, J. K.). 13th International Conference on Automated Deduction, New Brunswick, USA, 30. Juli 1996 - 03. August 1996. Springer, Berlin, Germany (1996)

Weidenbach, C.: Unification in Sort Theories. In: Proceedings of the 10th International Workshop on Unification, UNIF'96, S. 16 - 25 (Hg. Schulz, K. U.; Kepser, S.). Untitled Event, Harsching, Germany, 1996. Universität München, München, Germany (1996)

Weidenbach, C.; Gaede, B.; Rock, G.: SPASS & FLOTTER, Version 0.42. In: Automated Deduction - CADE-13, S. 141 - 145 (Hg. McRobbie, M. A.; Slaney, J. K.). 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, 30. Juli 1996 - 03. August 1996. Springer, Berlin, Germany (1996)

Weydert, E.: Default Quantifier Logic. In: Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems (Hg. Niemelä, I.). Untitled Event, Budapest, Hungary, 1996. Universität Koblenz-Landau, Institut für Informatik, Koblenz-Landau, Germany (1996)

Weydert, E.: System J - Revision Entailment: Default Reasoning through Ranking Measure Updates. In: Practical Reasoning, S. 637 - 649 (Hg. Gabbay, D.; Ohlbach, H. J.). International Conference on Formal and Applied Practical Reasoning, Bonn, Germany, 03. Juni 1996 - 07. Juni 1996. Springer, Berlin, Germany (1996)

Albers, S.: Improved randomized on-line algorithms for the list update problem. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), S. 412 - 419. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, USA, 1995. ACM, New York, NY (1995)

Albers, S.; Koga, H.: Page migration with limited local memory capacity. In: Algorithms and Data Structures: 4th International Workshop (WADS95), S. 412 - 158 (Hg. Akl, S. G.; Dehne, F.; Sack, J.-R.; Santoro, N.). Untitled Event, Kingston, Canada. Springer, Berlin (1995)

Anderson, P.; Basin, D.: Deriving and Applying Logic Program Transformers. In: Algorithms, Concurrency and Knowledge (1995 Asian Computing Science Conference), S. 301 - 318. 1995 Asian Computing Science Conference, Pathumthani, Thailand, 11. Dezember 1995 - 13. Dezember 1995. Springer, Berlin (1995)

Andersson, A.; Hagerup, T.; Nilsson, S.; Raman, R.: Sorting in Linear Time? In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, S. 427 - 436. 27th Annual ACM Symposium on Theory of Computing, Las Vegas, Nevada, USA, 29. Mai 1995 - 01. Juni 1995. ACM, New York, NY (1995)

Arikati, S. R.; Chaudhuri, S.; Zaroliagis, C.: All-Pairs Min-Cut in Sparse Networks. In: Foundations of software technology and theoretical computer science (FSTTCS-95): 15th conference, S. 363 - 376 (Hg. Thiagarajan, P. S.). Untitled Event, Bangalore, India, 18. Dezember 1995 - 20. Dezember 1995. Springer, Berlin, Germany (1995)

Arya, S.; Das, G.; Mount, D. M.; Salowe, J. S.; Smid, M.: Euclidean Spanners: Short, Thin, and Lanky. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC95), S. 489 - 498. 27th Annual ACM Symposium on Theory of Computing, Las Vegas, Nevada, USA, 29. Mai 1995 - 01. Juni 1995. ACM, New York, NY (1995)