| 1995 | Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. | Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis |
| 1995 | On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). | Victor Chepoi, Feodor F. Dragan |
| 1995 | A Duration Calculus with Infinite Intervals. | Chaochen Zhou, Dang Van Hung, Xiaoshan Li |
| 1995 | About Planar Cayley Graphs. | Thomas Chaboud |
| 1995 | Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). | Cristian Calude, Marius Zimand |
| 1995 | Efficient Rewriting in Cograph Trace Monoids. | Michael Bertol |
| 1995 | Processes with Multiple Entries and Exits. | Jan A. Bergstra, Gheorghe Stefanescu |
| 1995 | A Simple Abstract Semantics for Equational Theories. | Gilles Barthe |
| 1995 | Discrete Time Process Algebra with Abstraction. | Jos C. M. Baeten, Jan A. Bergstra |
| 1995 | Rewriting Regular Inequalities (Extended Abstract). | Valentin M. Antimirov |
| 1995 | From a Concurrent Lambda-Calculus to the Pi-Calculus. | Roberto M. Amadio, Lone Leth Thomsen, Bent Thomsen |
| 1993 | On the Learnability of a Restricted Predicate Formulae. | Jilei Yin, Hong Zhu |
| 1993 | Synthesis of O(lg n) Testable Trees. | Hongzhong Wu |
| 1993 | A Hierarchy of Deterministic Top-down Tree Transformations. | Giora Slutzki, Sndor Vgvlgyi |
| 1993 | Structural Equivalences and ET0L Grammars (Extended Abstract). | Kai Salomaa, Derick Wood, Sheng Yu |
| 1993 | Pattern Languages: Problems of Decidability and Generation. | Arto Salomaa |
| 1993 | On Tree Pattern Unification Problems. | Peter Ruzicka, Igor Prvara |
| 1993 | One-way Cellular Automata on Cayley Graphs. | Zsuzsanna Rka |
| 1993 | AC | Pavel Pudlk |
| 1993 | Regular Tree Languages Without Unary Symbols are Star-Free. | Andreas Potthoff, Wolfgang Thomas |
| 1993 | An Action Structure for Synchronous pi-Calculus. | Robin Milner |
| 1993 | On Scattered Syntactic Monoids. | Alexandru Mateescu |
| 1993 | Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. | Maurice Margenstern |
| 1993 | The Equational Theory of a Boolean Monad. | Ernest G. Manes |
| 1993 | Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating Functions. | Robert S. Maier, Ren Schott |