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 Control -- 1985
Stephen A. Cook. A taxonomy of
problems with fast parallel algorithms. Information and
Control, 64(1-3):2-21, January/February/March 1985.
Citations.
[BibTeX entry]
Rüdiger Reischuk. A
new solution for the Byzantine generals problem. Information and
Control, 64(1-3):23-42, January/February/March 1985.
[BibTeX entry]
Stefan Hertel and Kurt Mehlhorn. Fast
triangulation of the plane with respect to simple polygons.
Information and Control, 64(1-3):52-76,
January/February/March 1985.
[BibTeX entry]
Esko Ukkonen. Algorithms for
approximate string matching. Information and Control,
64(1-3):100-118, January/February/March 1985.
Citations.
[BibTeX entry]
Rocco De Nicola. Two complete
axiom systems for a theory of communicating sequential processes.
Information and Control, 64(1-3):136-172,
January/February/March 1985.
[BibTeX entry]
John
Grant and Jack
Minker. Normalization and axiomatization for numerical dependencies.
Information and Control, 65(1):1-17, April 1985.
[BibTeX entry]
Oscar H. Ibarra and Louis E. Rosier. The equivalence
problem and correctness formulas for a simple class of programs.
Information and Control, 65(1):18-41, April 1985.
[BibTeX entry]
R. Statman. Logical relations
and the typed lambda-calculus. Information and Control,
65(2/3):85-97, May/June 1985.
Citations.
[BibTeX entry]
A.
J. Kfoury. Definability by deterministic and non-deterministic
programs (with applications to first-order dynamic logic).
Information and Control, 65(2/3):98-121, May/June 1985.
Citations.
[BibTeX entry]
William C. Rounds. On the
relationship between Scott domains, synchronization trees, and metric
spaces. Information and Control, 66(1/2):6-28, July/August
1985.
Citations.
[BibTeX entry]
Dung
T. Huynh. The complexity of equivalence problems for commutative
grammars. Information and Control, 66(1/2):103-121,
July/August 1985.
Citations.
[BibTeX entry]
Jacques Stern. Complexity of
some problems from the theory of automata. Information and
Control, 66(3):163-176, September 1985.
Citations.
[BibTeX entry]
Symposium: Mathematical Foundations of Computer Science
Jerzy
Tiuryn. Preface. Information and Control, 67(1-3):1,
October/November/December 1985.
[BibTeX entry]
J. M. Robson. Alternation
with restrictions on looping. Information and Control,
67(1-3):2-11, October/November/December 1985.
References.
[BibTeX entry]
Wojciech Rytter. Fast
recognition of pushdown automaton and context-free languages.
Information and Control, 67(1-3):12-22,
October/November/December 1985.
References.
[BibTeX entry]
Marek Karpinski and Rutger Verbeek. There is no
polynomial deterministic space simulation of probabilistic space with a
two-way random-tape generator. Information and Control,
67(1-3):158-162, October/November/December 1985.
References.
[BibTeX entry]
Helge Szwerinski. Symmetrical
one-dimensional cellular spaces. Information and Control,
67(1-3):163-172, October/November/December 1985.
References.
[BibTeX entry]
Friedhelm Meyer auf der
Heide. Lower time bounds for solving linear diophantine equations on
several parallel computational models. Information and
Control, 67(1-3):195-211, October/November/December 1985.
References.
[BibTeX entry]
Ingo Wegener. The critical
complexity of all (monotone) Boolean functions and monotone graph
properties. Information and Control, 67(1-3):212-222,
October/November/December 1985.
References.
[BibTeX entry]