Information and Control -- 1983

Volume 56, Numbers 1/2, January/February 1983

• Gary L. Miller. Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus. Information and Control, 56(1/2):1-20, January/February 1983. References and Citations. [BibTeX entry]

• Gary L. Miller. Isomorphism of graphs which are pairwise k-separable. Information and Control, 56(1/2):21-33, January/February 1983. References and Citations. [BibTeX entry]

• Burchard von Braunmühl, Stephen Cook, Kurt Mehlhorn, and Rutger Verbeek. The recognition of deterministic CFL's in small time and space. Information and Control, 56(1/2):34-51, January/February 1983. References and Citations. [BibTeX entry]

• Martin D. Davis and Elaine J. Weyuker. A formal notion of program-based test data adequacy. Information and Control, 56(1/2):52-71, January/February 1983. References. [BibTeX entry]

• Pierre Wolper. Temporal logic can be more expressive. Information and Control, 56(1/2):72-99, January/February 1983. References and Citations. [BibTeX entry]

• John Case. Pseudo-extending computable functions. Information and Control, 56(1/2):100-111, January/February 1983. References and Citations. [BibTeX entry]

• Albert R. Meyer and John C. Mitchell. Termination assertions for recursive programs: Completeness and axiomatic definability. Information and Control, 56(1/2):112-138, January/February 1983. Abstract and References. [BibTeX entry]

Volume 56, Number 3, March 1983

• Karel Culik II and Arto Salomaa. Ambiguity and decision problems concerning number systems. Information and Control, 56(3):139-153, March 1983. References and Citations. [BibTeX entry]

• John C. Mitchell. The implication problem for functional and inclusion dependencies. Information and Control, 56(3):154-173, March 1983. References and Citations. [BibTeX entry]

• Uzi Vishkin and Avi Wigderson. Dynamic parallel memories. Information and Control, 56(3):174-182, March 1983. References. [BibTeX entry]

• Hana Galperin and Avi Wigderson. Succinct representations of graphs. Information and Control, 56(3):183-198, March 1983. References and Citations. [BibTeX entry]

• H. S. Witsenhausen and A. D. Wyner. On storage meda with aftereffects. Information and Control, 56(3):199-211, March 1983. References and Citations. [BibTeX entry]

• Pawel Urzyczyn. A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs. Information and Control, 56(3):212-219, March 1983. References and Citations. [BibTeX entry]

Volume 57, Number 1, April 1983

• Tsutomu Maimiura. Tree automata and attribute grammars. Information and Control, 57(1):1-20, April 1983. References. [BibTeX entry]

• Dung T. Huynh. Commutative grammars: The complexity of uniform word problems. Information and Control, 57(1):21-39, April 1983. References and Citations. [BibTeX entry]

• Stuart A. Kurtz. On the random oracle hypothesis. Information and Control, 57(1):40-47, April 1983. References and Citations. [BibTeX entry]

• A. P. Stolboushkin and M. A. Taitslin. Deterministic dynamic logic is strictly weaker than dynamic logic. Information and Control, 57(1):48-55, April 1983. References and Citations. [BibTeX entry]

• Joseph Y. Halpern. Deterministic process logic is elementary. Information and Control, 57(1):56-89, April 1983. Abstract, References, Citations, etc. [BibTeX entry]

Volume 57, Numbers 2/3, May/June 1983

• Larry Stockmeyer. Optimal orientations of cells in slicing floorplan designs. Information and Control, 57(2/3):91-101, May/June 1983. Abstract and Citations. [BibTeX entry]

• William G. Golson and William C. Rounds. Connections between two theories of concurrency: Metric spaces and synchronization trees. Information and Control, 57(2/3):102-124, May/June 1983. References and Citations. [BibTeX entry]

• U. Goltz and W. Resig. The non-sequential behavior of Petri nets. Information and Control, 57(2/3):125-147, May/June 1983. References and Citations. [BibTeX entry]

• Mitchell Wand. Loops in combinator-based compilers. Information and Control, 57(2/3):148-164, May/June 1983. Abstract, References, Citations, etc. [BibTeX entry]

• L. Csirmaz. On the strength of ``sometimes'' and ``always'' in program verification. Information and Control, 57(2/3):165-179, May/June 1983. References. [BibTeX entry]

• Etienne Grandjean. Complexity of the first-order theory of almost all finite structures. Information and Control, 57(2/3):180-204, May/June 1983. References and Citations. [BibTeX entry]

• Antonio Restivo and Christophe Reutenauer. Some applications of a theorem of Shirshov to language theory. Information and Control, 57(2/3):205-213, May/June 1983. References. [BibTeX entry]

Volume 58, Numbers 1-3, July/August/September 1983

• Aivar A. Lorenc and J\=anis K. Lapi\c{n}\v{s}. Discrete random process stabilization. Information and Control, 58(1-3):1-18, July/August/September 1983. References. [BibTeX entry]

• Jean-Marc Steyaert and Philippe Flajolet. Patterns and pattern-matching in trees: An analysis. Information and Control, 58(1-3):19-58, July/August/September 1983. References and Citations. [BibTeX entry]

• Pawe{\l} Urzyczyn. Nontrivial definability by flow-chart programs. Information and Control, 58(1-3):59-87, July/August/September 1983. References and Citations. [BibTeX entry]

• W. Ian Gasarch and Steven Homer. Relativizations comparing NP and exponential time. Information and Control, 58(1-3):88-100, July/August/September 1983. Abstract, References, and Citations. [BibTeX entry]

• Stavros Cosmadakis. The complexity of evaluating relational queries. Information and Control, 58(1-3):101-112, July/August/September 1983. References. [BibTeX entry]

• A. Borodin, S. Cook, and N. Pippenger. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control, 58(1-3):113-136, July/August/September 1983. References and Citations. [BibTeX entry]

• Kurt Mehlhorn and Franco P. Preparata. Area-time optimal VLSI integer multiplier with minimum computation time. Information and Control, 58(1-3):137-156, July/August/September 1983. References. [BibTeX entry]

• Ker-I Ko. On the computational complexity of ordinary differential equations. Information and Control, 58(1-3):157-194, July/August/September 1983. References and Citations. [BibTeX entry]

• H. S. Witsenhausen and A. D. Wyner. Erratum: On storage media with aftereffects. Information and Control, 58(1-3):195, July/August/September 1983. References. [BibTeX entry]

Volume 59, Numbers 1-3, October/November/December 1983

• Susumu Yamasaki and Shuji Doshita. The satisfiability problem for a class consisting of Horn sentences and some non-Horn sentences in proportional logic. Information and Control, 59(1-3):1-12, October/November/December 1983. References and Citations. [BibTeX entry]

• A. Ehrenfeucht and G. Rozenberg. Repetition of subwords in DOL languages. Information and Control, 59(1-3):13-35, October/November/December 1983. References. [BibTeX entry]

• M. Hennessy. Synchronous and asynchronous experiments on processes. Information and Control, 59(1-3):36-83, October/November/December 1983. References and Citations. [BibTeX entry]

• Imre Bárány and Zoltán Füredi. Mental poker with three or more players. Information and Control, 59(1-3):84-93, October/November/December 1983. References. [BibTeX entry]

• A. P. Stolboushkin. Regular dynamic logic is not interpretable in deterministic context-free dynamic logic. Information and Control, 59(1-3):94-107, October/November/December 1983. References. [BibTeX entry]

• Hartmut Schmeck. Algebraic semantics of recursive flowchart schemes. Information and Control, 59(1-3):108-126, October/November/December 1983. References. [BibTeX entry]

• Henk Barendregt and Adrian Rezus. Semantics for classical AUTOMATH and related systems. Information and Control, 59(1-3):127-147, October/November/December 1983. References and Citations. [BibTeX entry]

• Ludwig Staiger. Subspaces of GF(q)^w and convolutional codes. Information and Control, 59(1-3):148-183, October/November/December 1983. References and Citations. [BibTeX entry]

• Jürgen Weiss. An n^{3/2} lower bound on the monotone network complexity of the Boolean convolution. Information and Control, 59(1-3):184-188, October/November/December 1983. References. [BibTeX entry]

Shortcuts: