| 1997 | A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract). Tamar Eilam, Michele Flammini, Shmuel Zaks |
| 1997 | A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Z Giovanni Manzini, Luciano Margara |
| 1997 | A Completion Algorithm for Codes with Bounded Synchronization Delay. Véronique Bruyère |
| 1997 | A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties. Toshihiro Fujito |
| 1997 | A Proof Theoretical Approach to Communication. Yuxi Fu |
| 1997 | A Semantically Sound Actor Tranlsation. Ian A. Mason, Carolyn L. Talcott |
| 1997 | An Abstract Data Type for Real Numbers. Pietro Di Gianantonio |
| 1997 | An Algebra-Based Method to Associate Rewards with EMPA Terms. Marco Bernardo |
| 1997 | An Improved Master Theorem for Divide-and-Conquer Recurrences. Salvador Roura |
| 1997 | Approximation Results for the Optimum Cost Partition Problem. Klaus Jansen |
| 1997 | Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela |
| 1997 | Axiomatizations for the Perpetual Loop in Process Algebra. Wan J. Fokkink |
| 1997 | Basic Observables for Processes. Michele Boreale, Rocco De Nicola, Rosario Pugliese |
| 1997 | Bisimulation Equivalence is Decidable for One-Counter Processes. Petr Jancar |
| 1997 | Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. Erik P. de Vink, Jan J. M. M. Rutten |
| 1997 | Checking Properties of Polynomials (Extended Abstract). Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar |
| 1997 | Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. Luisa Gargano, Pavol Hell, Stephane Perennes |
| 1997 | Computability on the Probability Measures on the Borel Sets of the Unit Interval. Klaus Weihrauch |
| 1997 | Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version). David Harel, Eli Singerman |
| 1997 | Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen |
| 1997 | Constructing Big Trees from Short Sequences. Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow |
| 1997 | Constructive Linear Time Algorithms for Branchwidth. Hans L. Bodlaender, Dimitrios M. Thilikos |
| 1997 | DNA²DNA Computations: A Potential "Killer App"? Laura F. Landweber, Richard J. Lipton |
| 1997 | Discrete-Time Control for Rectangular Hybrid Automata. Thomas A. Henzinger, Peter W. Kopke |
| 1997 | Distributed Processes and Location Failures (Extended Abstract). James Riely, Matthew Hennessy |
| 1997 | Dynamic Algorithms for Graphs of Bounded Treewidth. Torben Hagerup |
| 1997 | Efficiency of Asynchronous Systems and Read Arcs in Petri Nets. Walter Vogler |
| 1997 | Efficient Array Partitioning. Sanjeev Khanna, S. Muthukrishnan, Steven Skiena |
| 1997 | Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. Edson Cáceres, Frank K. H. A. Dehne, Afonso Ferreira, Paola Flocchini, Ingo Rieping, Alessandro Roncato, Nicola Santoro, Siang W. Song |
| 1997 | Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). Roberto Grossi, Giuseppe F. Italiano |
| 1997 | Enumerative Sequences of Leaves in Rational Trees. Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin |
| 1997 | Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
| 1997 | Finite Loops Recognize Exactly the Regular Open Languages. Martin Beaudry, François Lemieux, Denis Thérien |
| 1997 | From Chaotic Iteration to Constraint Propagation. Krzysztof R. Apt |
| 1997 | Game Theoretic Analysis of Call-by-Value Computation. Kohei Honda, Nobuko Yoshida |
| 1997 | Graphical Calculi for Interaction (Abstract). Robin Milner |
| 1997 | Improving Spanning Trees by Upgrading Nodes. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth |
| 1997 | Independent Sets in Asteroidal Triple-Free Graphs. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller |
| 1997 | Labelled Reductions, Runtime Errors and Operational Subsumption. Laurent Dami |
| 1997 | Maintaining Minimum Spanning Trees in Dynamic Graphs. Monika Rauch Henzinger, Valerie King |
| 1997 | Minimizing Diameters of Dynamic Trees. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup |
| 1997 | Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes. Olaf Burkart, Bernhard Steffen |
| 1997 | Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. Richard Beigel, Bin Fu |
| 1997 | Monadic Simultaneous Rigid E-Unification and Related Problems. Yuri Gurevich, Andrei Voronkov |
| 1997 | NP-Completeness: A Retrospective. Christos H. Papadimitriou |
| 1997 | On Characterization of Escrow Encryption Schemes. Yair Frankel, Moti Yung |
| 1997 | On Confluence in the pi-Calculus. Anna Philippou, David Walker |
| 1997 | On Explicit Substitution and Names (Extended Abstract). Eike Ritter, Valeria de Paiva |
| 1997 | On Modular Properties of Higher Order Extensional Lambda Calculi. Roberto Di Cosmo, Neil Ghani |
| 1997 | On Recognizable and Rational Formal Power Series in Partially Commuting Variables. Manfred Droste, Paul Gastin |
| 1997 | On a Conjecture of J. Shallit. Julien Cassaigne |
| 1997 | On the Concentration of the Height of Binary Search Trees. John Michael Robson |
| 1997 | On the Dynamics of Sharing Graphs. Andrea Asperti, Cosimo Laneve |
| 1997 | On-Line Routing in All-Optical Networks. Yair Bartal, Stefano Leonardi |
| 1997 | Periodic and Non-periodic Min-Max Equations. Uwe Schwiegelshohn, Lothar Thiele |
| 1997 | Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs. Farid M. Ablayev |
| 1997 | Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract). Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano |
| 1997 | Recognizability Equals Definability for Partial k-Paths. Valentine Kabanets |
| 1997 | Recursive Computational Depth. James I. Lathrop, Jack H. Lutz |
| 1997 | Refining and Compressing Abstract Domains. Roberto Giacobazzi, Francesco Ranzato |
| 1997 | Results on Resource-Bounded Measure. Harry Buhrman, Stephen A. Fenner, Lance Fortnow |
| 1997 | Solving Trace Equations Using Lexicographical Normal Forms. Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl |
| 1997 | Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract). Olivier Bournez |
| 1997 | Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic. Thomas Wilke |
| 1997 | Symbolic Model Checking for Probabilistic Processes. Christel Baier, Edmund M. Clarke, Vasiliki Hartonas-Garmhausen, Marta Z. Kwiatkowska, Mark Ryan |
| 1997 | Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract). Ahmed Bouajjani, Peter Habermehl |
| 1997 | Termination of Constraint Logic Programs. Salvatore Ruggieri |
| 1997 | The Equivalence Problem for Deterministic Pushdown Automata is Decidable. Géraud Sénizergues |
| 1997 | The Expressibility of Languages and Relations by Word Equations. Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi |
| 1997 | The Expressive Power of Unique Total Stable Model Semantics. Francesco Buccafurri, Sergio Greco, Domenico Saccà |
| 1997 | The Geometry of Orthogonal Reduction Spaces. Zurab Khasidashvili, John R. W. Glauert |
| 1997 | The LEDA Platform of Combinatorial and Geometric Computing. Kurt Mehlhorn, Stefan Näher, Christian Uhrig |
| 1997 | The Minimum Color Sum of Bipartite Graphs. Amotz Bar-Noy, Guy Kortsarz |
| 1997 | The Name Discipline of Uniform Receptiveness (Extended Abstract). Davide Sangiorgi |
| 1997 | The Theory of Vaccines. Massimo Marchiori |
| 1997 | The Wadge-Wagner Hierarchy of omega-Rational Sets. Olivier Carton, Dominique Perrin |
| 1997 | The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. Paliath Narendran, Friedrich Otto |
| 1997 | Tilings and Quasiperiodicity. Bruno Durand |
| 1997 | Upper Bound on Communication Complexity of Private Information Retrieval. Andris Ambainis |
| 1997 | Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim |