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=4
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quad trees. A data structure for retrieval on composite keys
R.A. Finkel
,
J.L. Bentley
Acta Informatica
4
, 1975, pp. 1-9
A model of a time sharing virtual memory system solved using equivalence and decomposition methods
A. Brandwajn
Acta Informatica
4
, 1975, pp. 11-47
The stability problem of broadcast packet switching computer networks
G. Fayolle
,
E. Gelenbe
,
J. Labetoulle
,
D. Bastin
Acta Informatica
4
, 1975, pp. 49-53
Sequentielle Analyse kontextfreier Sprachen
G. Hotz
Acta Informatica
4
, 1975, pp. 55-75
Multipass precedence analysis
N.A. Khabbaz
Acta Informatica
4
, 1975, pp. 77-85
Nonterminals, homomorphisms and codings in different variations of OL-systems
M. Nielsen
,
G. Rozenberg
,
A. Salomaa
,
S. Skyum
Acta Informatica
4
, 1975, pp. 87-106
Algorithms for fast evaluation of Boolean expressions
Yuri Breitbart
,
Allen Reiter
Acta Informatica
4
, 1975, pp. 107-116
Proving properties of interacting processes
Glen Newton
Acta Informatica
4
, 1975, pp. 117-126
The verification and synthesis of data structures
Jay Spitzen
,
Ben Wegbreit
Acta Informatica
4
, 1975, pp. 127-144
Automatic program verification I: A logical basis and its implementation
Shigeru Igarashi
,
Ralph L. London
,
David C. Luckham
Acta Informatica
4
, 1975, pp. 145-182
Ambiguity and precedence in syntax description
Jay Earley
Acta Informatica
4
, 1975, pp. 183-192
On 3-head versus 2-head finite automata
Oscar H. Ibarra
,
Chul E. Kim
Acta Informatica
4
, 1975, pp. 193-200
Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Teil I: Datenstrukturen und Schemata
H.-D. Ehrich
Acta Informatica
4
, 1975, pp. 201-211
Nonlinear pattern theory
James F. Gimpel
Acta Informatica
4
, 1975, pp. 213-229
More comments on the programming language Pascal
O. Lecarme
,
P. Desjardins
Acta Informatica
4
, 1975, pp. 231-243
Semantic decomposition of computer programs: An aid to program testing
Paul M. Zislis
Acta Informatica
4
, 1975, pp. 245-269
Automatic correction of syntax-errors in programming languages
J.-P. Lévy
Acta Informatica
4
, 1975, pp. 271-292
A principle of independence for binary tree searching
Leo J. Guibas
Acta Informatica
4
, 1975, pp. 293-298
Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Teil II: Zugriffssysteme
H.-D. Ehrich
Acta Informatica
4
, 1975, pp. 299-310
A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions
Yu. Breitbart
,
A. Reiter
Acta Informatica
4
, 1975, pp. 311-319
Boolesche Minimalpolynome und überdeckungsprobleme
Wolfgang J. Paul
Acta Informatica
4
, 1975, pp. 321-336
Deriving graphs from graphs by applying a production
Barry K. Rosen
Acta Informatica
4
, 1975, pp. 337-357
WCS-Analysis of the context-sensitive
P.F. Schuler
Acta Informatica
4
, 1975, pp. 359-371
EOL systems with control devices
M. Nielsen
Acta Informatica
4
, 1975, pp. 373-386