Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Comput. AND YEAR=1989
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simplified proof of
DDL<DL
Jerzy Tiuryn
Information and Computation
81
(1), 1989, pp. 1-12
Reasoning about networks with many identical finite state processes
M.C. Browne
,
E.M. Clarke
,
O. Grumberg
Information and Computation
81
(1), 1989, pp. 13-31
Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
Alan Gibbons
,
Wojciech Rytter
Information and Computation
81
(1), 1989, pp. 32-45
The use and usefulness of numeration systems
Aviezri S. Fraenkel
Information and Computation
81
(1), 1989, pp. 46-61
Distinguishing conjunctive and disjunctive reducibilities by sparse sets
Ker-I Ko
Information and Computation
81
(1), 1989, pp. 62-87
Linear graph grammars: Power and complexity
Joost Engelfriet
,
George Leh
Information and Computation
81
(1), 1989, pp. 88-121
Domain theoretic models of polymorphism
Thierry Coquand
,
Carl Gunter
,
Glynn Winskel
Information and Computation
81
(2), 1989, pp. 123-167
A logic of recursion
V. Michele Abrusci
,
Gianfranco Mascari
Information and Computation
81
(2), 1989, pp. 168-226
A complete axiomatization for observational congruence of finite-state behaviours
Robin Milner
Information and Computation
81
(2), 1989, pp. 227-247
An automata theoretic decision procedure for the propositional Mu-calculus
Robert S. Streett
,
E. Allen Emerson
Information and Computation
81
(3), 1989, pp. 249-264
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
G. Sénizergues
Information and Computation
81
(3), 1989, pp. 265-279
An arithmetical hierarchy in propositional dynamic logic
Sorin Istrail
Information and Computation
81
(3), 1989, pp. 280-289
Convex powerdomains II
Karel Hrbacek
Information and Computation
81
(3), 1989, pp. 290-317
Parallel graph algorithms that are efficient on average
Don Coppersmith
,
Prabhakar Raghavan
,
Martin Tompa
Information and Computation
81
(3), 1989, pp. 318-333
Faster optimal parallel prefix sums and list ranking
Richard Cole
,
Uzi Vishkin
Information and Computation
81
(3), 1989, pp. 334-352
Linear-time simulation of multihead Turing machines
W. Schnitzlein
,
H.-J. Stoss
Information and Computation
81
(3), 1989, pp. 353-363
Parallel processing can be harmful: The unusual behavior of interpolation search
Dan E. Willard
,
John H. Reif
Information and Computation
81
(3), 1989, pp. 364-379
Simplicity, immunity, relativizations and nondeterminism
Leen Torenvliet
,
Peter van Emde Boas
Information and Computation
80
(1), 1989, pp. 1-17
Optimizing propositional calculus formulas with regard to questions of deducibility
Hans Kleine Büning
,
Ulrich Löwen
Information and Computation
80
(1), 1989, pp. 18-43
Relativized Arthur-Merlin versus Merlin-Arthur games
Miklos Santha
Information and Computation
80
(1), 1989, pp. 44-49
Partiality, Cartesian closedness, and toposes
P.-L. Curien
,
A. Obtulowicz
Information and Computation
80
(1), 1989, pp. 50-95
Unique normal forms for Lambda calculus with surjective pairing
J.W. Klop
,
R.C. de Vrijer
Information and Computation
80
(2), 1989, pp. 97-113
The power of two-way deterministic checking stack automata
Joost Engelfriet
Information and Computation
80
(2), 1989, pp. 114-120
Correctness proofs for abstract implementations
Gilles Bernot
Information and Computation
80
(2), 1989, pp. 121-151
\NC
algorithms for computing the number of perfect matchings in
K{3,3}
-free graphs and related problems
Vijay V. Vazirani
Information and Computation
80
(2), 1989, pp. 152-164
Seiten 1
2
>