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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Iteration of transformation passes over attributed program trees
H. Alblas
Acta Informatica
27
, 1989, pp. 1-40
A model of the dynamic behavior of B-trees
C.E. Langenhop
,
W.E. Wright
Acta Informatica
27
, 1989, pp. 41-59
An almost linear Robinson unification algorithm
P. Ruz̑ic̑ka
,
I. Privara
Acta Informatica
27
, 1989, pp. 61-71
A note on synthesis and classification of sorting algorithms
K.K. Lau
Acta Informatica
27
, 1989, pp. 73-80
Scattered versus context-sensitive rewriting
J. Gonczarowski
,
M.K. Warmuth
Acta Informatica
27
, 1989, pp. 81-95
An incremental mechanical development of systolic solutions to the algebraic path problem
C.-H. Huang
,
C. Lengauer
Acta Informatica
27
, 1989, pp. 97-124
Step failures semantics and a complete proof system
D. Taubner
,
W. Vogler
Acta Informatica
27
, 1989, pp. 125-156
Some efficient computational algorithms related to phase models
V. Rego
Acta Informatica
27
, 1989, pp. 157-177
HDTOL matching of computations of multitape automata
K. Culik II
,
J. Karhumäki
Acta Informatica
27
, 1989, pp. 179-191
Merging sorted runs using large main memory
B. Salzberg
Acta Informatica
27
, 1989, pp. 195-215
Describing semantic domains with sprouts
Gunther Schmidt
,
Rudolf Berghammer
,
Hans Zierer
Acta Informatica
27
(3), 1989, pp. 217-245
A maximum entropy priority approximation for a stable G/G/1 queue
D. Kouvatsos
,
N. Tabet-Aouel
Acta Informatica
27
, 1989, pp. 247-286
Temporal predicate transformers and fair termination
J.M. Morris
Acta Informatica
27
, 1990, pp. 287-313
Partial (set) 2-structures. Part I: Basic notions and the representation problem
A. Ehrenfeucht
,
G. Rozenberg
Acta Informatica
27
, 1990, pp. 315-342
Partial (set) 2-structures Part II: State spaces of concurrent systems
A. Ehrenfeucht
,
G. Rozenberg
Acta Informatica
27
, 1990, pp. 343-368
On efficient implementation of an approximation algorithm for the Steiner tree problem
Lawrence T. Kou
Acta Informatica
27
, 1990, pp. 369-380
Hiding in stream semantics of uniform concurrency
J.-J.Ch. Meyer
,
E.-R. Olderog
Acta Informatica
27
, 1990, pp. 381-397
The complexity of graph languages generated by hyperedge replacement
Clemens Lautemann
Acta Informatica
27
, 1990, pp. 399-421
Maintaining range trees in secondary memory. Part I: Partitions
Mark H. Overmars
,
Michiel H.M. Smid
,
Mark T. de Berg
,
Marc J. van Kreveld
Acta Informatica
27
, 1990, pp. 423-452
Maintaining range trees in secondary memory. Part II: Lower bounds
Michiel H.M. Smid
,
Mark H. Overmars
Acta Informatica
27
, 1990, pp. 453-480
Date refinement by calculation
Carroll Morgan
,
P.H.B. Gardiner
Acta Informatica
27
, 1990, pp. 481-503
Referential transparency, definiteness and unfoldability
Harald Sndergaard
,
Peter Sestoft
Acta Informatica
27
, 1990, pp. 505-517
Optimum checkpoints with age dependent failures
Erol Gelenbe
,
Marisela Hernández
Acta Informatica
27
, 1990, pp. 519-531
Representing CCS programs by finite predicate/transition nets
Dirk Taubner
Acta Informatica
27
, 1990, pp. 533-565
Attribute storage optimization by stacks
Joost Engelfriet
,
Willem de Jong
Acta Informatica
27
, 1990, pp. 567-581
Seiten 1
2
>