Information and Computation, Volume 74

Volume 74, Number 1, 1987

R. E. Krichevsky: Information Compression and Varshamov-Gilbert Bound. 1-14 BibTeX
Peter Kirschenhofer, Helmut Prodinger: On the Recursive Depth of Special Tree Traversal Algorithms. 15-32 BibTeX
David Peleg, Barbara Simons: On Fault Tolerant Routings in General Networks. 33-49 BibTeX
Che-Liang Yang, Gerald M. Masson: An Efficient Algorithm for Multiprocessor Fault Diagnosis Using the Comparison Approach. 50-63 BibTeX
Brigitte Rozoy: The Dyck Language D'_1^* Is Not Generated by Any Matric Grammar of Finite Index. 64-89 BibTeX

Assaf Marron, Ker-I Ko: Identification of Pattern Languages from Examples and Queries. 91-112 BibTeX
Greg N. Frederickson, Mandayan A. Srinivas: On-line Updating of Solutions to a Class of Matroid Intersection Problems. 113-139 BibTeX
Dieter Kratsch: Finding the Minimum Bandwidth of an Interval Graphs. 140-158 BibTeX
Jennifer L. Welch: Simulating Synchronous Processors. 159-170 BibTeX

Jacques Sakarovitch: Easy Multiplications. I. The Realm of Kleene's Theorem. 173-197 BibTeX
Karel Hrbacek: Convex Powerdomains I. 198-225 BibTeX
Ravi B. Boppana, J. C. Lagarias: One-Way Functions and Circuit Complexity. 226-240 BibTeX
Miklos Santha: On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms. 241-249 BibTeX