Information and Computation -- 1988

Volume 76, Number 1, January 1988

• Paul G. Spirakis. Optimal parallel randomized algorithms for addition sparse addition and identification. Information and Computation, 76(1):1-12, January 1988. Citations. [BibTeX entry]

• Paul Beame. Limits on the power of concurrent-write parallel machines. Information and Computation, 76(1):13-28, January 1988. Citations. [BibTeX entry]

• Flemming Nielson. Strictness analysis and denotational abstract interpretation. Information and Computation, 76(1):29-92, January 1988. Citations. [BibTeX entry]

Volume 76, Numbers 2/3, February/March 1988

Special Issue: Semantics of Data Types. Gordon D. Plotkin, Special Issue Editor

• G. D. Plotkin. Preface. Information and Computation, 76(2/3):93, February/March 1988. [BibTeX entry]

• Thierry Coquand and Gérard Huet. The calculus of constructions. Information and Computation, 76(2/3):95-120, February/March 1988. References and Citations. [BibTeX entry]

• Peter Padawitz. The equational theory of parameterized specifications. Information and Computation, 76(2/3):121-137, February/March 1988. [BibTeX entry]

• Luca Cardelli. A semantics of multiple inheritance. Information and Computation, 76(2/3):138-164, February/March 1988. References and Citations. [BibTeX entry]

• Donald Sannella and Andrzej Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76(2/3):165-210, February/March 1988. Abstract and Citations. [BibTeX entry]

• John C. Mitchell. Polymorphic type inference and containment. Information and Computation, 76(2/3):211-249, February/March 1988. References and Citations. [BibTeX entry]

• Eugenio Moggi. Partial morphisms in categories of effective objects. Information and Computation, 76(2/3):250-277, February/March 1988. Citations. [BibTeX entry]

• B. Lampson and R. Burstall. Pebble, a kernel language for modules and abstract data types. Information and Computation, 76(2/3):278-346, February/March 1988. Citations. [BibTeX entry]

Volume 77, Number 1, April 1988

• Jennifer Lundelius Welch and Nancy A. Lynch. A new fault-tolerance algorithm for clock synchronization. Information and Computation, 77(1):1-36, April 1988. Abstract and Citations. [BibTeX entry]

• Amihood Amir and William I. Gasarch. Polynomial terse sets. Information and Computation, 77(1):37-56, April 1988. Abstract, References, and Citations. [BibTeX entry]

• Larry E. Stanfel. Mathematical optimization and the synchronizing properties of encodings. Information and Computation, 77(1):57-76, April 1988. References. [BibTeX entry]

• Leonard Pitt and Carl H. Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77(1):77-92, April 1988. Abstract, References, and Citations. [BibTeX entry]

Volume 77, Number 2, May 1988

• Cees Slot and Peter van Emde Boas. The problem of space invariance for sequential machines. Information and Computation, 77(2):93-122, May 1988. References and Citations. [BibTeX entry]

• Bhaskar Bagchi and N. S. Narasimha Sastry. One-step completely orthogonalizable codes from generalized quadrangles. Information and Computation, 77(2):123-130, May 1988. References. [BibTeX entry]

• Wil Dekkers. Reducibility of types in typed lambda calculus: Comment on a paper by Richard Statman. Information and Computation, 77(2):131-137, May 1988. [BibTeX entry]

• Daniel N. Osherson, Michael Stob, and Scott Weinstein. Synthesizing inductive expertise. Information and Computation, 77(2):138-161, May 1988. References and Citations. [BibTeX entry]

• Bernd Becker and Hans-Ulrich Simon. How robust is the n-cube? Information and Computation, 77(2):162-178, May 1988. Citations. [BibTeX entry]

Volume 77, Number 3, June 1988

• T. H. Westerdale. An automaton decomposition for learning system environments. Information and Computation, 77(3):179-191, June 1988. [BibTeX entry]

• Stavros Cosmadakis. The word and generator problems for lattices. Information and Computation, 77(3):192-217, June 1988. Citations. [BibTeX entry]

• H. Edelsbrunner and F. P. Preparata. Minimum polygonal separation. Information and Computation, 77(3):218-232, June 1988. Citations. [BibTeX entry]

• Christiane Frougny. Linear numeration systems of order two. Information and Computation, 77(3):233-259, June 1988. References and Citations. [BibTeX entry]

Volume 78, Number 1, July 1988

• B. Courcelle and P. Deransart. Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming. Information and Computation, 78(1):1-55, July 1988. References. [BibTeX entry]

• Ming Li and Paul M. B. Vitányi. Tape versus queue and stacks: The lower bounds. Information and Computation, 78(1):56-85, July 1988. Abstract, References, and Citations. [BibTeX entry]

Volume 78, Number 2, August 1988

• Alan L. Selman. Promise problems complete for complexity classes. Information and Computation, 78(2):87-97, August 1988. Abstract, References, and Citations. [BibTeX entry]

• László Babai, Bettina Just, and Friedhelm Meyer auf der Heide. On the limits of computations with the floor function. Information and Computation, 78(2):99-107, August 1988. Citations. [BibTeX entry]

• Kevin J. Compton. The computational complexity of asymptotic problems I: Partial orders. Information and Computation, 78(2):108-123, August 1988. References and Citations. [BibTeX entry]

• Kosaburo Hashiguchi. Algorithms for determining relative star height and star height. Information and Computation, 78(2):124-169, August 1988. References and Citations. [BibTeX entry]

Volume 78, Number 3, September 1988

• Toshiya Itoh and Shigeo Tsujii. A fast algorithm for computing multiplicative inverses in GF(2^m) using normal bases. Information and Computation, 78(3):171-177, September 1988. Citations. [BibTeX entry]

• Sophocles Ephremidis, Christos H. Papadimitriou, and Martha Sideris. Complexity characterizations of attribute grammar languages. Information and Computation, 78(3):178-186, September 1988. [BibTeX entry]

• Heiko Vogler. The OI-hierarchy is closed under control. Information and Computation, 78(3):187-204, September 1988. References and Citations. [BibTeX entry]

• J. C. M. Baeten and J. A. Bergstra. Global renaming operators in concrete process algebra. Information and Computation, 78(3):205-245, September 1988. Abstract, References, and Citations. [BibTeX entry]

• Susan Landau. Some remarks on computing the square parts of integers. Information and Computation, 78(3):246-253, September 1988. References. [BibTeX entry]

Volume 79, Number 1, October 1988

• Allen Van Gelder. A satisfiability tester for non-clausal propositional calculus. Information and Computation, 79(1):1-21, October 1988. [BibTeX entry]

• M. Teresa Hortalá-González, Francisca Lucio-Carrasco, and Mario Rodríguez-Artalejo. Some general incompleteness results for partial correctness logics. Information and Computation, 79(1):22-42, October 1988. References. [BibTeX entry]

• Alon Itai and Michael Rodeh. The multi-tree approach to reliability in distributed networks. Information and Computation, 79(1):43-59, October 1988. Citations. [BibTeX entry]

• David B. Benson and Ofer Ben-Shachar. Bisimulation of automata. Information and Computation, 79(1):60-83, October 1988. References and Citations. [BibTeX entry]

• Martin Beaudry. Membership testing in commutative transformation semigroups. Information and Computation, 79(1):84-93, October 1988. Abstract, References, and Citations. [BibTeX entry]

Volume 79, Number 2, November 1988

• E. Robinson and G. Rosolini. Categories of partial maps. Information and Computation, 79(2):95-130, November 1988. Citations. [BibTeX entry]

• Ran Rinat, Nissim Francez, and Orna Grumberg. Infinite trees, markings and well-foundedness. Information and Computation, 79(2):131-154, November 1988. References and Citations. [BibTeX entry]

• Elena Stöhr. A trade-off between page number and page width of book embeddings of graphs. Information and Computation, 79(2):155-162, November 1988. [BibTeX entry]

• Haralampos Tsaknakis and P. Papantoni-Kazakos. Outlier resistent filtering and smoothing. Information and Computation, 79(2):163-192, November 1988. References and Citations. [BibTeX entry]

Volume 79, Number 3, December 1988

• Mark Fulk. Saving the phenomena: Requirements that inductive inference machines not contradict known data. Information and Computation, 79(3):193-209, December 1988. References and Citations. [BibTeX entry]

• R. Koymans, R. K. Shyamasundar, W. P. de Roever, R. Gerth, and S. Arun-Kumar. Compositional semantics for real-time distributed computing. Information and Computation, 79(3):210-256, December 1988. Citations. [BibTeX entry]

• E. A. Trachtenberg. Fault tolerant computing and reliable communication: A unified approach. Information and Computation, 79(3):257-279, December 1988. References. [BibTeX entry]

Shortcuts: