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 YEAR=1986
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simple fixpoint argument without the restriction to continuity
E.W. Dijkstra
,
A.J.M. van Gasteren
Acta Informatica
23
(1), 1986, pp. 1-7
Specification-oriented semantics for communicating processes
E.-R. Olderog
,
C.A.R. Hoare
Acta Informatica
23
(1), 1986, pp. 9-66
Acceptable functional programming systems
L. Duponcheel
,
M. Duponcheel
Acta Informatica
23
(1), 1986, pp. 67-98
On deciding whether a monoid is a free monoid or is a group
F. Otto
Acta Informatica
23
(1), 1986, pp. 99-110
On the average internal path length of m-ary search trees
H.M. Mahmoud
Acta Informatica
23
(1), 1986, pp. 111-117
An incremental primal sieve
S.A. Bengelloun
Acta Informatica
23
(2), 1986, pp. 119-125
An efficient ELL (1)-Parser Generator
R. Heckmann
Acta Informatica
23
(2), 1986, pp. 127-148
Generation of efficient LALR parsers for regular right part grammars
I. Nakata
,
M. Sassa
Acta Informatica
23
(2), 1986, pp. 149-162
Algorithms for routing in planar graphs
M. Becker
,
K. Mehlhorn
Acta Informatica
23
(2), 1986, pp. 163-176
Exponential queueing systems with nonstationary parameters
C. Rosenberg
Acta Informatica
23
(2), 1986, pp. 177-192
Total correctness of CSP programs
N. Soundararajan
Acta Informatica
23
(2), 1986, pp. 193-215
Nearly optimal hierarchies for network and formula size
M.S. Paterson
,
I. Wegener
Acta Informatica
23
(2), 1986, pp. 217-221
A faster approximation algorithm for the Steiner problem in graphs
Y.F. Wu
,
P. Widmayer
,
C.K. Wong
Acta Informatica
23
(2), 1986, pp. 223-229
On the expressive power of data dependencies
J.A. Makowsky
,
M.Y. Vardi
Acta Informatica
23
(3), 1986, pp. 231-244
A regularity test for dual bordered OS systems
W. Bucher
Acta Informatica
23
(3), 1986, pp. 245-253
A workload model representative of static and dynamic characteristics
M. Calzarossa
,
M. Italiani
,
G. Serazzi
Acta Informatica
23
(3), 1986, pp. 255-266
Constructing maximal slicings from geometry
M. Tamminen
,
W.K. Luk
,
P. Sipala
,
L.S. Woo
,
C.K. Wong
Acta Informatica
23
(3), 1986, pp. 267-288
Graph theoretic closure properties of the family of boundary NLC graph languages
G. Rozenberg
,
E. Welzl
Acta Informatica
23
(3), 1986, pp. 289-309
NP-hard problems in hierarchical-tree clustering
M. Kȓivánek
,
J. Morávek
Acta Informatica
23
(3), 1986, pp. 311-323
The complexity of combinatorial problems with succinct input representation
K.W. Wagner
Acta Informatica
23
(3), 1986, pp. 325-356
Equivalence of the Gries and Martin proof rules for procedure calls
A. Bijlsma
,
J.G. Wiltink
,
P.A. Matthews
Acta Informatica
23
(4), 1986, pp. 357-360
Precedence technique is not worse than SLR(1)
P. Wyrostek
Acta Informatica
23
(4), 1986, pp. 361-392
A comparison of storage optimizations in automatically-generated attribute evaluators
R. Farrow
,
D. Yellin
Acta Informatica
23
(4), 1986, pp. 393-427
The Merlin-Randell problem of train journeys
M. Koutny
Acta Informatica
23
(4), 1986, pp. 429-463
A single server queue with mixed types of interruptions
V.F. Nicola
Acta Informatica
23
(4), 1986, pp. 465-486
Seiten 1
2
>