Journal: Inf. Comput.

Volume 116, Issue 2

155 -- 161Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn. A Communication-Randomness Tradeoff for Two-Processor Systems
162 -- 173Ulrich Tamm. Communication Complexity of Sum-Type Functions Invariant under Translation
174 -- 192John Case, Sanjay Jain, Arun Sharma. Complexity Issues for Vacillatory Function Identification
193 -- 213Steve Schneider. An Operational Semantics for Timed CSP
214 -- 230Tomoyuki Yamakami. Feasible Computability and Resource Bounded Topology
231 -- 240Zoltán Fülöp, Sándor Vágvölgyi. Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations
241 -- 252Gösta Grahne, Alberto O. Mendelzon. Updates and Subjunctive Queries
253 -- 271David Walker. Objects in the pi-Calculus
272 -- 274Roberto M. Amadio. A Quick Construction of a Retraction of All Retractions for Stable Bifinites
275 -- 293Bruno Courcelle. Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement
294 -- 303Jon G. Riecke. Statman s 1-Section Theorem
304 -- 311S. C. Fang, J. R. Rajasekera. Entropy Optimization Models with Convex Constraints

Volume 116, Issue 1

1 -- 9Michiel H. M. Smid. Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem
10 -- 25Michael Huth. A Maximal Monoidal Closed Category of Distributive Algebraic Domains
26 -- 37Juanito Camilleri, Glynn Winskel. CCS with Priority Choice
38 -- 57Bent Thomsen. A Theory of Higher Order Communicating Systems
58 -- 80Anil Nerode, Raymond T. Ng, V. S. Subrahmanian. Computing Circumscriptive Databases: I. Theory and Algorithms
81 -- 102Naoki Abe. Characterizing PAC-Learnability of Semilinear Sets
103 -- 116Neil Immerman, Susan Landau. The Complexity of Iterated Multiplication
117 -- 127Wayne Eberly. Fast Parallel Band Matrix Arithmetic
128 -- 133Dafna Sheinwald, Abraham Lempel, Jacob Ziv. On Encoding and Decoding with Two-Way Head Machines
134 -- 153Volker Diekert, Paul Gastin, Antoine Petit. Rational and Recognizable Complex Trace Languages