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=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The formal development of a parallel program performing LU-decomposition
Johannes G.G. Van De Vorst
Acta Informatica
26
, 1988, pp. 1-17
Corrections to ``A synthesis of several sorting algorithms'' by J. Darlington
Dean Jacobs
,
Martin Feather
Acta Informatica
26
, 1988, pp. 19-23
Correctness of semantic integrity checking in database management systems
E. Bertino
,
D. Musto
Acta Informatica
26
, 1988, pp. 25-57
A distributed operational semantics for CCS based on condition/event systems
Pierpaolo Degano
,
Rocco De Nicola
,
Ugo Montanari
Acta Informatica
26
, 1988, pp. 59-91
Motion planning among time dependent obstacles
K. Sutner
,
W. Maass
Acta Informatica
26
, 1988, pp. 93-122
Applications of the theory of records in the study of random trees
Luc Devroye
Acta Informatica
26
, 1988, pp. 123-130
High level tree transducers and iterated pushdown tree transducers
Joost Engelfriet
,
Heiko Vogler
Acta Informatica
26
, 1988, pp. 131-192
Transforming unbalanced multiway trees into a practical external data structure
Walter Cunto
,
Patricio V. Poblete
Acta Informatica
26
, 1988, pp. 193-211
Attribute (re)evaluation in OPTRAN
Peter Lipps
,
Ulrich Möncke
,
Matthias Olk
,
Reinhard Wilhelm
Acta Informatica
26
, 1988, pp. 213-239
Maximum entropy two-station cyclic queues with multiple general servers
Demetres D. Kouvatsos
,
John Almond
Acta Informatica
26
, 1988, pp. 241-267
A balanced search tree with
O(1)
worst-case update time
Christos Levcopoulos
,
Mark H. Overmars
Acta Informatica
26
, 1988, pp. 269-277
The method of forced enumeration for nondeterministic automata
Róbert Szelepcsényi
Acta Informatica
26
, 1988, pp. 279-284
Laws of data refinement
Joseph M. Morris
Acta Informatica
26
, 1988, pp. 287-308
Predicate-transformer semantics of general recursion
Wim H. Hesselink
Acta Informatica
26
, 1988, pp. 309-332
Failures semantics and deadlocking of modular Petri nets
Walter Vogler
Acta Informatica
26
, 1988, pp. 333-348
Modelling splits in file structures
Ricardo A. Baeza-Yates
Acta Informatica
26
, 1988, pp. 349-362
On counting and approximation
Johannes Köbler
,
Uwe Schöning
,
Jacobo Toran
Acta Informatica
26
, 1988, pp. 363-379
Through the mincing machine with a Boolean layer cake
Edward G. Belaga
Acta Informatica
26
, 1988, pp. 381-407
A sharp proof rule for procedures in wp semantics
A. Bijlsma
,
P.A. Matthews
,
J.G. Wiltink
Acta Informatica
26
, 1988, pp. 409-419
Unsafe operations in B-trees
Bin Zhang
,
Meichun Hsu
Acta Informatica
26
, 1988, pp. 421-438
Expected behaviour of
B+
-trees under random insertions
Ricardo A. Baeza-Yates
Acta Informatica
26
, 1988, pp. 439-471
Stable duplicate-key extraction with optimal time and space bounds
Bing-Chao Huang
,
Michael A. Langston
Acta Informatica
26
, 1988, pp. 473-484
A family of
NP
-complete data aggregation problems
Paul Helman
Acta Informatica
26
, 1988, pp. 485-499
Rational index of vector addition systems languages
Laurent Pierre
,
Sylviane R. Schwer
Acta Informatica
26
, 1988, pp. 503-525
On the finite degree of ambiguity of finite tree automata
Helmut Seidl
Acta Informatica
26
, 1988, pp. 527-542
Seiten 1
2
3
>