Information and Computation -- 1990

Volume 84, Number 1, January 1990

• George Georgakopoulos and Dimitris Kavadias. The banker's problem with precedences. Information and Computation, 84(1):1-12, January 1990. [BibTeX entry]

• Samir Khuller. Extending planar graph algorithms to K_{3,3}-free graphs. Information and Computation, 84(1):13-25, January 1990. References. [BibTeX entry]

• Dieter Spreen. Computable one-to-one enumerations of effective domains. Information and Computation, 84(1):26-46, January 1990. [BibTeX entry]

• Azeddine Lazrek, Pierre Lescanne, and Jean-Jacques Thiel. Tools for proving inductive equalities, relative completeness, and omega-completeness. Information and Computation, 84(1):47-70, January 1990. Abstract, References, and Citations. [BibTeX entry]

• Torben Hagerup. Optimal parallel algorithms on planar graphs. Information and Computation, 84(1):71-96, January 1990. Abstract, References, and Citations. [BibTeX entry]

• Yehuda Afek, Gad M. Landau, Baruch Schieber, and Moti Yung. The power of multimedia: Combining point-to-point and multiaccess networks. Information and Computation, 84(1):97-118, January 1990. References and Citations. [BibTeX entry]

• Jin-yi Cai. A note on the determinant and permanent problem. Information and Computation, 84(1):119-127, January 1990. Citations. [BibTeX entry]

Volume 84, Number 2, February 1990

• Pierre America and Frank de Boer. Proving total correctness of recursive procedures. Information and Computation, 84(2):129-162, February 1990. [BibTeX entry]

• Joost Engelfriet and Grzegorz Rozenberg. A comparison of boundary graph grammars and context-free hypergraph grammars. Information and Computation, 84(2):163-206, February 1990. References and Citations. [BibTeX entry]

• Shojiro Sakata. Extension of the Berlekamp-Massey algorithm to N dimensions. Information and Computation, 84(2):207-239, February 1990. References. [BibTeX entry]

Volume 85, Number 1, March 1990

• Mark A. Fulk. Prudence and other conditions on formal language learning. Information and Computation, 85(1):1-11, March 1990. References and Citations. [BibTeX entry]

• Bruno Courcelle. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation, 85(1):12-75, March 1990. References and Citations. [BibTeX entry]

• Kim B. Bruce, Albert R. Meyer, and John C. Mitchell. The semantics of second-order lambda calculus. Information and Computation, 85(1):76-134, March 1990. Abstract, References, and Citations. [BibTeX entry]

Volume 85, Number 2, April 1990

• Robert Tennent. Semantical analysis of specification logic. Information and Computation, 85(2):135-162, April 1990. Abstract and Citations. [BibTeX entry]

• Christoph Meinel. Polynomial size \Omega-branching programs and their computational power. Information and Computation, 85(2):163-182, April 1990. References. [BibTeX entry]

• Michael Conner. Sequential machines realized by group representations. Information and Computation, 85(2):183-201, April 1990. References and Citations. [BibTeX entry]

• D. J. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-241, April 1990. References and Citations. [BibTeX entry]

Volume 86, Number 1, May 1990

• Chien-I Chang, Simon C. Fan, and Lee D. Davisson. On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels. Information and Computation, 86(1):1-13, May 1990. [BibTeX entry]

• Deepak Kapur, Paliath Narendran, and Friedrich Otto. On ground-confluence of term rewriting systems. Information and Computation, 86(1):14-31, May 1990. References. [BibTeX entry]

• C. J. Ash, T. E. Hall, and J. E. Pin. On the varieties of languages associated with some varieties of finite monoids with commuting idempotents. Information and Computation, 86(1):32-42, May 1990. Citations. [BibTeX entry]

• Paris C. Kanellakis and Scott A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43-68, May 1990. References and Citations. [BibTeX entry]

• Jörg-Rüdiger Sack and Thomas Strothotte. A characterization of heaps and its applications. Information and Computation, 86(1):69-86, May 1990. [BibTeX entry]

• Hans L. Bodlaender. The complexity of finding uniform emulations on paths and ring networks. Information and Computation, 86(1):87-106, May 1990. References and Citations. [BibTeX entry]

• Bruce E. Litow. Parallel complexity of the regular code problem. Information and Computation, 86(1):107-114, May 1990. References. [BibTeX entry]

Volume 86, Number 2, June 1990

• Andrea Asperti. Stability and computability in coherent domains. Information and Computation, 86(2):115-139, June 1990. References and Citations. [BibTeX entry]

• Greg N. Frederickson. A distributed shortest path algorithm for a planar network. Information and Computation, 86(2):140-159, June 1990. Abstract. [BibTeX entry]

• Eric Allender and Osamu Watanabe. Kolmogorov complexity and degrees of tally sets. Information and Computation, 86(2):160-178, June 1990. Abstract and Citations. [BibTeX entry]

• Jonathan Goldstine, C. M. R. Kintala, and Detlef Wotschke. On measuring nondeterminism in regular languages. Information and Computation, 86(2):179-194, June 1990. Citations. [BibTeX entry]

• Z. Fülöp and S. Vágvölgyi. A complete rewriting system for a monoid of tree transformation classes. Information and Computation, 86(2):195-212, June 1990. References and Citations. [BibTeX entry]

Volume 87, Numbers 1/2, July/August 1990

Special Issue: Selections from 1988 IEEE Symposium on Logic in Computer Science

• Yuri Gurevich. Preface. Information and Computation, 87(1/2):1, July/August 1990. [BibTeX entry]

• Glynn Winskel. A compositional proof system on a category of labelled transition systems. Information and Computation, 87(1/2):2-57, July/August 1990. References, Citations, etc. [BibTeX entry]

• Rance Cleaveland and Matthew Hennessy. Priorities in process algebras. Information and Computation, 87(1/2):58-77, July/August 1990. Abstract, References, Citations, etc. [BibTeX entry]

• Ronald Fagin, Joseph Y. Halpern, and Nimrod Megiddo. A logic for reasoning about probabilities. Information and Computation, 87(1/2):78-128, July/August 1990. Abstract, References, Citations, etc. [BibTeX entry]

• Jean Gallier, Paliath Narendran, David Plaisted, and Wayne Snyder. Rigid E-unification: NP-completeness and applications to equational matings. Information and Computation, 87(1/2):129-195, July/August 1990. Citations, etc. [BibTeX entry]

• Kim B. Bruce and Giuseppe Longo. A modest model of records, inheritance and bounded quantification. Information and Computation, 87(1/2):196-239, July/August 1990. References, Citations, etc. [BibTeX entry]

• Kevin J. Compton and Claude Laflamme. An algebra and a logic for NC^1. Information and Computation, 87(1/2):240-262, July/August 1990. References, Citations, etc. [BibTeX entry]

• Bard Bloom. Can LCF be topped? Flat lattice models of typed lambda-calculus. Information and Computation, 87(1/2):263-300, July/August 1990. References, Citations, etc. [BibTeX entry]

• Phokion Kolaitis and Moshe Vardi. 0-1 laws and decision problems for fragments of second-order logic. Information and Computation, 87(1/2):301-337, July/August 1990. References, Citations, etc. [BibTeX entry]

Volume 88, Number 1, September 1990

• Bala Kalyanasundaram and Georg Schnitger. Rounds versus time for the two person pebble game. Information and Computation, 88(1):1-17, September 1990. [BibTeX entry]

• Maryse Pelletier and Jacques Sakarovitch. Easy multiplications II. extensions of rational semigroups. Information and Computation, 88(1):18-59, September 1990. References and Citations. [BibTeX entry]

• Alon Itai and Michael Rodeh. Symmetry breaking in distributed networks. Information and Computation, 88(1):60-87, September 1990. References and Citations. [BibTeX entry]

• Ramamohan Paturi, Joel I. Seiferas, Janos Simon, and Richard E. Newman-Wolfe. Milking the Aanderaa argument. Information and Computation, 88(1):88-104, September 1990. References and Citations. [BibTeX entry]

Volume 88, Number 2, October 1990

• José Meseguer and Ugo Montanari. Petri nets are monoids. Information and Computation, 88(2):105-155, October 1990. References and Citations. [BibTeX entry]

• Cynthia Dwork and Yoram Moses. Knowledge and common knowledge in a Byzantine environment: Crash failures. Information and Computation, 88(2):156-186, October 1990. Citations. [BibTeX entry]

• Max Dauchet, Thierry Heuillard, Pierre Lescanne, and Sophie Tison. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation, 88(2):187-201, October 1990. Citations, etc. [BibTeX entry]

Volume 89, Number 1, November 1990

• Mads Tofte. Type inference for polymorphic references. Information and Computation, 89(1):1-34, November 1990. Citations. [BibTeX entry]

• Marek Zaionc. A characterezation of lambda definable tree operations. Information and Computation, 89(1):35-46, November 1990. [BibTeX entry]

• Rudolf Ahlswede, Jian ping Ye, and Zhen Zhang. Creating order in sequence spaces with simple machines. Information and Computation, 89(1):47-94, November 1990. [BibTeX entry]

Volume 89, Number 2, December 1990

• Daniel Leivant. Inductive definitions over finite structures. Information and Computation, 89(2):95-108, December 1990. References and Citations. [BibTeX entry]

• David A. Mix Barrington, Howard Straubing, and Denis Thérien. Non-uniform automata over groups. Information and Computation, 89(2):109-132, December 1990. References and Citations. [BibTeX entry]

• Bogdan S. Chlebus. Turing machines with access to history. Information and Computation, 89(2):133-143, December 1990. [BibTeX entry]

• Alain Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144-179, December 1990. Citations. [BibTeX entry]

• Hai-Ning Liu, C. Wrathall, and Kenneth Zeger. Efficient solution to some problems in free partially commutative monoids. Information and Computation, 89(2):180-198, December 1990. Citations. [BibTeX entry]

Shortcuts: