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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The paging drum queue: a uniform perspective and further results
C.H.C. Leung
,
Q.H. Choo
Acta Informatica
21
(5), 1984, pp. 485-500
Space sweep solves intersection of convex polyhedra
S. Hertel
,
M. Mantyla
,
K. Mehlhorn
,
J. Nievergelt
Acta Informatica
21
(5), 1984, pp. 501-519
Finite complete rewriting systems and the complexity of the word problem
G. Bauer
,
F. Otto
Acta Informatica
21
(5), 1984, pp. 521-540
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