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=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Automata-based verification of programs with tree updates
Peter Habermehl
,
Radu Iosif
,
Tomás̑ Vojnar
Acta Informatica
47
(1), 2011, pp. 1-31
Symmetry and partial order reduction techniques in model checking Rebeca
Mohammad Mahdi Jaghoori
,
Marjan Sirjani
,
Mohammad Reza Mousavi
,
Ehsan Khamespanah
,
Ali Movaghar
Acta Informatica
47
(1), 2011, pp. 33-66
M/M/1 retrial queue with working vacations
Tien Van Do
Acta Informatica
47
(1), 2011, pp. 67-75
Embedding mappings and splittings with applications
Rudolf Berghammer
,
Michael Winter
Acta Informatica
47
(2), 2011, pp. 77-110
On the observational theory of the CPS-calculus
Massimo Merro
Acta Informatica
47
(2), 2011, pp. 111-132
Small universal accepting hybrid networks of evolutionary processors
Remco Loos
,
Florin Manea
,
Victor Mitrana
Acta Informatica
47
(2), 2011, pp. 133-146
Lifting non-finite axiomatizability results to extensions of process algebras
Luca Aceto
,
Wan Fokkink
,
Anna Ingolfsdottir
,
MohammadReza Mousavi
Acta Informatica
47
(3), 2011, pp. 147-177
LR error repair using the A* algorithm
Ik-Soon Kim
,
Kwangkeun Yi
Acta Informatica
47
(3), 2011, pp. 179-207
A note on autodense related languages
Chen-Ming Fan
,
C.C. Huang
,
H.J. Shyr
,
Kuo-Hsiang Chen
Acta Informatica
47
(4), 2011, pp. 209-219
Quantum loop programs
Mingsheng Ying
,
Yuan Feng
Acta Informatica
47
(4), 2011, pp. 221-250
On regular temporal logics with past
Christian Dax
,
Felix Klaedtke
,
Martin Lange
Acta Informatica
47
(4), 2011, pp. 251-277
Reachability results for timed automata with unbounded data structures
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Angelo Troina
Acta Informatica
47
(5-6), 2011, pp. 279-311
Randomization adaptive self-stabilization
Shlomi Dolev
,
Nir Tzachar
Acta Informatica
47
(5-6), 2011, pp. 313-323
How to allocate review tasks for robust ranking
Dorit S. Hochbaum
,
Asaf Levin
Acta Informatica
47
(5-6), 2011, pp. 325-345
A note on pure codes
C.C. Huang
Acta Informatica
47
(5-6), 2011, pp. 347-357
A theoretical comparison of LRU and LRU-K
Joan Boyar
,
Martin R. Ehmsen
,
Jens S. Kohrt
,
Kim S. Larsen
Acta Informatica
47
(7-8), 2011, pp. 359-374
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy
Leah Epstein
Acta Informatica
47
(7-8), 2011, pp. 375-389
On stateless deterministic restarting automata
Martin Kutrib
,
Hartmut Messerschmidt
,
Friedrich Otto
Acta Informatica
47
(7-8), 2011, pp. 391-412
A note on prefix primitive words
Chen-Ming Fan
,
C.C. Huang
Acta Informatica
47
(7-8), 2011, pp. 413-423