Journal: Inf. Comput.

Volume 86, Issue 2

115 -- 139Andrea Asperti. Stability and Computability in Coherent Domains
140 -- 159Greg N. Frederickson. A Distributed Shortest Path Algorithm for a Planar Network
160 -- 178Eric Allender, Osamu Watanabe. Kolmogorov Complexity and Degrees of Tally Sets
179 -- 194Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke. On Measuring Nondeterminism in Regular Languages
195 -- 212Zoltán Fülöp, Sándor Vágvölgyi. A Complete Rewriting System for a Monoid of Tree Transformation Classes

Volume 86, Issue 1

1 -- 13Chein-I Chang, Simon C. Fan, Lee D. Davisson. On Numerical Methods of Calculating the Capacity of Continuous-Input Discrete-Output Memoryless Channels
14 -- 31Deepak Kapur, Paliath Narendran, Friedrich Otto. On Ground-Confluence of Term Rewriting Systems
32 -- 42Christopher J. Ash, T. E. Hall, Jean-Eric Pin. On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents
43 -- 68Paris C. Kanellakis, Scott A. Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence
69 -- 86Jörg-Rüdiger Sack, Thomas Strothotte. A Characterization of Heaps and Its Applications
87 -- 106Hans Leo Bodlaender. The Complexity of Finding Uniform Emulations on Paths and Ring Networks
107 -- 114Bruce E. Litow. Parallel Complexity of the Regular Code Problem