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=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sometime=always+recursion identical to always on the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
P. Cousot
,
R. Cousot
Acta Informatica
24
(1), 1987, pp. 1-31
A formal semantics for concurrent systems with a priority relation
R. Janicki
Acta Informatica
24
(1), 1987, pp. 33-55
Partial parametrization eliminates multiple traversals of data structures
M. Takeichi
Acta Informatica
24
(1), 1987, pp. 57-77
Electing a leader in a ring with link failures
O. Goldreich
,
L. Shrira
Acta Informatica
24
(1), 1987, pp. 79-91
Analysis of space allocation in a generally fragmented linear store
C.H.C. Leung
Acta Informatica
24
(1), 1987, pp. 93-104
Generalized theory of serializability
K. Vidyasankar
Acta Informatica
24
(1), 1987, pp. 105-119
Lower bounds for sorting on mesh-connected architectures
M. Kunde
Acta Informatica
24
(2), 1987, pp. 121-130
Losslessness and project-join constructibility in relational databases
G. Loizou
,
P. Thanisch
Acta Informatica
24
(2), 1987, pp. 131-144
Redundant proofs of non-interference in Levin-Gries CSP program proofs
T.P. Murtagh
Acta Informatica
24
(2), 1987, pp. 145-156
The undecidability of the unification and matching problem for canonical theories
S. Heilbrunner
,
S. Holldobler
Acta Informatica
24
(2), 1987, pp. 157-171
An analysis of a contention resolution algorithm: another approach
W. Szpankowski
Acta Informatica
24
(2), 1987, pp. 173-190
SLR(1) and LALR(1) parsing for unrestricted grammars
L.A. Harris
Acta Informatica
24
(2), 1987, pp. 191-209
Extensional equivalences for transition systems
R. de Nicola
Acta Informatica
24
(2), 1987, pp. 211-237
Relational heuristics for the design of deterministic programs
A. Mili
,
J. Desharnais
,
F. Mili
Acta Informatica
24
(3), 1987, pp. 239-276
Branching processes in the analysis of the heights of trees
L. Devroye
Acta Informatica
24
(3), 1987, pp. 277-298
One-pass transformations of attributed program trees
H. Alblas
Acta Informatica
24
(3), 1987, pp. 299-352
A linear space algorithm for the LCS problem
S.K. Kumar
,
C.P. Rangan
Acta Informatica
24
(3), 1987, pp. 353-362
An easily testable optimal-time VLSI-multiplier
B. Becker
Acta Informatica
24
(4), 1987, pp. 363-380
Partial-predicate logic in computer science
A. Hoogewijs
Acta Informatica
24
(4), 1987, pp. 381-393
On sufficient-completeness and related properties of term rewriting systems
D. Kapur
,
P. Narendran
,
H. Zhang
Acta Informatica
24
(4), 1987, pp. 395-415
Parallel approximation schemes for subset sum and knapsack problems
J.G. Peters
,
L. Rudolph
Acta Informatica
24
(4), 1987, pp. 417-432
Long unavoidable patterns
U. Schmidt
Acta Informatica
24
(4), 1987, pp. 433-445
A result on k-valent graphs and its application to a graph embedding problem
P.E. Dunne
Acta Informatica
24
(4), 1987, pp. 447-459
Time optimal left to right construction of position trees
M. Kempf
,
R. Bayer
,
U. Güntzer
Acta Informatica
24
(4), 1987, pp. 461-474
Optimal worst case trees
E.A. Bender
,
C.E. Praeger
,
N.C. Wormald
Acta Informatica
24
(4), 1987, pp. 475-489
Seiten 1
2
>