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=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Weakly independent database schemes
Ke Wang
,
Weining Zhang
,
Siu-Cheng Chau
Acta Informatica
34
(1), 1997, pp. 1-22
Net-based control versus rational control - The relation between ITNC vector languages and rational relations
N.W. Keesmaat
,
H.C.M. Kleijn
Acta Informatica
34
(1), 1997, pp. 23-57
Minimal equational representations of recognizable tree languages
Zoltán Fülöp
,
Sándor Vágvölgyi
Acta Informatica
34
(1), 1997, pp. 59-84
Decidability of model checking for infinite-state concurrent systems
Javier Esparza
Acta Informatica
34
(2), 1997, pp. 85-107
Distance measures for point sets and their computation
Thomas Eiter
,
Heikki Mannila
Acta Informatica
34
(2), 1997, pp. 109-133
The additivity problem for functional dependencies in incomplete relations
Mark Levene
,
George Loizou
Acta Informatica
34
(2), 1997, pp. 135-149
Computational fractal geometry with WFA
Karel Culik II
,
Jarkko Kari
Acta Informatica
34
(2), 1997, pp. 151-166
Relational database constraints as counterexamples
Levent V. Orman
Acta Informatica
34
(3), 1997, pp. 167-189
Using graph coloring in an algebraic compiler
Teodor Rus
,
Sriram Pemmaraju
Acta Informatica
34
(3), 1997, pp. 191-209
A generalized distribution model for random recursive trees
Alexander Shapiro
Acta Informatica
34
(3), 1997, pp. 211-216
On the system of word equations
x^i_1 x^i_2 \cdots x^i_m = y^i_1 y^i_2 \cdots y^i_n (i=1,2, ...)
in a free monoid
Ismo Hakala
,
Juha Kortelainen
Acta Informatica
34
(3), 1997, pp. 217-230
Reduced constants for simple cycle graph separation
Hristo N. Djidjev
,
Shankar M. Venkatesan
Acta Informatica
34
(3), 1997, pp. 231-243
Efficient algorithms for the transformation between different types of binary decision diagrams
Petr Savický
,
Ingo Wegener
Acta Informatica
34
(4), 1997, pp. 245-256
On the interdependence between shuffle and crossing-over operations
Victor Mitrana
Acta Informatica
34
(4), 1997, pp. 257-266
Dynamic
LL(k)
parsing
Arnd Russ̈mann
Acta Informatica
34
(4), 1997, pp. 267-289
Locality based semantics for process algebras
Flavio Corradini
,
Rocco de Nicola
Acta Informatica
34
(4), 1997, pp. 291-324
A hierarchy of the class of apex
NLC
graph languages by bounds on the number of nonterminal nodes in productions
Koichi Yamazaki
Acta Informatica
34
(5), 1997, pp. 325-335
Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs
Y. Daniel Liang
,
Maw-Shang Chang
Acta Informatica
34
(5), 1997, pp. 337-346
Implementing Daubechies wavelet transform with weighted finite automata
Karel Culik II
,
Simant Dube
Acta Informatica
34
(5), 1997, pp. 347-366
Fundamentals of modelling concurrency using discrete relational structures
Ryszard Janicki
,
Maciej Koutny
Acta Informatica
34
(5), 1997, pp. 367-388
A hierarchy of uniquely parsable grammar classes and deterministic acceptors
Kenichi Morita
,
Noritaka Nishihara
,
Yasunori Yamamoto
,
Zhiguo Zhang
Acta Informatica
34
(5), 1997, pp. 389-410
Performance analysis of parallel programs based on directed acyclic graphs
Georg Trogemann
,
Matthias Gente
Acta Informatica
34
(6), 1997, pp. 411-428
An optimal emulator and VLSI layout for complete binary trees
Kemal Efe
,
Nancy Eleser
Acta Informatica
34
(6), 1997, pp. 429-447
Algebraic computational models of OR-parallel execution of Prolog
R. Barbuti
,
N. de Francesco
,
A. Santone
Acta Informatica
34
(6), 1997, pp. 449-489
A survey of stream processing
Robert Stephens
Acta Informatica
34
(7), 1997, pp. 491-541
Seiten 1
2
>