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=6
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms minimizing mean flow time: Schedule-length properties
E.G., Jr. Coffman
,
Ravi Sethi
Acta Informatica
6
, 1976, pp. 1-14
Specification and proving of command programs
E.J. Neuhold
,
T. Weller
Acta Informatica
6
, 1976, pp. 15-40
A system which automatically improves programs
J. Darlington
,
R.M. Burstall
Acta Informatica
6
, 1976, pp. 41-60
Axiomatics for memory allocation
A.P. Ershov
Acta Informatica
6
, 1976, pp. 61-75
Hierarchies of complete problems
Zvi Galil
Acta Informatica
6
, 1976, pp. 77-88
Inherently nonplanar automata
Ronald V. Book
,
Ashok K. Chandra
Acta Informatica
6
, 1976, pp. 89-94
Transformational methods and their application to complexity problems
Burkhard Monien
Acta Informatica
6
, 1976, pp. 95-108
SEMANOL (73). A metalanguage for programming the semantics of programming languages
E.R. Anderson
,
F.C. Belz
,
E.K. Blum
Acta Informatica
6
, 1976, pp. 109-131
Affine relationships among variables of a program
Michael Karr
Acta Informatica
6
, 1976, pp. 133-151
Another polynomial homomorphism
Robert T. Moenck
Acta Informatica
6
, 1976, pp. 153-169
Edge-disjoint spanning trees and depth-first search
Robert Endre Tarjan
Acta Informatica
6
, 1976, pp. 171-185
The mathematical analysis of the computer system modeled as a two stage cyclic queue
W.R. Franta
Acta Informatica
6
, 1976, pp. 187-209
Some resource allocation policies in a multi associative processor
Gary J. Nutt
Acta Informatica
6
, 1976, pp. 211-225
On the efficient implementation of conditional critical regions and the construction of monitors
Hans Albrecht Schmid
Acta Informatica
6
, 1976, pp. 227-249
A decomposable model of program paging behaviour
P.-J. Courtois
,
H. Vantilborgh
Acta Informatica
6
, 1976, pp. 251-275
An alternative approach to the improvement of
LR(k)
parsers
R.C. Backhouse
Acta Informatica
6
, 1976, pp. 277-296
Grammars on partial graphs
H.J. Schneider
,
H. Ehrig
Acta Informatica
6
, 1976, pp. 297-316
Remarks on ``Program proving: Jumps and functions by M. Clint and C.A.R. Hoare''
E.A. Ashcroft
,
M. Clint
,
C.A.R. Hoare
Acta Informatica
6
, 1976, pp. 317-318
An axiomatic proof technique for parallel programs I
Susan Owicki
,
David Gries
Acta Informatica
6
, 1976, pp. 319-340
On the implementation of Strassen's fast multiplication algorithm
Jacques Cohen
,
Martin Roth
Acta Informatica
6
, 1976, pp. 341-355
On a gauntlet thrown by David Gries
Edsger W. Dijkstra
Acta Informatica
6
, 1976, pp. 357-359
An
O(n)
algorithm for computing the set of available expressions of D-charts
K. Taniguchi
,
T. Kasami
Acta Informatica
6
, 1976, pp. 361-364
A model of a virtual memory system
A. Brandwajn
Acta Informatica
6
, 1976, pp. 365-386
Resolution of ambiguity in parsing
R.M. Wharton
Acta Informatica
6
, 1976, pp. 387-395
On grammar forms with terminal context
H.A. Maurer
,
D. Wood
Acta Informatica
6
, 1976, pp. 397-402
Seiten 1
2
>