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=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some properties of the disjunctive languages contained in
Q
Zheng-Zhu Li
,
Y.S. Tsai
Acta Informatica
48
(1), 2011, pp. 1-18
A characterization of rational D0L power series
Juha Honkala
Acta Informatica
48
(1), 2011, pp. 19-24
Avoidable binary patterns in partial words
F. Blanchet-Sadri
,
Robert Mercaş
,
Sean Simmons
,
Eric Weissenstein
Acta Informatica
48
(1), 2011, pp. 25-41
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
Victor Mitrana
,
Cristina Tîrnȃucȃ
Acta Informatica
48
(1), 2011, pp. 43-50
Efficient systematic clustering method for
k
-anonymization
Md. Enamul Kabir
,
Hua Wang
,
Elisa Bertino
Acta Informatica
48
(1), 2011, pp. 51-66
Nonatomic dual bakery algorithm with bounded tokens
Alex A. Aravind
,
Wim H. Hesselink
Acta Informatica
48
(2), 2011, pp. 67-96
Testing for refinement in Circus
Ana Cavalcanti
,
Marie-Claude Gaudel
Acta Informatica
48
(2), 2011, pp. 97-147
One-sided random context grammars
Alexander Meduna
,
Petr Zemek
Acta Informatica
48
(3), 2011, pp. 149-163
MAT learners for tree series: An abstract data type and two realizations
Frank Drewes
,
Johanna Högberg
,
Andreas Maletti
Acta Informatica
48
(3), 2011, pp. 165-189
Refined typing to localize the impact of forced strictness on free theorems
Daniel Seidel
,
Janis Voigtländer
Acta Informatica
48
(3), 2011, pp. 191-211
Connectivity of workflow nets: The foundations of stepwise verification
Artem Polyvyanyy
,
Matthias Weidlich
,
Mathias Weske
Acta Informatica
48
(4), 2011, pp. 213-242
A Markovian queue with varying number of servers and applications to the performance comparison of HSDPA user equipment
Tien Van Do
,
Ram Chakka
,
Nam H. Do
,
László Pap
Acta Informatica
48
(4), 2011, pp. 243-269
Multi-letter quantum finite automata: Decidability of the equivalence and minimization of states
Daowen Qiu
,
Lvzhou Li
,
Xiangfu Zou
,
Paulo Mateus
,
Jozef Gruska
Acta Informatica
48
(5-6), 2011, pp. 271-290
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
Markus N. Rabe
,
Sven Schewe
Acta Informatica
48
(5-6), 2011, pp. 291-315
CHAP and rewrite components
Sándor Vágvölgyi
Acta Informatica
48
(5-6), 2011, pp. 317-361
Correct hardware synthesis - An algebraic approach
Juan Perna
,
Jim Woodcock
,
Augusto Sampaio
,
Juliano Iyoda
Acta Informatica
48
(7-8), 2011, pp. 363-396
On
\alpha{2} - v{2}
products of automata
Pál Dömösi
,
György Maróti
Acta Informatica
48
(7-8), 2011, pp. 397-408
Solving a weak
NP
-complete problem in polynomial time by using mutual mobile membrane systems
Bogdan Aman
,
Gabriel Ciobanu
Acta Informatica
48
(7-8), 2011, pp. 409-415
The query complexity of estimating weighted averages
Amit Chakrabarti
,
Venkatesan Guruswami
,
Andrew Wirth
,
Anthony Wirth
Acta Informatica
48
(7-8), 2011, pp. 417-426