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=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some beautiful arguments using mathematical induction
E.W. Dijkstra
Acta Informatica
13
(1), 1980, January, pp. 1-8
Semantic properties of Lucid's compute clause and its compilation
C.M. Hoffmann
Acta Informatica
13
(1), 1980, January, pp. 9-20
Variance reduction techniques for the simulation of Markov process. II. Matrix iterative methods
P. Heidelberger
Acta Informatica
13
(1), 1980, January, pp. 21-37
An algorithmic and complexity analysis of interpolation search
G.H. Gonnet
,
J.A. George
,
L.D. Rogers
Acta Informatica
13
(1), 1980, January, pp. 39-52
Applications of efficient mergeable heaps for optimization problems on trees
Z. Galil
Acta Informatica
13
(1), 1980, January, pp. 53-58
GOBANG is PSPACE-complete
S. Reisch
Acta Informatica
13
(1), 1980, January, pp. 59-66
Paramodulated connection graphs
J. Siekmann
,
G. Wrightson
Acta Informatica
13
(1), 1980, January, pp. 67-86
On generators and generative capacity of EOL forms
H.A. Maurer
,
A. Salomaa
,
D. Wood
Acta Informatica
13
(1), 1980, January, pp. 87-107
A new lower bound on the monotone network complexity of Boolean sums
I. Wegener
Acta Informatica
13
(2), 1980, February, pp. 109-114
Methods for the automatic construction of error correcting parsers
J. Röhrich
Acta Informatica
13
(2), 1980, February, pp. 115-139
Efficient LL(1) error correction and recovery using only insertions
C.N. Fischer
,
D.R. Milton
,
S.B. Quiring
Acta Informatica
13
(2), 1980, February, pp. 141-154
Efficient worst-case data structures for range searching
J.L. Bentley
,
H.A. Maurer
Acta Informatica
13
(2), 1980, February, pp. 155-168
Proving correctness of coroutines without history variables
E.M. Clarke
Acta Informatica
13
(2), 1980, February, pp. 169-188
An Ogden-like iteration lemma for rational power series
Christophe Reutenauer
Acta Informatica
13
, 1980, pp. 189-197
Amounts of nondeterminism in finite automata
C.M.R. Kintala
,
D. Wotschke
Acta Informatica
13
(2), 1980, February, pp. 199-204
A practical example of the specification of abstract data types
F.W. Tompa
Acta Informatica
13
(3), 1980, March, pp. 205-224
Remarks on 'a synthesis of several sorting algorithms' by John Darlington
D.R. Barstow
Acta Informatica
13
(3), 1980, March, pp. 225-227
Ordered attributed grammars
U. Kastens
Acta Informatica
13
(3), 1980, March, pp. 229-256
Context-free grammars with selective rewriting
G. Rozenberg
,
D. Wood
Acta Informatica
13
(3), 1980, March, pp. 257-268
Universal asynchronous iterative arrays of mealy automata
H. Kleine-Buning
,
L. Priese
Acta Informatica
13
(3), 1980, March, pp. 269-285
Automata in planar graphs
H.A. Rollik
Acta Informatica
13
(3), 1980, March, pp. 287-298
Analysis of a prioritized CSMA protocol based on staggered delays
W.R. Franta
,
M.B. Bilodeau
Acta Informatica
13
(4), 1980, May, pp. 299-324
Depth-first k-trees and critical path analysis
A.T. Berztiss
Acta Informatica
13
(4), 1980, May, pp. 325-346
Algebraic and linear generators
M. Latteux
Acta Informatica
13
(4), 1980, May, pp. 347-363
Rational bijection of rational sets
H.A. Maurer
,
M. Nivat
Acta Informatica
13
(4), 1980, May, pp. 365-378
Seiten 1
2
>