| 1997 | A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke |
| 1997 | A Conditional-Logical Approach to Minimum Cross-Entropy. Gabriele Kern-Isberner |
| 1997 | A Downward Translation in the Polynomial Hierarchy. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 1997 | A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams. Christoph Meinel, Anna Slobodová |
| 1997 | Algebraic and Logical Characterizations of Deterministic Linear Time Classes. Thomas Schwentick |
| 1997 | An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). Joan Feigenbaum, Martin Strauss |
| 1997 | An Unambiguous Class Possessing a Complete Set. Klaus-Jörn Lange |
| 1997 | Better Algorithms for Minimum Weight Vertex-Connectivity Problems. Vincenzo Auletta, Domenico Parente |
| 1997 | Deadlock-Free Interval Routing Schemes. Michele Flammini |
| 1997 | Distance Approximating Spanning Trees. Erich Prisner |
| 1997 | Efficient Construction of Hitting Sets for Systems of Linear Functions. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim |
| 1997 | Efficient Scaling-Invariant Checking of Timed Bisimulation. Carsten Weise, Dirk Lenzkes |
| 1997 | Equivalence of Measures of Complexity Classes. Josef M. Breutzmann, Jack H. Lutz |
| 1997 | Fast Online Multiplication of Real Numbers. Matthias Schröder |
| 1997 | Finding the k Shortest Paths in Parallel. Eric Ruppert |
| 1997 | Gossiping and Broadcasting versus Computing Functions in Networks. Martin Dietzfelbinger |
| 1997 | Greibach Normal Form Transformation, Revisited. Robert Koch, Norbert Blum |
| 1997 | Hybrid Diagrams: A Deductive-Algorithmic Approach to Hybrid System Verification. Luca de Alfaro, Arjun Kapur, Zohar Manna |
| 1997 | Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes. Maciej Liskiewicz |
| 1997 | Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton. Jérôme Olivier Durand-Lose |
| 1997 | Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger |
| 1997 | MOD Claudia Bertram-Kretzberg, Hanno Lefmann |
| 1997 | Measuring Nondeterminism in Pushdown Automata. Jonathan Goldstine, Hing Leung, Detlef Wotschke |
| 1997 | Memory Management for Union-Find Algorithms. Christophe Fiorio, Jens Gustedt |
| 1997 | Methods and Applications of (MAX, +) Linear Algebra. Stephane Gaubert, Max Plus |
| 1997 | Minimal Transition Systems for History-Preserving Bisimulation. Ugo Montanari, Marco Pistore |
| 1997 | On Ergodic Linear Cellular Automata over Z Gianpiero Cattaneo, Enrico Formenti, Giovanni Manzini, Luciano Margara |
| 1997 | On Polynomially D-Verbose Sets. Arfst Nickelsen |
| 1997 | On the Classification of Computable Languages. John Case, Efim B. Kinber, Arun Sharma, Frank Stephan |
| 1997 | On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. Stephan Waack |
| 1997 | Pattern Matching in Trace Monoids (Extended Abstract). Jochen Meßner |
| 1997 | Power Consumption in Packet Radio Networks (Extended Abstract). Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc |
| 1997 | Predecessor Queries in Dynamic Integer Sets. Gerth Stølting Brodal |
| 1997 | Probabilistic Proof Systems - A Survey. Oded Goldreich |
| 1997 | Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract). Ingrid Biehl, Bernd Meyer |
| 1997 | RNC-Approximation Algorithms for the Steiner Problem. Hans Jürgen Prömel, Angelika Steger |
| 1997 | Regular Expressions and Context-Free Grammars for Picture Languages. Oliver Matz |
| 1997 | Removing epsilon-Transitions in Timed Automata. Volker Diekert, Paul Gastin, Antoine Petit |
| 1997 | Resource-Bounded Kolmogorov Complexity Revisited. Harry Buhrman, Lance Fortnow |
| 1997 | STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings Rüdiger Reischuk, Michel Morvan |
| 1997 | Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio |
| 1997 | Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. Elias Dahlhaus |
| 1997 | Strict Sequential P-completeness. Klaus Reinhardt |
| 1997 | Temporal Logics for the Specification of Performance and Reliability. Luca de Alfaro |
| 1997 | The Complexity of Generating Test Instances. Christoph Karg, Johannes Köbler, Rainer Schuler |
| 1997 | The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit |
| 1997 | The Operators min and max on the Polynomial Hierarchy. Harald Hempel, Gerd Wechsung |
| 1997 | Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke |
| 1997 | Undecidability Results on Two-Variable Logics. Erich Grädel, Martin Otto, Eric Rosen |
| 1997 | Unifying Models. Bernhard Steffen |