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=15
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
Axiomatic data type specifications: a first order theory of linear lists
D.J. Moore
,
B. Russell
Acta Informatica
15
(3), 1981, June, pp. 193-207
Flow languages equal recursively enumerable languages
T. Araki
,
N. Tokura
Acta Informatica
15
(3), 1981, June, pp. 209-217
Recursive assertions and parallel programs
K.R. Apt
Acta Informatica
15
(3), 1981, June, pp. 219-232
Proving total correctness of nondeterministic programs in infinitary logic
R.J.R. Back
Acta Informatica
15
(3), 1981, June, pp. 233-249
A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
H. Daduna
,
R. Schassberger
Acta Informatica
15
(3), 1981, June, pp. 251-263
LR(0) grammars generated by LR(0) parsers
R. Kemp
Acta Informatica
15
(3), 1981, June, pp. 265-280
A proof technique for communicating sequential processes
G.M. Levin
,
D. Gries
Acta Informatica
15
(3), 1981, June, pp. 281-302
The equivalence of Horn and network complexity for Boolean functions
S.O. Anderaa
,
E. Borger
Acta Informatica
15
(3), 1981, June, pp. 303-307
Persistence of vector replacement systems is decidable
E. Mayr
Acta Informatica
15
(3), 1981, June, pp. 309-318
Computing extremal and approximate distances in graphs having unit cost edges
Kellogg S. Booth
,
Richard J. Lipton
Acta Informatica
15
(4), 1981, August, pp. 319-328
Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
W., Jr. Lipski
,
F.P. Preparata
Acta Informatica
15
(4), 1981, August, pp. 329-346
Regenerative simulation of response times in networks of queues: statistical efficiency
D.L. Iglehart
,
G.S. Shedler
Acta Informatica
15
(4), 1981, August, pp. 347-363
The logic of aliasing
R. Cartwright
,
D. Oppen
Acta Informatica
15
(4), 1981, August, pp. 365-384
Goto statements: semantics and deduction systems
A. de Bruin
Acta Informatica
15
(4), 1981, August, pp. 385-424
Seiten 1
2
>