| 1997 | When are Two Rewrite Systems More than None? | Nachum Dershowitz |
| 1997 | Distances Between Languages and Reflexivity of Relations. | Christian Choffrut, Giovanni Pighizzini |
| 1997 | Subtyping Calculus of Construction (Extended Abstract). | Gang Chen |
| 1997 | A Shift-Invariant Metric on S | Gianpiero Cattaneo, Enrico Formenti, Luciano Margara, Jacques Mazoyer |
| 1997 | Specifying Computations Using Hyper Transition Systems. | Marcello M. Bonsangue, Joost N. Kok |
| 1997 | Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. | Beate Bollig, Ingo Wegener |
| 1997 | Treewidth: Algorithmic Techniques and Results. | Hans L. Bodlaender |
| 1997 | A Category of Transition Systems and Its Relations with Orthomodular Posets. | Luca Bernardinello, Lucia Pomello |
| 1997 | Accepting Zeno Words Without Making Time Stand Still. | Batrice Brard, Claudine Picaronny |
| 1997 | Communication Complexity. | Lszl Babai |
| 1997 | The Expressiveness of Datalog Circuits (DAC). | Foto N. Afrati, Irne Guessarian, Michel de Rougemont |
| 1997 | Game Semantics for Programming Languages (Abstract). | Samson Abramsky |
| 1996 | From Static to Dynamic Abstract Data-Types. | Elena Zucca |
| 1996 | Polynomial Time Samplable Distributions. | Tomoyuki Yamakami |
| 1996 | On Fairness in Terminating and Reactive Programs. | Axel Wabenhorst |
| 1996 | Kolmogorov Complexity: Recent Research in Moscow. | Vladimir A. Uspensky |
| 1996 | A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries. | Pilar de la Torre, David T. Kao |
| 1996 | A Sequent Calculus for Subtyping Polymorphic Types. | Jerzy Tiuryn |
| 1996 | Routing on Triangles, Tori and Honeycombs. | Jop F. Sibeyn |
| 1996 | A Semantic Matching Algorithm: Analysis and Implementation. | Hui Shi |
| 1996 | On the Conjugation of Standard Morphisms. | Patrice Sbold |
| 1996 | Mind the Gap! Abstract Versus Concrete Models of Specifications. | Donald Sannella, Andrzej Tarlecki |
| 1996 | Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard. | Carsten Rssner, Jean-Pierre Seifert |
| 1996 | Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract). | Jeffrey B. Remmel |
| 1996 | On Saturation with Flexible Function Symbols. | Regimantas Pliuskevicius |