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=11
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A synthesis of several sorting algorithms
J. Darlington
Acta Informatica
11
(1), 1978, pp. 1-30
Proving and applying program transformations expressed with second-order patterns
G. Huet
,
B. Lang
Acta Informatica
11
(1), 1978, pp. 31-55
Remarks on 'some comments on concurrent readers and writers' by Reidar Conradi
A. Silberschatz
,
B. Johnson
Acta Informatica
11
(1), 1978, pp. 57-60
Improved time and space bounds for Boolean matrix multiplication
L. Adleman
,
K.S. Booth
,
F.P. Preparata
,
W.L. Ruzzo
Acta Informatica
11
(1), 1978, pp. 61-70
Complexity hierarchies for Boolean functions
W.F. McColl
Acta Informatica
11
(1), 1978, pp. 71-77
Precedence relations in grammar forms
S. Ginsburg
,
D. Wood
Acta Informatica
11
(1), 1978, pp. 79-88
Hierarchy theorems for two-way finite state transducers
S.A. Greibach
Acta Informatica
11
(1), 1978, pp. 89-101
An experimentally validated model of the paging drum
C. Adams
,
E. Gelenbe
,
J. Vicard
Acta Informatica
11
(2), 1979, pp. 103-117
Constructing a theory of a data structure as an aid to program development
C.B. Jones
Acta Informatica
11
(2), 1979, pp. 119-137
Proof rules for gotos
M.A. Arbib
,
S. Alagic
Acta Informatica
11
(2), 1979, pp. 139-148
A binary operation on trees and an initial algebra characterization for finite tree types
W. Merzenich
Acta Informatica
11
(2), 1979, pp. 149-168
On the definition of ELR(k) and ELL(k) grammars
S. Heilbrunner
Acta Informatica
11
(2), 1979, pp. 169-176
Constructing LR parsers for regular right part grammars
W.R. Lalonde
Acta Informatica
11
(2), 1979, pp. 177-193
The clean termination of PASCAL programs
D. Coleman
,
J.W. Hughes
Acta Informatica
11
(3), 1979, pp. 195-210
The correctness of the Schorr-Waite list marking algorithm
R.W. Topor
Acta Informatica
11
(3), 1979, pp. 211-221
The Schorr-Waite graph marking algorithm
D. Gries
Acta Informatica
11
(3), 1979, pp. 223-232
Intersections of bounded algebraic languages
M. Latteux
Acta Informatica
11
(3), 1979, pp. 233-240
Cylinder operations and inverse GSM mappings applications
J.-M. Autebert
Acta Informatica
11
(3), 1979, pp. 241-258
Extended linear macro grammars, iteration grammars, and register programs
P.R.J. Asveld
,
J. Engelfriet
Acta Informatica
11
(3), 1979, pp. 259-285
Do considered od: a contribution to the programming calculus
E.C.R. Hehner
Acta Informatica
11
(4), 1979, pp. 287-304
Recovery techniques for distributed database management systems
P. Bouchet
Acta Informatica
11
(4), 1979, pp. 305-340
Dynamic weighted binary search trees
K. Unterauer
Acta Informatica
11
(4), 1979, pp. 341-362
The average binary number of registers needed to evaluate a binary tree optimally
R. Kemp
Acta Informatica
11
(4), 1979, pp. 363-372
A useful lemma for context-free programmed grammars
J. van Leeuwen
Acta Informatica
11
(4), 1979, pp. 373-386