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 YEAR=1981
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Binary search trees in secondary memory
W.E. Wright
Acta Informatica
15
(1), 1981, pp. 3-17
Approximate analysis of exponential queueing systems with blocking
O.J. Boxma
,
A.G. Konheim
Acta Informatica
15
(1), 1981, pp. 19-66
Analysis of a service facility with periodic checkpointing
F. Baccelli
Acta Informatica
15
(1), 1981, pp. 67-81
Language design methods based on semantic principles: ALGOL 68, a language designed using semantic principles
D.M. Berry
Acta Informatica
15
(1), 1981, pp. 83-98
Backtracking with multi-level dynamic search rearrangement
P.W., Jr. Purdom
,
C.A. Brown
,
E.L. Robertson
Acta Informatica
15
(2), 1981, pp. 99-113
Parsing extended LR(k) grammars
P.W., Jr. Purdom
,
C.A. Brown
Acta Informatica
15
(2), 1981, pp. 115-127
The characterization of parallel ultralinear grammars by rational power series
W. Kuich
Acta Informatica
15
(2), 1981, pp. 129-139
A fast algorithm for Steiner trees
L. Kou
,
G. Markowsky
,
L. Berman
Acta Informatica
15
(2), 1981, pp. 141-145
An improved complexity hierarchy on the depth of Boolean functions
I. Wegener
Acta Informatica
15
(2), 1981, pp. 147-152
Strong independence of certain operations
F. Rodriguez
Acta Informatica
15
(2), 1981, pp. 153-166
HEX is PSPACE-complete
S. Reisch
Acta Informatica
15
(2), 1981, pp. 167-191