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=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Category-theoretic fibration as an abstraction mechanism in information systems
Robert M. Colomb
,
C.N.G. Dampney
,
Michael Johnson
Acta Informatica
38
(1), 2001, pp. 1-44
Correctness of dataflow and systolic algorithms using algebras of streams
K. Meinke
,
L.J. Steggles
Acta Informatica
38
(1), 2001, pp. 45-88
Timed tree automata with an application to temporal logic
Salvatore La Torre
,
Margherita Napoli
Acta Informatica
38
(2), 2001, pp. 89-116
Group weighted finite transducers
Masami Ito
,
Carlos Martín-Vide
,
Victor Mitrana
Acta Informatica
38
(2), 2001, pp. 117-129
Tree-systems of morphisms
Jürgen Dassow
,
Gheorghe Păun
,
Gabriel Thierrin
,
Sheng Yu
Acta Informatica
38
(2), 2001, pp. 131-153
Process algebra with action dependencies
Arend Rensink
,
Heike Wehrheim
Acta Informatica
38
(3), 2001, pp. 155-234
Minimally adequate teacher synthesizes statechart diagrams
Erkki Mäkinen
,
Tarja Systä
Acta Informatica
38
(4), 2001, pp. 235-259
The variance of the height of digital search trees
Michael Drmota
Acta Informatica
38
(4), 2001, pp. 261-276
Axiomatising timed automata
Huimin Lin
,
Wang Yi
Acta Informatica
38
(4), 2001, pp. 277-305
Impurity measures in databases
Dan A. Simkovici
,
Dana Cristofor
,
Laurentiu Cristofor
Acta Informatica
38
(5), 2001, pp. 307-324
Containment and disjointedness in partitioned normal form relations
Jixue Liu
,
Millist Vincent
Acta Informatica
38
(5), 2001, pp. 325-342
An assertional criterion for atomicity
Wim H. Hesselink
Acta Informatica
38
(5), 2001, pp. 343-366
Object type constructors
Dominic Duggan
Acta Informatica
38
(6), 2001, pp. 367-408
Words, univalent factors, and boxes
Arturo Carpi
,
Aldo de Luca
,
Stefano Varricchio
Acta Informatica
38
(6), 2001, pp. 409-436
Deriving and paraphrasing information grammars using object-oriented analysis models
P.J.M. Frederiks
,
T.P. van der Weide
Acta Informatica
38
(7), 2001, pp. 437-488
A general procedure to check conjunctive query containment
Miguel R. Penabad
,
Nieves R. Brisaboa
,
Héctor J. Hernández
,
José R. Paramá
Acta Informatica
38
(7), 2001, pp. 489-529
Automatic verification of concurrent systems using a formula-based compositional approach
Antonella Santone
Acta Informatica
38
(8), 2001, pp. 531-564
Relaxed red-black trees with group updates
Kim S. Larsen
Acta Informatica
38
(8), 2001, pp. 565-586
On the non-approximability of points-to analysis
Venkatesan T. Chakaravarthy
,
Susan Horwitz
Acta Informatica
38
(8), 2001, pp. 587-598
Bases for closed sets of implicants and implicates in temporal logic
P. Cordero
,
M. Enciso
,
I.P. de Guzmán
Acta Informatica
38
(9), 2001, pp. 599-619
Adding a path connectedness operator to
FO
+ poly (linear)
Chris Giannella
,
Dirk Van Gucht
Acta Informatica
38
(9), 2001, pp. 621-648
Formal properties of XML grammars and languages
Jean Berstel
,
Luc Boasson
Acta Informatica
38
(9), 2001, pp. 649-671
Packing rectangles in a strip
E.G., Jr. Coffman
,
Peter J. Downey
,
Peter Winkler
Acta Informatica
38
(10), 2002, pp. 673-693
Membrane systems with promoters/inhibitors
Paolo Bottoni
,
Carlos Martín-Vide
,
Gheorghe Păun
,
Grzegorz Rozenberg
Acta Informatica
38
(10), 2002, pp. 695-720
Generalized normal form for rewriting
P
systems
Mutyam Madhu
,
Kamala Krithivasan
Acta Informatica
38
(10), 2002, pp. 721-734
Seiten 1
2
>