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=Acta Inf. AND Volume=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Throughput of a satellite channel communications
M. Bechtold
,
G. Pujolle
,
O. Spaniol
Acta Informatica
22
(1), 1985, pp. 1-14
Analysis of tree algorithms for the simulation event list
J.H. Kingston
Acta Informatica
22
(1), 1985, pp. 15-33
Thrift execution of task pipelines
F.B. Schneider
,
R. Conway
,
D. Skeen
Acta Informatica
22
(1), 1985, pp. 35-45
Strongest invariant functions: their use in the systematic analysis of while statements
A. Mili
,
J. Desharnais
,
J.-R. Gagne
Acta Informatica
22
(1), 1985, pp. 47-66
General correctness: a unification of partial and total correctness
D. Jacobs
,
D. Gries
Acta Informatica
22
(1), 1985, pp. 67-83
Purely top-down updating algorithms for stratified search trees
T. Ottmann
,
M. Schrapp
,
D. Wood
Acta Informatica
22
(1), 1985, pp. 85-100
Performance bounds for binary testing with arbitrary weights
D.W. Loveland
Acta Informatica
22
(1), 1985, pp. 101-114
Ramsey numbers and an approximation algorithm for the vertex cover problem
B. Monien
,
E. Speckenmeyer
Acta Informatica
22
(1), 1985, pp. 115-123
Querying fragmented relations in a distributed database
C. Meghini
,
C. Thanos
Acta Informatica
22
(2), 1985, pp. 125-138
On scheduling tasks with exponential service times and in-tree precedence constraints
J. Bruno
Acta Informatica
22
(2), 1985, pp. 139-148
Rewrite systems on a lattice of types
R.J. Cunningham
,
A.J.J. Dick
Acta Informatica
22
(2), 1985, pp. 149-169
An algorithm for merging heaps*
J.R. Sack
,
T. Strothotte
Acta Informatica
22
(2), 1985, pp. 171-186
Drawing plane graphs nicely
N. Chiba
,
K. Onoguchi
,
T. Nishizeki
Acta Informatica
22
(2), 1985, pp. 187-201
An effectively given initial semigroup*
T. Kamimura
Acta Informatica
22
(2), 1985, pp. 203-227
A
2.5n
lower bound on the monotone network complexity of
T_3^n
P.E. Dunne
Acta Informatica
22
(2), 1985, pp. 229-240
A priority queue with interruptions of service permitted after a time quantum
Bogdan Rembowski
Acta Informatica
22
(3), 1985, pp. 241-251
Short proofs for tricky formulas
B. Krishnamurthy
Acta Informatica
22
(3), 1985, pp. 253-275
Decidable properties of monadic recursive schemas with a depth parameter
J. Gonczarowski
Acta Informatica
22
(3), 1985, pp. 277-310
Proving properties of Pascal programs in MIZAR 2
Piotr Rudnicki
,
Wlodzimierz Drabent
Acta Informatica
22
(3), 1985, pp. 311-331
Probabilistic bounds for dual bin-packing
J.L. Bruno
,
P.J. Downey
Acta Informatica
22
(3), 1985, pp. 333-345
Necessary and sufficient conditions for the universality of programming formalisms
A.J. Kfoury
,
P. Urzyczyn
Acta Informatica
22
(4), 1985, pp. 347-377
Complete problems for space bounded subclasses of
NP
Moon-Jung Chung
,
W.M. Evangelist
,
I.H. Sudborough
Acta Informatica
22
(4), 1985, pp. 379-395
Global storage cells for attributes in an attribute grammar
M. Sonnenschein
Acta Informatica
22
(4), 1985, pp. 397-420
Complexity of the word problem for commutative semigroups of fixed dimension
D.T. Huynh
Acta Informatica
22
(4), 1985, pp. 421-432
Replaceability and computational equivalence for monotone Boolean functions
M. Beynon
Acta Informatica
22
(4), 1985, pp. 433-449
Seiten 1
2
>