| 1985 | A fast heuristic for covering polygons by rectangles. | Christos Levcopoulos |
| 1985 | Array processing machines. | Jan van Leeuwen, Jir Wiedermann |
| 1985 | String grammars with disconnecting. | Klaus-Jrn Lange, Emo Welzl |
| 1985 | Linear comparison complexity of the n-cube membership problem. | Mirko Krivnek, Jaroslav Morvek |
| 1985 | Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete. | Mirko Krivnek, Jaroslav Morvek |
| 1985 | Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). | Klaus Kriegel, Stephan Waack |
| 1985 | Statistical testing of finite sequences based on algorithmic complexity. | Ivan Kramosil |
| 1985 | Parallel algorithms for connected components in a graph. | Vclav Koubek, Jana Krsnakova |
| 1985 | Discrete extremal problems on covering. | A. D. Korshunov |
| 1985 | Free cost measures of trees. | Rainer Kemp |
| 1985 | Depth efficient transformations of arithmetic into Boolean circuits. | Hermann Jung |
| 1985 | A lower bound on the oscillation complexity of context-free languages. | Thomas Gundermann |
| 1985 | Logic programming and substitutions. | Gudmund Skovbjerg Frandsen |
| 1985 | A language theoretic approach to serialization problem in concurrent systems. | Marie-Paule Fl, Grard Roucairol |
| 1985 | Elements of a general theory of combinatorial structures. | Philippe Flajolet |
| 1985 | On coordinated rewriting. | Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg |
| 1985 | Lower bounds on the complexity of 1-time only branching programs. | Paul E. Dunne |
| 1985 | Partial ordering derivations for CCS. | Pierpaolo Degano, Rocco De Nicola, Ugo Montanari |
| 1985 | Decidability of confluence for ground term rewriting systems. | Max Dauchet, Sophie Tison |
| 1985 | Algorithms solving path systems. | Bogdan S. Chlebus |
| 1985 | Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. | Alexander L. Chistov |
| 1985 | On the restriction of some NP-complete graph problems to permutation graphs. | Andreas Brandstdt, Dieter Kratsch |
| 1985 | On formal languages, probabilities, paging and decoding algorithms. | Joffroy Beauquier, Los Thimonier |
| 1985 | Muller automata and bi-infinite words. | Danile Beauquier |
| 1985 | Fast parallel vertex colouring. | Frank Bauernppel, Hermann Jung |