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.~Control AND Volume=66
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Unraveling k-page graphs
R. Kannan
Information and Control
66
(1/2), 1985, pp. 1-5
On the relationships between Scott domains, synchronization trees, and metric spaces
W.C. Rounds
Information and Control
66
(1-2), 1985, pp. 6-28
On relative completeness of Hoare logics
M. Grabowski
Information and Control
66
(1-2), 1985, pp. 29-44
An area-maximum edge length trade-off for VLSI layout
N. Blum
Information and Control
66
(1-2), 1985, pp. 45-52
The complexity of cubical graphs
Foto Afrati
,
Christos H. Papadimitriou
,
George Papageorgiou
Information and Control
66
(1/2), 1985, pp. 53-60
Implicit data structures for weighted elements
G.N. Frederickson
Information and Control
66
(1-2), 1985, pp. 61-82
A proof rule for fair termination of guarded commands
O. Grumberg
,
N. Francez
,
J.A. Makowsky
,
W.P. de Roever
Information and Control
66
(1-2), 1985, pp. 83-102
The complexity of equivalence problems for commutative grammars
D.T. Huynh
Information and Control
66
(1/2), 1985, pp. 103-121
Effective Hilbert irreducibility
E. Kaltofen
Information and Control
66
(3), 1985, pp. 123-137
Powerposets
T. Adachi
Information and Control
66
(3), 1985, pp. 138-162
Complexity of some problems from the theory of automata
J. Stern
Information and Control
66
(3), 1985, pp. 163-176
Separation in nonlinear time models
A. Amir
Information and Control
66
(3), 1985, pp. 177-203