Information and Computation -- 1993

Volume 102, Number 1, January 1993

• Stephen L. Bloom, Zoltán Ésik, and Dirk Taubner. Iteration theories of synchronization trees. Information and Computation, 102(1):1-55, January 1993. References and Citations. [BibTeX entry]

• Eric Shade and K. T. Narayana. Real-time semantics for shared-variable concurrency. Information and Computation, 102(1):56-82, January 1993. References. [BibTeX entry]

• A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. The undecidability of the semi-unification problem. Information and Computation, 102(1):83-101, January 1993. Abstract, References, and Citations. [BibTeX entry]

• Gerhard Buntrock, Lane A. Hemachandra, and Dirk Siefkes. Using inductive counting to simulate nondeterministic computation. Information and Computation, 102(1):102-117, January 1993. Abstract, References, Citations, etc. [BibTeX entry]

• Sanjay Jain and Arun Sharma. Learning with the knowledge of an upper bound on program size. Information and Computation, 102(1):118-166, January 1993. Abstract, References, and Citations. [BibTeX entry]

Volume 102, Number 2, February 1993

• A. Prasad Sistla and Lenore D. Zuck. Reasoning in a restricted temporal logic. Information and Computation, 102(2):167-195, February 1993. References and Citations. [BibTeX entry]

• Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. An optimal parallel dictionary. Information and Computation, 102(2):196-217, February 1993. References and Citations. [BibTeX entry]

• Michael Kaufmann and Gerhard Klär. Routing in polygons without rectilinear visible corners. Information and Computation, 102(2):218-262, February 1993. References. [BibTeX entry]

• R. Fleischer, B. P. Sinha, and C. Uhrig. A lower bound for the worst case of Bottom-Up-Heapsort. Information and Computation, 102(2):263-279, February 1993. [BibTeX entry]

• Niall Graham, Frank Harary, Marilynn Livingston, and Quentin F. Stout. Subcube fault-tolerance in hypercubes. Information and Computation, 102(2):280-314, February 1993. References. [BibTeX entry]

Volume 103, Number 1, March 1993

• Amir Pnueli and Lenore D. Zuck. Probabilistic verification. Information and Computation, 103(1):1-29, March 1993. References and Citations. [BibTeX entry]

• Seymour Ginsburg, Dan Simovici, and Xiaoyang Wang. Content-related interval queries on object histories. Information and Computation, 103(1):30-67, March 1993. Abstract, References, and Citations. [BibTeX entry]

• Richard Beigel, William I. Gasarch, John Gill, and James C. Owings. Terse, superterse, and verbose sets. Information and Computation, 103(1):68-85, March 1993. Abstract and Citations. [BibTeX entry]

• Moreno Falaschi, Giorgio Levi, Maurizio Martelli, and Catuscia Palamidessi. A model-theoretic reconstruction of the operational semantics of logic programs. Information and Computation, 103(1):86-113, March 1993. Abstract, References, and Citations. [BibTeX entry]

• José Meseguer and Joseph A. Goguen. Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems. Information and Computation, 103(1):114-158, March 1993. Abstract, References, and Citations. [BibTeX entry]

Volume 103, Number 2, April 1993

• Ludwig Staiger. Kolgomorov complexity and Hausdorff dimension. Information and Computation, 103(2):159-194, April 1993. References and Citations. [BibTeX entry]

• I. Kh. Musikaev and M. A. Taitslin. Limitations of the program memory and the expressive power of dynamic logics. Information and Computation, 103(2):195-203, April 1993. References and Citations. [BibTeX entry]

• L. Aceto and M. Hennessy. Towards action-refinement in process algebras. Information and Computation, 103(2):204-269, April 1993. References and Citations. [BibTeX entry]

• David Peleg. Distance-dependent distributed directories. Information and Computation, 103(2):270-298, April 1993. Abstract, References, and Citations. [BibTeX entry]

• Ronald L. Rivest and Robert E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103(2):299-347, April 1993. Abstract, References, and Citations. [BibTeX entry]

Volume 104, Number 1, May 1993

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

• John Mitchell. Preface. Information and Computation, 104(1):1, May 1993. [BibTeX entry]

• Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, May 1993. References, Citations, etc. [BibTeX entry]

• Rajeev Alur and Thomas Henzinger. Real-time logics: Complexity and expressiveness. Information and Computation, 104(1):35-77, May 1993. References, Citations, etc. [BibTeX entry]

• R. C. Sekar and I. V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. Information and Computation, 104(1):78-109, May 1993. References, Citations, etc. [BibTeX entry]

Regular Article:

• Aart Middeldorp. Modular properties of conditional term rewriting systems. Information and Computation, 104(1):110-158, May 1993. Abstract, References, Citations, etc. [BibTeX entry]

Volume 104, Number 2, June 1993

• David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, and Adi Shamir. On dice and coins: Models of computation for random generation. Information and Computation, 104(2):159-174, June 1993. References and Citations. [BibTeX entry]

• Amos Israeli and Marc Jalfon. Uniform self-stabilizing ring orientation. Information and Computation, 104(2):175-196, June 1993. References and Citations. [BibTeX entry]

• Greg N. Frederickson. An optimal algorithm for selection in a Min-Heap. Information and Computation, 104(2):197-214, June 1993. Abstract, References, and Citations. [BibTeX entry]

• R. K. Shyamasundar, K. T. Narayana, and T. Pitassi. Semantics of nondeterministic asynchronous broadcast networks. Information and Computation, 104(2):215-252, June 1993. References. [BibTeX entry]

• David R. Luginbuhl and Michael C. Loui. Hierarchies and space measures for pointer machines. Information and Computation, 104(2):253-270, June 1993. Abstract and References. [BibTeX entry]

• Ravi Kannan, H. Venkateswaran, V. Vinay, and Andrew C. Yao. A circuit-based proof of Toda's theorem. Information and Computation, 104(2):271-276, June 1993. References and Citations. [BibTeX entry]

• Pavol \v{D}uri\v{s} and Zvi Galil. On the power of multiple reads in a chip. Information and Computation, 104(2):277-287, June 1993. References. [BibTeX entry]

• Judy Goldsmith, Deborah Joseph, and Paul Young. Using self-reducibilities to characterize polynomial time. Information and Computation, 104(2):288-308, June 1993. References. [BibTeX entry]

Volume 105, Number 1, July 1993

• John C. Reynolds and Gordon D. Plotkin. On functors expressible in the polymorphic typed lambda calculus. Information and Computation, 105(1):1-29, July 1993. References and Citations. [BibTeX entry]

• L. S. van Benthem Jutting. Typing in pure type systems. Information and Computation, 105(1):30-41, July 1993. Citations. [BibTeX entry]

• R. Hoofman. Continuous information systems. Information and Computation, 105(1):42-71, July 1993. Citations. [BibTeX entry]

• William I. Gasarch, Lane A. Hemachandra, and Albrecht Hoene. On checking versus evaluation of multiple queries. Information and Computation, 105(1):72-93, July 1993. Abstract and References. [BibTeX entry]

• Hermann Jung, Lefteris M. Kirousis, and Paul Spirakis. Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays. Information and Computation, 105(1):94-104, July 1993. References and Citations. [BibTeX entry]

• Eric Sven Ristad. The anaphora problem. Information and Computation, 105(1):105-131, July 1993. Abstract and References. [BibTeX entry]

• Soma Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 105(1):132-158, July 1993. Abstract, References, Citations, etc. [BibTeX entry]

Volume 105, Number 2, August 1993

• Samson Abramsky and C.-H. Luke Ong. Full abstraction in the lazy lambda calculus. Information and Computation, 105(2):159-267, August 1993. References and Citations. [BibTeX entry]

• Leslie Ann Goldberg. Automating Pólya theory: The computational complexity of the cycle index polynomial. Information and Computation, 105(2):268-288, August 1993. [BibTeX entry]

Volume 106, Number 1, September 1993

• Ronald L. Rivest and Robert H. Sloan. On choosing between experimenting and thinking when learning. Information and Computation, 106(1):1-25, September 1993. References and Citations. [BibTeX entry]

• Erik Palmgren. An information system interpretation of Martin-Löf's partial type theory with universes. Information and Computation, 106(1):26-60, September 1993. References and Citations. [BibTeX entry]

• Christian Choffrut. On the starheight of some rational subsets closed under partial commutations. Information and Computation, 106(1):61-82, September 1993. References. [BibTeX entry]

• Joseph Y.-T. Leung and C. S. Wong. Minimizing the number of late tasks with error constraint. Information and Computation, 106(1):83-108, September 1993. [BibTeX entry]

• Krzysztof R. Apt and Dino Pedreschi. Reasoning about termination of pure prolog programs. Information and Computation, 106(1):109-157, September 1993. References and Citations. [BibTeX entry]

Volume 106, Number 2, October 1993

• Robert Cori, Yves Métivier, and Wies{\l}aw Zielonka. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106(2):159-202, October 1993. References and Citations. [BibTeX entry]

• Kimio Kawaguchi and Koichi Wada. New results in graph routing. Information and Computation, 106(2):203-233, October 1993. References and Citations. [BibTeX entry]

• Ricardo A. Baeza-Yates, Joseph C. Culberson, and Gregory J. E. Rawlins. Searching in the plane. Information and Computation, 106(2):234-252, October 1993. Abstract, References, and Citations. [BibTeX entry]

• Rodney R. Howell, Petr Jan\v{c}ar, and Louis E. Rosier. Completeness results for single-path Petri nets. Information and Computation, 106(2):253-265, October 1993. Abstract and References. [BibTeX entry]

• Omer Berkman and Uzi Vishkin. On parallel integer merging. Information and Computation, 106(2):266-285, October 1993. References and Citations. [BibTeX entry]

• S. Meiser. Point location in arrangements of hyperplanes. Information and Computation, 106(2):286-303, October 1993. References and Citations. [BibTeX entry]

Volume 107, Number 1, November 1993

• Michael T. Goodrich, Mikhail J. Atallah, and Mark H. Overmars. Output-sensitive methods for rectilinear hidden surface removal. Information and Computation, 107(1):1-24, November 1993. References, Citations, etc. [BibTeX entry]

• P. W. O'Hearn and R. D. Tennent. Semantical analysis of specification logic, 2. Information and Computation, 107(1):25-57, November 1993. Abstract, References, and Citations. [BibTeX entry]

• Joachim Parrow. Structural and behavioural equivalences of networks. Information and Computation, 107(1):58-90, November 1993. References, Citations, etc. [BibTeX entry]

• Leszek Pacholski and Wies{\l}aw Szwast. A counterexample to the 0-1 law for the class of existential second-order minimal Gödel sentences with equality. Information and Computation, 107(1):91-103, November 1993. References. [BibTeX entry]

• Jan Kuper. An axiomatic theory for partial functions. Information and Computation, 107(1):104-150, November 1993. Citations. [BibTeX entry]

• Nils Klarlund and Fred B. Schneider. Proving nondeterministically specified safety properties using progress measures. Information and Computation, 107(1):151-170, November 1993. Abstract, References, and Citations. [BibTeX entry]

Volume 107, Number 2, December 1993

• James E. Burns and Nancy A. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2):171-184, December 1993. References and Citations. [BibTeX entry]

• Jeanne Devolder. Precircular codes and periodic biinfinite words. Information and Computation, 107(2):185-201, December 1993. Citations. [BibTeX entry]

• M. Hennessy and A. Ingólfsdóttir. A theory of communicating processes with value passing. Information and Computation, 107(2):202-236, December 1993. References and Citations. [BibTeX entry]

• R\=usi\c{n}\u{s} Freivalds and Carl H. Smith. On the role of procrastination in machine learning. Information and Computation, 107(2):237-271, December 1993. Abstract, References, and Citations. [BibTeX entry]

• Bengt Jonsson and Joachim Parrow. Deciding bisimulation equivalences for a class of Non-Finite-State programs. Information and Computation, 107(2):272-302, December 1993. References and Citations. [BibTeX entry]

• Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen. Computing ML equality kinds using abstract interpretation. Information and Computation, 107(2):303-323, December 1993. [BibTeX entry]

Shortcuts: