Information and Control -- 1984

Volume 60, Numbers 1-3, January/February/March 1984

• Pavol D\=uri\=s, Zvi Galil, Wolfgang Paul, and Ruediger Reischuk. Two nonlinear lower bounds for on-line computations. Information and Control, 60(1-3):1-11, January/February/March 1984. Citations. [BibTeX entry]

• Jerzy Tiuryn. Unbounded program memory adds to the expressive power of first-order programming logic. Information and Control, 60(1-3):12-35, January/February/March 1984. Citations, etc. [BibTeX entry]

• M. Falaschi, G. Levi, and C. Palamidessi. A synchronization logic: Axiomatics and formal semantics of generalized Horn clauses. Information and Control, 60(1-3):36-69, January/February/March 1984. Abstract and References. [BibTeX entry]

• Michael C. Loui. The complexity of sorting on distributed systems. Information and Control, 60(1-3):70-85, January/February/March 1984. [BibTeX entry]

• D. Harel and D. Peleg. On static logics, dynamic logics, and complexity classes. Information and Control, 60(1-3):86-102, January/February/March 1984. Abstract and Citations. [BibTeX entry]

• Eljas Soisalon-Soininen and Peter Widmayer. On the complexity of concurrency control by locking in distributed database systems. Information and Control, 60(1-3):103-108, January/February/March 1984. [BibTeX entry]

• J. A. Bergstra and J. W. Klop. Process algebra for synchronous communication. Information and Control, 60(1-3):109-137, January/February/March 1984. Citations. [BibTeX entry]

• R. J. R. Back and H. Mannila. A semantic approach to program modularity. Information and Control, 60(1-3):138-167, January/February/March 1984. [BibTeX entry]

• P. Papantoni-Kazakos. A game theoretic approach to robust filtering. Information and Control, 60(1-3):168-191, January/February/March 1984. Citations. [BibTeX entry]

Volume 61, Number 1, April 1984

• E. G. Coffman, Jr. and E. N. Gilbert. Dynamic, first-fit packings in two or more dimensions. Information and Control, 61(1):1-14, April 1984. [BibTeX entry]

• Leonid A. Levin. Randomness conservation inequalities; information and independence in mathematical theories. Information and Control, 61(1):15-37, April 1984. Citations. [BibTeX entry]

• C. Mohan, D. Fussell, and A. Silberschatz. Compatibility and commutativity of lock modes. Information and Control, 61(1):38-64, April 1984. [BibTeX entry]

• Yuri Gurevich and Harry R. Lewis. A logic for constant-depth circuits. Information and Control, 61(1):65-74, April 1984. Abstract and Citations. [BibTeX entry]

Volume 61, Number 2, May 1984

• Catriel Beeri and Moshe Y. Vardi. On acyclic database decompositions. Information and Control, 61(2):75-84, May 1984. References. [BibTeX entry]

• P. S. Thiagarajan and K. Vos. A fresh look at free choice nets. Information and Control, 61(2):85-113, May 1984. References and Citations. [BibTeX entry]

• Ernst E. Doberkat. An average case analysis of Floyd's algorithm to construct heaps. Information and Control, 61(2):114-131, May 1984. References and Citations. [BibTeX entry]

• G. L. Feng and K. K. Tzeng. On quasi-perfect property of double-error-correcting goppa codes and their complete decoding. Information and Control, 61(2):132-146, May 1984. References. [BibTeX entry]

• Peter H. Schmitt. Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem. Information and Control, 61(2):147-158, May 1984. References. [BibTeX entry]

• Shimon Even, Alan L. Selman, and Yacov Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, 61(2):159-173, May 1984. References and Citations. [BibTeX entry]

• Susumu Yamasaki and Shuji Doshita. Erratum: The satisfiability problem for a class consisting of Horn sentences and non-Horn sentences in proportional logic. Information and Control, 61(2):174, May 1984. References. [BibTeX entry]

Volume 61, Number 3, June 1984

• E. Allen Emerson and A. Prasad Sistla. Deciding full branching time logic. Information and Control, 61(3):175-201, June 1984. Citations. [BibTeX entry]

• Manfred Broy. Semantics of communicating processes. Information and Control, 61(3):202-246, June 1984. [BibTeX entry]

• Damian Niwi\'nski. Fixed-point characterization of context-free \infty-languages. Information and Control, 61(3):247-276, June 1984. Citations. [BibTeX entry]

Volume 62, Number 1, July 1984

• H. A. G. Wijshoff and J. van Leeuwen. Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino. Information and Control, 62(1):1-25, July 1984. [BibTeX entry]

• Yair Itzhaik and Amiram Yehudai. An intermediate machine technique for deciding equivalence between a DPDA and a linear DPDA. Information and Control, 62(1):26-35, July 1984. [BibTeX entry]

• Paola Giannini and Giuseppe Longo. Effectively given domains and lambda-calculus models. Information and Control, 62(1):36-63, July 1984. Citations. [BibTeX entry]

• R. E. Krichevsky. Optimal hashing. Information and Control, 62(1):64-92, July 1984. Citations. [BibTeX entry]

Volume 62, Numbers 2/3, August/September 1984

• Richard E. Ladner, Larry J. Stockmeyer, and Richard J. Lipton. Alternation bounded auxiliary pushdown automata. Information and Control, 62(2/3):93-108, August/September 1984. Abstract. [BibTeX entry]

• Jia-Wei Hong. On similarity and duality of computation (I). Information and Control, 62(2/3):109-128, August/September 1984. Citations. [BibTeX entry]

• Ingo Wegener. Optimal decision trees and one-time-only branching programs for symmetric Boolean functions. Information and Control, 62(2/3):129-143, August/September 1984. Citations. [BibTeX entry]

• Michael G. Main and David B. Benson. Functional behvior of nondeterministic and concurrent programs. Information and Control, 62(2/3):144-189, August/September 1984. Citations. [BibTeX entry]

• Jennifer Lundelius and Nancy Lynch. An upper and lower bound for clock synchronization. Information and Control, 62(2/3):190-204, August/September 1984. Abstract and Citations. [BibTeX entry]

• Harvey Friedman. On the spectra of universal relational sentences. Information and Control, 62(2/3):205-209, August/September 1984. [BibTeX entry]

• J. Ian Munro and Patricio V. Poblete. Fault tolerance and storage reduction in binary search trees. Information and Control, 62(2/3):210-218, August/September 1984. Citations. [BibTeX entry]

Volume 63, Numbers 1/2, October/November 1984

• Benjamin Arazi. An approach for generating different types of gray codes. Information and Control, 63(1/2):1-10, October/November 1984. [BibTeX entry]

• Yishai A. Feldman. A decidable propositional dynamic logic with explicit probabilities. Information and Control, 63(1/2):11-38, October/November 1984. Citations. [BibTeX entry]

• Richard Cole and Chee K. Yap. Geometric retrieval problems. Information and Control, 63(1/2):39-57, October/November 1984. [BibTeX entry]

• Paliath Narendran, Friedrich Otto, and Karl Winklmann. The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-complete. Information and Control, 63(1/2):58-66, October/November 1984. [BibTeX entry]

• J. M. Robson. Fast probabilistic RAM simulation of single tape Turing machine computations. Information and Control, 63(1/2):67-87, October/November 1984. Citations. [BibTeX entry]

• A. P. Sistla, E. M. Clarke, N. Francez, and A. R. Meyer. Can message buffers be axiomatized in linear temporal logic? Information and Control, 63(1/2):88-112, October/November 1984. Abstract, References, and Citations. [BibTeX entry]

• H. C. M. Kleijn, M. Penttonen, G. Rozenberg, and K. Salomaa. Direction independent context-sensitive grammars. Information and Control, 63(1/2):113-117, October/November 1984. [BibTeX entry]

• David Harel and Dexter Kozen. A programming language for the inductive sets, and applications. Information and Control, 63(1/2):118-139, October/November 1984. Abstract and Citations. [BibTeX entry]

Volume 63, Number 3, December 1984

• Ralf Hartmut Güting. Dynamic C-oriented polygonal intersections searching. Information and Control, 63(3):143-163, December 1984. [BibTeX entry]

• D. S. Franzblau and D. J. Kleitman. An algorithm for covering polygons with rectangles. Information and Control, 63(3):164-189, December 1984. [BibTeX entry]

• Andrzej Ehrenfeucht and Grzegorz Rozenberg. An easy proof of Greibach normal form. Information and Control, 63(3):190-199, December 1984. Citations. [BibTeX entry]

• M. G. Gouda, E. G. Manning, and Y. T. Yu. On the progress of communications between two finite state machines. Information and Control, 63(3):200-216, December 1984. Citations. [BibTeX entry]

• M. Ajtai, M. Fredman, and J. Komlòs. Hash functions for priority queues. Information and Control, 63(3):217-225, December 1984. Citations. [BibTeX entry]

Shortcuts: