%A Patrick Cousot
%A Radhia Cousot
%T Sometime = always + recursion == always
on the equivalence of the intermittent and invariant assertion methods
for proving inevitability properties of programs
%J Acta Informatica
%K acta_inf
%V 24
%N 1
%D February 1987
%P 1-31

%A Ryszard Janicki
%T A formal semantics for concurrent systems with a priority relation
%J Acta Informatica
%K acta_inf
%V 24
%N 1
%D February 1987
%P 33-55

%A Masato Takeichi
%T Partial parameterization eliminates multiple traversals of data structures
%J Acta Informatica
%K acta_inf
%V 24
%N 1
%D February 1987
%P 57-77

%A Oded Goldreich
%A Liuba Shrira
%T Electing a leader in a ring with link failures
%J Acta Informatica
%K acta_inf
%V 24
%N 1
%D February 1987
%P 79-91

%A C.H.C. Leung
%T Analysis of space allocation in a generally fragmented linear store
%J Acta Informatica
%K acta_inf
%V 24
%N 1
%D February 1987
%P 93-104

%A K. Vidyasankar
%T Generalized theory of serializability
%J Acta Informatica
%K acta_inf
%V 24
%N 1
%D February 1987
%P 105-119

%A Manfred Kunde
%T Lower bounds for sorting on mesh-connected architectures
%J Acta Informatica
%K acta_inf
%V 24
%N 2
%D April 1987
%P 121-130

%A G. Loizou
%A P. Thanisch
%T Losslessness and project-join constructibility in relational databases
%J Acta Informatica
%K acta_inf
%V 24
%N 2
%D April 1987
%P 131-144

%A Thomas P. Murtagh
%T Redundant proofs of non-interference in Levin-Gries CSP program proofs
%J Acta Informatica
%K acta_inf
%V 24
%N 2
%D April 1987
%P 145-156

%A Stephan Heilbrunner
%A Steffen Holldobler
%T The undecidability of the unification and matching problem
for canonical theories
%J Acta Informatica
%K acta_inf
%V 24
%N 2
%D April 1987
%P 157-171

%A Wojciech Szpenkowski
%T An analysis of a contention resolution algorithm: another approach
%J Acta Informatica
%K acta_inf
%V 24
%N 2
%D April 1987
%P 173-190

%A Lawrence A. Harris
%T SLR(1) and LALR(1) parsing for unrestricted grammars
%J Acta Informatica
%K acta_inf
%V 24
%N 2
%D April 1987
%P 191-209

%A Rocco De\ Nicola
%T Extensional equivalences for transition systems
%J Acta Informatica
%K acta_inf
%V 24
%N 2
%D April 1987
%P 211-237

%A Ali Mili
%A Jules Desharnais
%A Fatma Mili
%T Relational heuristics for the design of deterministic programs
%J Acta Informatica
%K acta_inf
%V 24
%N 3
%D June 1987
%P 239-276

%A L. Devroye
%T Branching processes in the analysis of the heights of trees
%J Acta Informatica
%K acta_inf
%V 24
%N 3
%D June 1987
%P 277-298

%A Henk Alblas
%T One-pass transformations of attributed program trees
%J Acta Informatica
%K acta_inf
%V 24
%N 3
%D June 1987
%P 299-352

%A S. Kiran Kumar
%A C. Pandu Rangan
%T A linear space algorithm for the LCS problem
%J Acta Informatica
%K acta_inf
%V 24
%N 3
%D June 1987
%P 353-362

%A Bernd Becker
%T An easily testable optimal-time VLSI-multiplier
%J Acta Informatica
%K acta_inf
%V 24
%N 4
%D August 1987
%P 363-380

%A Albert Hoogewijs
%T Partial-predicate logic in computer science
%J Acta Informatica
%K acta_inf
%V 24
%N 4
%D August 1987
%P 381-393
%K 3 three valued logic

%A Deepak Kapur
%A Paliath Narendran
%A Hantao Zhang
%T On sufficient-completeness and related properties of term rewriting systems
%J Acta Informatica
%K acta_inf
%V 24
%N 4
%D August 1987
%P 395-415

%A Josephn G. Peters
%A Larry Rudolph
%T Parallel approximation schemes for subset sum and knapsack problems
%J Acta Informatica
%K acta_inf
%V 24
%N 4
%D August 1987
%P 417-432

%A Ursula Schmidt
%T Long unavoidable patterns
%J Acta Informatica
%K acta_inf
%V 24
%N 4
%D August 1987
%P 433-445

%A Paul E. Dunne
%T A result on k-valent graphs and its application to a graph embedding problem
%J Acta Informatica
%K acta_inf
%V 24
%N 4
%D August 1987
%P 447-459

%A M. Kempf
%A R. Bayer
%A U. Guntzer
%T Time optimal left to right construction of position trees
%J Acta Informatica
%K acta_inf
%V 24
%N 4
%D August 1987
%P 461-474

%A Edward A. Bender
%A Cheryl E. Praeger
%A Nicholas C. Wormald
%T Optimal worst case trees
%J Acta Informatica
%K acta_inf
%V 24
%N 4
%D August 1987
%P 475-489