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.
Data management support for database management
R. Bayer
Acta Informatica
21
(1), 1984, pp. 1-28
LALR (1,1) parser generation for regular right part grammars
N.P. Chapman
Acta Informatica
21
(1), 1984, pp. 29-45
Optimal multiway search trees for variable size keys
J.L. Szwarcfiter
Acta Informatica
21
(1), 1984, pp. 47-60
Axiomatising finite delay operators
M. Hennessy
Acta Informatica
21
(1), 1984, pp. 61-88
Free choice systems have home states
E. Best
,
K. Voss
Acta Informatica
21
(1), 1984, pp. 89-100
Maintaining order in a generalized linked list
A.K. Tsakalidis
Acta Informatica
21
(1), 1984, pp. 101-112
Generalized binary split trees
S.-H.S. Huang
,
C.K. Wong
Acta Informatica
21
(1), 1984, pp. 113-123
An approach to automating the verification of compact parallel coordination programs. I
B.D. Lubachevsky
Acta Informatica
21
(2), 1984, pp. 125-169
Characterization of all optimal networks for a simultaneous computation of and and nor
N. Blum
,
M. Seysen
Acta Informatica
21
(2), 1984, pp. 171-181
On binary tree encodements
W.D. Gillett
Acta Informatica
21
(2), 1984, pp. 183-192
A characterization of systolic binary tree automata and applications
O.H. Ibarra
,
S.M. Kim
Acta Informatica
21
(2), 1984, pp. 193-207
Bicenters of context-free languages
J.M. Autebert
,
J. Beauquier
,
L. Boasson
,
F. Gire
Acta Informatica
21
(2), 1984, pp. 209-227
A probabilistic analysis of the height of tries and of the complexity of triesort
L. Devroye
Acta Informatica
21
(3), 1984, pp. 229-237
Using circular programs to eliminate multiple traversals of data
R.S. Bird
Acta Informatica
21
(3), 1984, pp. 239-250
A logic covering undefinedness in program proofs
H. Barringer
,
J.H. Cheng
,
C.B. Jones
Acta Informatica
21
(3), 1984, pp. 251-269
Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
R.H. Güting
Acta Informatica
21
(3), 1984, pp. 271-291
The axiomatic semantics of programs based on Hoare's logic
J.A. Bergstra
,
J.V. Tucker
Acta Informatica
21
(3), 1984, pp. 293-320
Simulation output analysis for local area computer networks
D.L. Iglehart
,
G.S. Shedler
Acta Informatica
21
(4), 1984, pp. 321-338
Randomized and deterministic simulations of PRAMS by parallel machines with restricted granularity of parallel memories
K. Mehlhorn
,
U. Vishkin
Acta Informatica
21
(4), 1984, pp. 339-374
Speeding up circularity tests for attribute grammars
P. Deransart
,
M. Jourdan
,
B. Lorho
Acta Informatica
21
(4), 1984, pp. 375-391
On real-time cellular automata and trellis automata
C. Choffrut
,
K. Culik II
Acta Informatica
21
(4), 1984, pp. 393-407
A performance guarantee for the greedy set-partitioning algorithm
E.G., Jr. Coffman
,
M.A. Langston
Acta Informatica
21
(4), 1984, pp. 409-415
A fair calculus of communicating systems
G. Costa
,
C. Stirling
Acta Informatica
21
(5), 1984, pp. 417-441
A set-theoretic semantics for clear
D.T. Sannella
Acta Informatica
21
(5), 1984, pp. 443-472
Polyvariant mixed computation for analyzer programs
M.A. Bulyonkov
Acta Informatica
21
(5), 1984, pp. 473-484
Seiten 1
2
>