Information and Computation
, Volume 81
Volume 81, Number 1, 1989
Jerzy Tiuryn
: A Simplified Proof of DDL < DL. 1-12
Michael C. Browne
,
Edmund M. Clarke
,
Orna Grumberg
: Reasoning about Networks with Many Identical Finite State Processes. 13-31
Alan Gibbons
,
Wojciech Rytter
: Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition. 32-45
Aviezri S. Fraenkel
: The Use and Usefulness of Numeration Systems. 46-61
Ker-I Ko
: Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets. 62-87
Joost Engelfriet
,
George Leih
: Linear Graph Grammars: Power and Complexity. 88-121
Volume 81, Number 2, 1989
Thierry Coquand
,
Carl A. Gunter
,
Glynn Winskel
: Domain Theoretic Models of Polymorphism. 123-167
V. Michele Abrusci
,
Gianfranco Mascari
: A Logic of Recursion. 168-226
Robin Milner
: A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors. 227-247
Volume 81, Number 3, 1989
Robert S. Streett
,
E. Allen Emerson
: An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus. 249-264
Géraud Sénizergues
: Church-Rosser Controller Rewriting Systems and Equivalence problems for Deterministic Context-Free Languages. 265-279
Sorin Istrail
: An Arithmetical Hierarchy in Propositional Dynamic Logic. 280-289
Karel Hrbacek
: Convex Powerdomains II. 290-317
Don Coppersmith
,
Prabhakar Raghavan
,
Martin Tompa
: Parallel Graph Algorithms That Are Efficient on Average. 318-333
Richard Cole
,
Uzi Vishkin
: Faster Optimal Parallel Prefix Sums and List Ranking. 334-352
H.-J. Stoß
,
W. Schnitzlein
: Linear-Time Simulation of Multihead Turing Machines. 353-363
Dan E. Willard
,
John H. Reif
: Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search. 364-379
Copyright ©
Mon Dec 21 00:34:00 2009 by
Michael Ley
(
ley@uni-trier.de
)