Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456 Information and Computation -- 1989
Hans Kleine Büning
and Ulrich
Löwen. Optimizing propositional calculus formulas with regard
to questions of deducibility. Information and Computation,
80(1):18-43, January 1989.
[BibTeX entry]
Miklos Santha. Relativized
Arthur-Merlin versus Merlin-Arthur games. Information and
Computation, 80(1):44-49, January 1989.
[BibTeX entry]
Joost Engelfriet. The power
to two-way deterministic checking stack automata. Information and
Computation, 80(2):114-120, February 1989.
References.
[BibTeX entry]
Gilles Bernot. Correctness
proofs for abstract implementation. Information and
Computation, 80(2):121-151, February 1989.
Citations.
[BibTeX entry]
Vijay V. Vazirani. NC
algorithms for computing the number of perfect matchings in
K_{3,3}-free graphs and related problems. Information
and Computation, 80(2):152-164, February 1989.
References
and Citations.
[BibTeX entry]
Patrick Cousot and Radhia Cousot. A language
independent proof of the soundness and completeness of generalized Hoare
logic. Information and Computation, 80(2):165-191, February
1989.
[BibTeX entry]
Ker-I Ko.
Distinguishing conjunctive and disjunctive reducibilities by sparse
sets. Information and Computation, 81(1):62-87, April 1989.
Citations.
[BibTeX entry]
Robin Milner. A complete
axiomatisation for observational congruence of finite-state behaviors.
Information and Computation, 81(2):227-247, May 1989.
Citations.
[BibTeX entry]
G.
Sénizergues. Church-Rosser controller rewriting systems and
equivalence problems for deterministic context-free languages.
Information and Computation, 81(3):265-279, June 1989.
References.
[BibTeX entry]
Sorin Istrail. An arithmetical
hierarchy in propositional dynamic logic. Information and
Computation, 81(3):280-289, June 1989.
[BibTeX entry]
Dan E. Willard and John H. Reif. Parallel processing
can be harmful: The unusual behavior of interpolation search.
Information and Computation, 81(3):364-379, June 1989.
Citations.
[BibTeX entry]
Dan
E. Willard. Lower bounds for the addition-subtraction operations in
orthogonal range queries and related problems. Information and
Computation, 82(1):45-64, July 1989.
Citations.
[BibTeX entry]
Manfred Droste. Recursive
domain equations for concrete data structures. Information and
Computation, 82(1):65-80, July 1989.
Citations.
[BibTeX entry]
László
Babai and Shlomo
Moran. Proving properties of interactive proofs by a generalized
counting technique. Information and Computation,
82(2):185-197, August 1989.
[BibTeX entry]
André Arnold and Anne Dicky. An algebraic
characterization of transition system equivalences. Information
and Computation, 82(2):198-229, August 1989.
Citations.
[BibTeX entry]
Jonathan S. Turner.
Approximation algorithms for the shortest common superstring problem.
Information and Computation, 83(1):1-20, October 1989.
Citations.
[BibTeX entry]
M.
Nivat and A.
Saoudi. Automata on infinite objects and their applications to logic
and programming. Information and Computation, 83(1):41-64,
October 1989.
References.
[BibTeX entry]
Bernd
Voigt and Ingo
Wegener. Minimal polynomials for the conjunction of functions on
disjoint variables can be very simple. Information and
Computation, 83(1):65-79, October 1989.
[BibTeX entry]
F.
E. Fich, M. Li, P. Ragde, and Y. Yesha. On the power of
concurrent-write PRAMs with read-only memory. Information and
Computation, 83(2):234-244, November 1989.
[BibTeX entry]