Abstract is missing.
- Partial functions in constructive formal theoriesRobert L. Constable. 1-18
- Monte-Carlo factoring algorithm with finite storageClaus-Peter Schnorr. 19-33
- Theory of concurrency controlChristos H. Papadimitriou. 35-47
- Interprocedural data flow systemsGerhard Barth. 49-59
- On the crossing-free, rectangular embedding of weighted graphs in the planeBernd Becker. 61-72
- Discreteness, k-density and d-continuity of occurrence netsEike Best, Agathe Merceron. 73-83
- Controlled relativizations of P and NPRonald V. Book, Timothy J. Long, Alan L. Selman. 85-90
- The computational complexity of certain graph grammarsFranz-Josef Brandenburg. 91-99
- Inconsistencies of pure LISPAndreas Eick, Elfriede Fehr. 101-110
- Fifo nets: a new model of parallel computationAlain Finkel, Gérard Memmi. 111-121
- Une extension aux mots infinis de la notion de transduction rationelleFrançoise Gire. 123-139
- Algebraic and operational semantics of exceptions and errorsMartin Gogolla, Klaus Drosten, Udo W. Lipeck, Hans-Dieter Ehrich. 141-151
- The expected number of nodes and leaves at level k in ordered treesR. Kemp. 153-163
- Complexity theory on real numbers and functionsChristoph Kreitz, Klaus Weihrauch. 165-174
- A multifit algorithm for uniform multiprocessor schedulingManfred Kunde. 175-185
- Analysis of polynomial approximation algorithms for constraint expressionsKarl J. Lieberherr, Stephen A. Vavasis. 187-197
- Heuristics for minimum edge length rectangular partitions of rectilinear figuresAndrzej Lingas. 199-210
- An axiomatic approach to semantics of specification languagesJohann A. Makowsky, Bernd Mahr. 211-219
- Efficiency of universal parallel computersFriedhelm Meyer auf der Heide. 221-241
- A general scheme for some deterministically parsable grammars and their strong equivalentsAnton Nijholt, Jan Pittl. 243-255
- A decidability result about sufficient-completeness of axiomatically specified abstract data typesTobias Nipkow, Gerhard Weikum. 257-268
- Two remarks on the power of countingChristos H. Papadimitriou, Stathis Zachos. 269-276
- Some operations and transductions that preserve rationalityJean-Eric Pin, Jacques Sakarovitch. 277-288
- On algebras of computation sequences and proofs of equivalence of operational and denotational semanticsAxel Poigné. 289-300
- Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescritsPatrice Séébold. 301-311
- The equivalence problem for N.T.S. languages is decidableGéraud Sénizergues. 313-323
- Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculiKurt Sieber. 325-334
- A hierarchy of sets of infinite treesWolfgang Thomas. 335-342
- Maintaining order in a generalized linked listAthanasios K. Tsakalidis. 343-352
- Periodic versus arbitrary tessellations of the plane using polyominos of a single typeHarry A. G. Wijshoff, Jan van Leeuwen. 353-366