| 1985 | On some "non-uniform" complexity measures. | Jos L. Balczar, Josep Daz, Joaquim Gabarr |
| 1985 | A unifying theorem for algebraic semantics and dynamic logics. | Hajnal Andrka, Irne Guessarian, Istvn Nmeti |
| 1985 | Space complexity of alternating Turing machines. | Maris Alberts |
| 1985 | On some topological properties of logic programs. | M. A. Nait Abdallah |
| 1983 | A Note on Powerdomains and Modalitiy. | Glynn Winskel |
| 1983 | Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. | Pawel Urzyczyn |
| 1983 | On Approximate String Matching. | Esko Ukkonen |
| 1983 | Metrical an Ordered Properties of Powerdomains. | Sophie Tison, Max Dauchet, Grard Comyn |
| 1983 | Remarks on Searching Labyrinths by Automata. | Andrzej Szepietowski |
| 1983 | The Identification of Propositions and types in Martin-Lf's Type Theory: A Programming Example. | Jan M. Smith |
| 1983 | A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions. | Hans Ulrich Simon |
| 1983 | A Fast Construction oF Disjoint Paths in Communication Networks. | Eli Shamir, Eli Upfal |
| 1983 | A Kernel Language for Algebraic Specification and Implementation - Extended Abstract. | Donald Sannella, Martin Wirsing |
| 1983 | Modular Decompostion of Automata (Survey). | Dieter Rdding |
| 1983 | A New Solution for the Byzantine Generals Problem (Extended Abstract). | Rdiger Reischuk |
| 1983 | On Diagonalization Methods and the Structure of Language Classes. | Kenneth W. Regan |
| 1983 | A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems. | Marco Protasi, Maurizio Talamo |
| 1983 | Reasoning with Fairness Constraints. | David Michael Ritchie Park |
| 1983 | Propositional Logics of Programs: New Directions. | Rohit Parikh |
| 1983 | Characterizing Composability of Abstract Implementations. | Fernando Orejas |
| 1983 | Finding Dominators. | Renata Ochranov |
| 1983 | A Complete Set of Axioms for a Theory of Communicating Sequential Processes. | Rocco De Nicola |
| 1983 | Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). | Gary L. Miller |
| 1983 | A Single Shortest Path Algorithm for Graphs with Separators. | Kurt Mehlhorn, Bernd H. Schmidt |
| 1983 | Functional Behaviour of Nondeterministic Programs. | Michael G. Main, David B. Benson |