Information and Computation, Volume 83

Volume 83, Number 1, 1989

Jonathan S. Turner: Approximation Algorithms for the Shortest Common Superstring Problem. 1-20 BibTeX
Toshiya Itoh, Shigeo Tsujii: Structure of Parallel Multipliers for a Class of Fields GF(2^m). 21-40 BibTeX
Maurice Nivat, Ahmed Saoudi: Automata on Infinite Objects and Their Applications to Logic and Programming. 41-64 BibTeX
Bernd Voigt, Ingo Wegener: Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple. 65-79 BibTeX
Rudolf Ahlswede, Zhen Zhang: Coding for Write-Efficient Memory. 80-97 BibTeX
Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap: Finding Minimal Convex Nested Polygons. 98-110 BibTeX
Vladimir Estivill-Castro, Derick Wood: A New Measure of Presortedness. 111-119 BibTeX

Neil Immerman, Dexter Kozen: Definability with Bounded Number of Bound Variables. 121-139 BibTeX
André Arnold, Srecko Brlek: Optimal Word Chains for the Thue-Morse Word. 140-151 BibTeX
Pierre America, Jaco de Bakker, Joost N. Kok, Jan J. M. M. Rutten: Denotational Semantics of a Parallel Object-Oriented Language. 152-205 BibTeX
Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas: Maintaining Multiple Representations of Dynamic Data Structures. 206-233 BibTeX
Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha: On the Power of Concurrent-Write PRAMs With Read-Only Memory. 234-244 BibTeX
Yongkyun Cho, Seymour Ginsburg: Decision Problems of Object histories. 245-263 BibTeX

Steven M. German, Edmund M. Clarke, Joseph Y. Halpern: Reasoning about Procedures as Parameters in the Language L4. 265-359 BibTeX