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=1985
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the worst case performance of buddy systems
E.L. Lloyd
,
M.C. Loui
Acta Informatica
22
(4), 1985, pp. 451-473
Optimum decision trees-an optimal variable theorem and its related applications
M. Miyakawa
Acta Informatica
22
(5), 1985, pp. 475-498
Truly prefix-correct chain-free LR(1) parsers
S. Heilbrunner
Acta Informatica
22
(5), 1985, pp. 499-536
On the algebraic specification of infinite objects- ordered and continuous models of algebraic types
B. Moller
Acta Informatica
22
(5), 1985, pp. 537-578
The family of one-counter languages is closed under quotient
M. Latteux
,
B. Leguy
,
B. Ratoandromanana
Acta Informatica
22
(5), 1985, pp. 579-588
Fooling a two-way nondeterministic multihead automation with reversal number restriction
J. Hromkovic̑
Acta Informatica
22
(5), 1985, pp. 589-594
Some average performance measures for the B-tree
W.E. Wright
Acta Informatica
21
(6), 1985, pp. 541-557
Practical LL(1)-based parsing of van Wijngaarden grammars
A.J. Fisher
Acta Informatica
21
(6), 1985, pp. 559-584
Deadlock-freedom in resource contentions
M.C. Chen
,
M. Rem
Acta Informatica
21
(6), 1985, pp. 585-598
A denotational semantics for shared-memory parallelism and nondeterminism
D.M. Berry
Acta Informatica
21
(6), 1985, pp. 599-627
Permuting data with the Omega network
J. Lenfant
,
S. Tahe
Acta Informatica
21
(6), 1985, pp. 629-641
The residue of vector sets with applications to decidability problems in Petri nets
R. Valk
,
M. Jantzen
Acta Informatica
21
(6), 1985, pp. 643-674
Seiten
<
1
2