| 1997 | A Category of Transition Systems and Its Relations with Orthomodular Posets. Luca Bernardinello, Lucia Pomello |
| 1997 | A Characterization of Abstract Families of Algebraic Power Series. Georg Karner, Werner Kuich |
| 1997 | A Hierarchy for (1, +k)-Branching Programs with Respect of k. Petr Savický, Stanislav Zák |
| 1997 | A Shift-Invariant Metric on S Gianpiero Cattaneo, Enrico Formenti, Luciano Margara, Jacques Mazoyer |
| 1997 | A Tile-Based Coordination View of Asynchronous pi-Calculus. Gian-Luigi Ferrari, Ugo Montanari |
| 1997 | A Topological Generalization of Propositional Linear Time Temporal Logic. Bernhard Heinemann |
| 1997 | Accepting Zeno Words Without Making Time Stand Still. Béatrice Bérard, Claudine Picaronny |
| 1997 | Communication Complexity and Sequential Compuation. Juraj Hromkovic, Georg Schnitger |
| 1997 | Communication Complexity. László Babai |
| 1997 | Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. Beate Bollig, Ingo Wegener |
| 1997 | Complexity of Finding Short Resolution Proofs. Kazuo Iwama |
| 1997 | Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. Maciej Liskiewicz, Rüdiger Reischuk |
| 1997 | Counting Problems over the Reals. Klaus Meer |
| 1997 | Deciding Verbose Languages with Linear Advice. Arfst Nickelsen |
| 1997 | Decomposition of TrPTL Formulas. Raphaël Meyer, Antoine Petit |
| 1997 | Dependency-Based Action Refinement. Arend Rensink, Heike Wehrheim |
| 1997 | Distances Between Languages and Reflexivity of Relations. Christian Choffrut, Giovanni Pighizzini |
| 1997 | Game Semantics for Programming Languages (Abstract). Samson Abramsky |
| 1997 | Homomorphic Images os Sentential Forms and Terminating Grammars (Extended Abstract). Holger Petersen |
| 1997 | Integrating the Specification Techniques of Graph Transformation and Temporal Logic. Reiko Heckel, Hartmut Ehrig, Uwe Wolter, Andrea Corradini |
| 1997 | Invertible Linear Cellular Automata over z Giovanni Manzini, Luciano Margara |
| 1997 | Learning to Perform Knowledge-Intensive Inferences. Dan Roth |
| 1997 | Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial Calculus. Jan Krajícek |
| 1997 | Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings Igor Prívara, Peter Ruzicka |
| 1997 | Minimal Letter Frequency in n-th Power-Free Binary Words. Roman M. Kolpakov, Gregory Kucherov |
| 1997 | Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations. Markus Holzer |
| 1997 | NP-Hard Sets Have Many Hard Instances. Martin Mundhenk |
| 1997 | On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener |
| 1997 | On the Dilation of Interval Routing. Cyril Gavoille |
| 1997 | On the Generation of Trees by Hyperedge Replacement. Frank Drewes |
| 1997 | On the Influence of the State Encoding on OBDD-Representations of Finite State Machines. Christoph Meinel, Thorsten Theobald |
| 1997 | Optimal Algorithms for Complete Linkage Clustering in d Dimensions. Drago Krznaric, Christos Levcopoulos |
| 1997 | Partial Characterization of Synchronization Languages. Isabelle Ryl, Yves Roos, Mireille Clerbout |
| 1997 | Partial Order Semantics and Read Arcs. Walter Vogler |
| 1997 | Positive Applications of Lattices to Cryptography. Cynthia Dwork |
| 1997 | Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines (Extended Abstract). Jerzy Tyszkiewicz |
| 1997 | Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States. Ivan Korec |
| 1997 | Regulations by Valences. Henning Fernau, Ralf Stiebe |
| 1997 | Relating Conflict-Free Stable Transition and Event Models (Extended Abstract). Zurab Khasidashvili, John R. W. Glauert |
| 1997 | Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. Yuji Kobayashi, Friedrich Otto |
| 1997 | Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. Uwe Schöning |
| 1997 | Routing with Finite Speeds of Memory and Network. Jop F. Sibeyn |
| 1997 | Simplification Orders for Term Graph Rewriting. Detlef Plump |
| 1997 | Simulation as a Correct Transformation of Rewrite Systems. Wan J. Fokkink, Jaco van de Pol |
| 1997 | Specifying Computations Using Hyper Transition Systems. Marcello M. Bonsangue, Joost N. Kok |
| 1997 | Subtyping Calculus of Construction (Extended Abstract). Gang Chen |
| 1997 | The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. Martin Mundhenk, Judy Goldsmith, Eric Allender |
| 1997 | The Expressiveness of Datalog Circuits (DAC). Foto N. Afrati, Irène Guessarian, Michel de Rougemont |
| 1997 | The Giant Component Threshold for Random Regular Graphs with Edge Faults. Andreas Goerdt |
| 1997 | Treewidth: Algorithmic Techniques and Results. Hans L. Bodlaender |
| 1997 | Two-Level Contextual Grammars: The Internal Case. Carlos Martín-Vide, Joan Miquel-Verges, Gheorghe Paun |
| 1997 | When are Two Rewrite Systems More than None? Nachum Dershowitz |