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 Volume=84
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Banker's problem with precedences
George Georgakopoulos
,
Dimitris Kavadias
Information and Computation
84
(1), 1990, January, pp. 1-12
Extending planar graph algorithms to
K_{3,3}
-free graphs
Samir Khuller
Information and Computation
84
(1), 1990, January, pp. 13-25
Computable one-to-one enumerations of effective domains
Dieter Spreen
Information and Computation
84
(1), 1990, January, pp. 26-46
Tools for proving inductive equalities, relative completeness, and
\omega
-completeness
Azeddine Lazrek
,
Pierre Lescanne
,
Jean-Jacques Thiel
Information and Computation
84
(1), 1990, January, pp. 47-70
Optimal parallel algorithms on planar graphs
Torben Hagerup
Information and Computation
84
(1), 1990, January, pp. 71-96
The power of multimedia: Combining point-to-point and multiaccess networks
Yehuda Afek
,
Gad M. Landau
,
Baruch Schieber
,
Moti Yung
Information and Computation
84
(1), 1990, January, pp. 97-118
A note on the determinant and permanent problem
Jin-Yi Cai
Information and Computation
84
(1), 1990, January, pp. 119-127
Proving total correctness of recursive procedures
Pierre America
,
Frank de Boer
Information and Computation
84
(2), 1990, February, pp. 129-162
A comparison of boundary graph grammars and context-free hypergraph grammars
Joost Engelfriet
,
Grzegorz Rozenberg
Information and Computation
84
(2), 1990, February, pp. 163-206
Extension of the Berlekamp-Massey algorithm to
N
dimensions
Shojiro Sakata
Information and Computation
84
(2), 1990, February, pp. 207-239