Follert, F.; Schömer, E.; Sellen, J.; Smid, M.; Thiel, C.: Computing the Largest Empty Anchored Cylinder, and Related Problems. International Journal of Computational Geometry and Applications 7 (6), S. 563 - 580 (1997)

Gasieniec, L.; Pelc, A.: Broadcasting with a Bounded Fraction of Faulty Nodes. Journal of Parallel and Distributed Computing 42 (1), S. 11 - 20 (1997)

Goodrich, M. T.; Ramos, E. A.: Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming. Discrete and Computational Geometry 18 (-), S. 397 - 420 (1997)

Gupta, P.; Janardan, R.; Smid, M.; Dasgupta, B.: The Rectangle Enclosure and Point-dominance Problems Revisited. International Journal of Computational Geometry and Applications 7 (5), S. 437 - 456 (1997)

Hagerup, T.: Allocating Independent Tasks to Parallel Processors: An Experimental Study. Journal of Parallel and Distributed Computing 47 (2), S. 185 - 197 (1997)

Hagerup, T.; Kutylowski, M.: Fast Integer Merging on the EREW PRAM. Algorithmica 17 (1), S. 55 - 66 (1997)

Jung, B.; Lenhof, H.-P.; Müller, P.; Rüb, C.: Langevin dynamics simulations of macromolecules on parallel computers. Macromolecular Theory and Simulation 6 (-), S. 507 - 521 (1997)

Jünger, M.; Mutzel, P.: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. Journal of Graph Algorithms and Applications 1 (1), S. 1 - 25 (1997)

Kaufmann, M.; Meyer, U.; Sibeyn, J. F.: Matrix Transpose on Meshes: Theory and Practice. Computers and Artificial Intelligence 16 (2), S. 107 - 140 (1997)

Kaufmann, M.; Raman, R.; Sibeyn, J. F.: Routing on Meshes with Buses. Algorithmica 18 (3), S. 417 - 444 (1997)

Kaufmann, M.; Sibeyn, J. F.: Randomized Multipacket Routing and Sorting on Meshes. Algorithmica 17 (3), S. 224 - 244 (1997)

Kobbelt, L.; Stamminger, M.; Seidel, H.-P.: Using Subdivision on Hierarchical Data to Reconstruct Radiosity Distribution. Computer Graphics Forum 16 (3), S. C347 - C355 (1997)

Krishna Rao, M. R. K.: A framework for incremental learning of logic programs. Theoretical Computer Science 185, S. 191 - 213 (1997)

Mehlhorn, K.; Priebe, V.: On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka. Random Structures and Algorithms 10 (1-2), S. 205 - 220 (1997)

Mehlhorn, K.; Sundar, R.; Uhrig, C.: Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17, S. 183 - 198 (1997)

Nivat, M.; Podelski, A.: Minimal Ascending and Descending Tree Automata. SIAM Journal on Computing 26 (1), S. 39 - 58 (1997)

Ohlbach, H. J.; Schmidt, R. A.: Functional Translation and Second-Order Frame Properties of Modal Logics. Journal of Logic and Computation 7 (5), S. 581 - 603 (1997)

Papatriantafilou, M.; Tsigas, P.: Self-Stabilizing Wait-Free Clock Synchronization. Parallel Processing Letters 7 (3), S. 321 - 328 (1997)

Podelski, A.; Smolka, G.: Situated Simplification. Theoretical Computer Science 173 (1), S. 235 - 252 (1997)

Rahman, S.; Rückert, H.; Fischmann, M.: Dialogues and Ontology, the Dialogical Approach to Free Logic. Logique et Analyse 160, S. 357 - 374 (1997)