Basin, D. A.; Matthews, S.; Viganò, L.: A New Method for Bounding the Complexity of Modal Logics. In: Computational Logic and Proof Theory, S. 89 - 102 (Hg. Gottlob, G.; Leitsch, A.; Mundici, D.). 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory, Vienna, Austria, 25. August 1997 - 29. August 1997. Springer, Berlin, Germany (1997)

Basin, D. A.; Matthews, S.; Viganò, L.: Labelled quantified modal logics. In: Proceedings of the 21st Annual German Conference on Artificial Intelligence (KI-97): Advances in Artificial Intelligence, S. 171 - 182 (Hg. Brewka, G.; Habel, C.; Nebel, B.). Untitled Event, Freiburg, Germany, 1997. Springer, Berlin, Germany (1997)

Brandenburg, F. J.; Jünger, M.; Mutzel, P.; Lengauer, T.: SPP 731: Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen". In: Informatik '97 Informatik als Innovationsmotor, S. 58 - 67 (Hg. Jarke, M.; Pasedach, K.; Pohl, K.). 27. Jahrestagung der Gesellschaft für Informatik, Aachen, Germany, 24. September 1997 - 26. September 1997. Springer, Berlin (1997)

Brodal, G. S.: Predecessor Queries in Dynamic Integer Sets. In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), S. 21 - 32 (Hg. Reischuk, R.; Morvan, M.). Untitled Event, Lubeck, Germany, 1997. Springer, Berlin, Germany (1997)

Brodal, G. S.; Träff, J. L.; Zaroliagis, C.: A parallel priority data structure with applications. In: 11th Internatinal Parallel Processing Symposium (IPPS-97), S. 689 - 693 (Hg. Feitelson, D. G.; Rudolph, L.). Untitled Event, Geneva, Switzerland, 01. April 1997 - 05. April 1997. IEEE, Los Alamitos, USA (1997)

Charatonik, W.; Podelski, A.: Set Constraints with Intersection. In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), S. 362 - 372 (Hg. Winskel, G.). Untitled Event, Warsaw, Poland, 08. Juli 2003 - 12. Juli 2003. IEEE, New York, USA (1997)

Chlebus, B. S.; Czumaj, A.; Sibeyn, J. F.: Routing on the PADAM: Degrees of Optimality. In: Euro-Par'97 Parallel Processing, S. 272 - 279 (Hg. Lengauer, C.; Griebl, M.; Gorlatch, S.). 3rd International Euro-Par Conference on Parallel Processing, Passau, Germany, 26. August 1997 - 29. August 1997. Springer, Berlin (1997)

Christof, T.; Jünger, M.; Kececioglu, J.; Mutzel, P.; Reinelt, G.: A Branch-and-Cut Approach to Physical Mapping with End-probes. In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology, S. 84 - 92. 1st Annual International Conference on Computational Molecular Biology, Santa Fe, NM, USA, 20. Januar 1997 - 23. Januar 1997. ACM, New York, NY (1997)

Cooper, C.; Frieze, A. M.; Mehlhorn, K.; Priebe, V.: Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. In: Randomization and Approximation Techniques in Computer Science, S. 15 - 26 (Hg. Rolim, J.). International Workshop on Randomization and Approximation Techniques in Computer Science, Bologna, Italy, 11. Juli 1997 - 12. Juli 1997. Springer, Berlin, Germany (1997)

Crauser, A.; Mehlhorn, K.; Meyer, U.: Kürzeste-Wege-Berechnung bei sehr großen Datenmengen. In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", S. 113 - 132 (Hg. Spaniol, O.). Inovationsmotor "Graduiertenkolleg": Workshop im Rahmen der GI-Jahrestagung 1997, Aachen, Germany. Verlag Günter Mainz, Aachen, Germany (1997)

Czumaj, A.; Ferragina, P.; Gasieniec, L.; Muthukrishnan, S.; Träff, J. L.: The Architecture of a Software Library for String Processing. In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), S. 166 - 176 (Hg. Italiano, G.; Orlando, S.). Untitled Event, Venice, Italy. Università Ca' Foscari di Venezia, Venice, Italy (1997)

Das, G.; Fleischer, R.; Gasieniec, L.; Gunopulos, D.; Kärkkäinen, J.: Episode Matching. In: Combinatorial Pattern Matching, S. 12 - 27 (Hg. Apostolico, A.; Hein, J.). 8th Annual Symposium on Combinatorial Pattern Matching , Aarhus, Denmark, 30. Juni 1997 - 02. Juli 1997. Springer, Berlin, Germany (1997)

Douglis, F.; Feldmann, A.; Krishnamurthy, B.; Mogul, J. C.: Rate of Change and other Metrics: a Live Study of the World Wide Web. In: Proceedings of the USENIX Symposium on Internet Technologies and Systems. 1st USENIX Symposium on Internet Technologies and Systems, Monterey, CA, USA, 08. Dezember 1997 - 11. Dezember 1997. USENIX, Berkeley, CA (1997)

Duncan, C.A.; Goodrich, M. T.; Ramos, E. A.: Efficient approximation and optimization algorithms for computational metrology. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), S. 121 - 130. Untitled Event, New Orleans, USA, 05. Januar 1997 - 07. Januar 1997. ACM Press / SIAM, New York, USA (1997)

Feldmann, A.; Whitt, W.: Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network Performance Models. In: Proceedings IEEE INFOCOM'97, S. 1096 - 1104. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Kobe, Japan, 07. April 1997 - 12. April 1997. IEEE, Piscataway, NJ (1997)

Finkler, U.; Mehlhorn, K.: Runtime Prediction of Real Programs on Real Machines. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, S. 380 - 389. Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, 05. Januar 1997 - 07. Januar 1997. ACM / SIAM, New York, USA (1997)

Ganzinger, H.; Meyer, C.; Weidenbach, C.: Soft Typing for Ordered Resolution. In: Automated Deduction - CADE-14, S. 321 - 335 (Hg. McCune, W.). 14th International Conference on Automated Deduction, Townsville, Australia, 13. Juli 1997 - 17. Juli 1997. Springer, Berlin, Germany (1997)

Gasieniec, L.; Indyk, P.: Efficient Parallel Computing with Memory Faults. In: Fundamentals of Computation Theory, S. 188 - 197 (Hg. Chlebus, B. S.; Czaja, L.). 11th International Symposium on Fundamentals of Computation Theory, Krakcw, Poland, 01. September 1997 - 03. September 1997. Springer, Berlin, Germany (1997)

Gasieniec, L.; Indyk, P.; Krysta, P.: External Inverse Pattern Matching. In: Combinatorial Pattern Matching, S. 90 - 101 (Hg. Apostolico, A.; Hein, J.). 8th Annual Symposium on Combinatorial Pattern Matching , Aarhus, Denmark, 30. Juni 1997 - 02. Juli 1997. Springer, Berlin, Germany (1997)

Gasieniec, L.; Jansson, J.; Lingas, A.; Östlin, A.: On the Complexity of Computing Evolutionary Trees. In: Computing and Combinatorics, S. 134 - 145 (Hg. Jiang, T.; Lee, D. T.). 3rd Annual International Conference on Computing and Combinatorics, Shanghai, China, 20. August 1997 - 22. August 1997. Springer, Berlin (1997)