| 1983 | Decision Problems for Exponential Rings: The p-adic case. | Angus Macintyre |
| 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 | Estimating a Probability Using Finite Memory (Extended Abstract). | Frank Thomson Leighton, Ronald L. Rivest |
| 1983 | Apects of Programs With Finite Modes. | Hans Langmaack |
| 1983 | On Languages Generated by Semigroups. | Ladislav Janiga, Vclav Koubek |
| 1983 | On Containment Problems for Finite-Turn Languages (Extended Abstract). | Yair Itzhaik, Amiram Yehudai |
| 1983 | Fast Triangulation of Simple Polygons. | Stefan Hertel, Kurt Mehlhorn |
| 1983 | Propositional Dynamic Logic of Flowcharts. | David Harel, Rivi Sherman |
| 1983 | Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). | David Harel |
| 1983 | Pseudorandom Number Generation and Space Complexity. | Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer |
| 1983 | Space and Reversal Complexity of Probabilistic One-Way Turing Machines. | Rusins Freivalds |
| 1983 | Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process. | Philippe Flajolet |
| 1983 | The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). | Michael J. Fischer |
| 1983 | Economy of Description for Program Schemes -Extended Abstract-. | Peter Drum, Detlef Wotschke |
| 1983 | Two Way Finite State Generators. | Karel Culk II, Emo Welzl |
| 1983 | A Fair Calculus of Communicating Systems. | Gerardo Costa, Colin Stirling |
| 1983 | The Classifikation of Problems which have Fast Parallel Algorithms. | Stephen A. Cook |
| 1983 | Constructive Mathematics as a Programming Logic I: Some Principles of Theory. | Robert L. Constable |
| 1983 | How to Search in History. | Bernard Chazelle |
| 1983 | Input-Driven Languages are Recognized in log n Space. | Burchard von Braunmhl, Rutger Verbeek |
| 1983 | Reversal-Bounded and Visit-Bounded Realtime Computations. | Andreas Brandstdt, Klaus W. Wagner |
| 1983 | Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. | Piotr Berman |
| 1983 | Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming. | Samson Abramsky |
| 1981 | Tape Complexity of Word Problems. | Stephan Waack |
| 1981 | Extensions of Symmetric Hom-Functors to the Kleisli Category. | Jir Vinrek |