| 1983 | A Complete Set of Axioms for a Theory of Communicating Sequential Processes. Rocco De Nicola |
| 1983 | A Fair Calculus of Communicating Systems. Gerardo Costa, Colin Stirling |
| 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 | A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems. Marco Protasi, Maurizio Talamo |
| 1983 | A New Solution for the Byzantine Generals Problem (Extended Abstract). Rüdiger Reischuk |
| 1983 | A Note on Powerdomains and Modalitiy. Glynn Winskel |
| 1983 | A Single Shortest Path Algorithm for Graphs with Separators. Kurt Mehlhorn, Bernd H. Schmidt |
| 1983 | A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions. Hans Ulrich Simon |
| 1983 | Apects of Programs With Finite Modes. Hans Langmaack |
| 1983 | Characterizing Composability of Abstract Implementations. Fernando Orejas |
| 1983 | Constructive Mathematics as a Programming Logic I: Some Principles of Theory. Robert L. Constable |
| 1983 | Decision Problems for Exponential Rings: The p-adic case. Angus Macintyre |
| 1983 | Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. Pawel Urzyczyn |
| 1983 | Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. Piotr Berman |
| 1983 | Economy of Description for Program Schemes -Extended Abstract-. Peter Drum, Detlef Wotschke |
| 1983 | Estimating a Probability Using Finite Memory (Extended Abstract). Frank Thomson Leighton, Ronald L. Rivest |
| 1983 | Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming. Samson Abramsky |
| 1983 | Fast Triangulation of Simple Polygons. Stefan Hertel, Kurt Mehlhorn |
| 1983 | Finding Dominators. Renata Ochranová |
| 1983 | Functional Behaviour of Nondeterministic Programs. Michael G. Main, David B. Benson |
| 1983 | Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983 Marek Karpinski |
| 1983 | How to Search in History. Bernard Chazelle |
| 1983 | Input-Driven Languages are Recognized in log n Space. Burchard von Braunmühl, Rutger Verbeek |
| 1983 | Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). Gary L. Miller |
| 1983 | Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process. Philippe Flajolet |
| 1983 | Metrical an Ordered Properties of Powerdomains. Sophie Tison, Max Dauchet, Gérard Comyn |
| 1983 | Modular Decompostion of Automata (Survey). Dieter Rödding |
| 1983 | On Approximate String Matching. Esko Ukkonen |
| 1983 | On Containment Problems for Finite-Turn Languages (Extended Abstract). Yair Itzhaik, Amiram Yehudai |
| 1983 | On Diagonalization Methods and the Structure of Language Classes. Kenneth W. Regan |
| 1983 | On Languages Generated by Semigroups. Ladislav Janiga, Václav Koubek |
| 1983 | Propositional Dynamic Logic of Flowcharts. David Harel, Rivi Sherman |
| 1983 | Propositional Logics of Programs: New Directions. Rohit Parikh |
| 1983 | Pseudorandom Number Generation and Space Complexity. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer |
| 1983 | Reasoning with Fairness Constraints. David Michael Ritchie Park |
| 1983 | Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). David Harel |
| 1983 | Remarks on Searching Labyrinths by Automata. Andrzej Szepietowski |
| 1983 | Reversal-Bounded and Visit-Bounded Realtime Computations. Andreas Brandstädt, Klaus W. Wagner |
| 1983 | Space and Reversal Complexity of Probabilistic One-Way Turing Machines. Rusins Freivalds |
| 1983 | The Classifikation of Problems which have Fast Parallel Algorithms. Stephen A. Cook |
| 1983 | The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). Michael J. Fischer |
| 1983 | The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete. Andrzej Lingas |
| 1983 | The Identification of Propositions and types in Martin-Löf's Type Theory: A Programming Example. Jan M. Smith |
| 1983 | Two Way Finite State Generators. Karel Culík II, Emo Welzl |