Information and Computation, Volume 116

Volume 116, Number 1, 1995

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

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