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=49
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient algorithm for finding ideal schedules
Edward G., Jr. Coffman
,
Dariusz Dereniowski
,
Wiesƚaw Kubiak
Acta Informatica
49
(1), 2012, pp. 1-14
Using transition set sequences to partition behaviors of Petri nets
Yunhe Wang
,
Li Jiao
Acta Informatica
49
(1), 2012, pp. 15-28
Equational weighted tree transformations
Symeon Bozapalidis
,
Zoltán Fülöp
,
George Rahonis
Acta Informatica
49
(1), 2012, pp. 29-52
Erratum to ``Avoidable binary patterns in partial words''
F. Blanchet-Sadri
,
Robert Mercaş
,
Sean Simmons
,
Eric Weissenstein
Acta Informatica
49
(1), 2012, pp. 53-54
Nonterminal complexity of one-sided random context grammars
Alexander Meduna
,
Petr Zemek
Acta Informatica
49
(2), 2012, pp. 55-68
A trace-based service semantics guaranteeing deadlock freedom
Christian Stahl
,
Walter Vogler
Acta Informatica
49
(2), 2012, pp. 69-103
The identity problem of finitely generated bi-ideals
A. Lorencs
Acta Informatica
49
(2), 2012, pp. 105-115
``Backward'' coinduction, Nash equilibrium and the rationality of escalation
Pierre Lescanne
,
Matthieu Perrinel
Acta Informatica
49
(3), 2012, pp. 117-137
Instruction sequence processing operators
J.A. Bergstra
,
C.A. Middelburg
Acta Informatica
49
(3), 2012, pp. 139-172
Least common container of tree pattern queries and its applications
Junhu Wang
,
Jeffrey Xu Yu
,
Chaoyi Pang
,
Chengfei Liu
Acta Informatica
49
(3), 2012, pp. 173-202
Stochastic game logic
Christel Baier
,
Tomás̑ Brázdil
,
Marcus Größer
,
Antonín Kuc̑era
Acta Informatica
49
(4), 2012, pp. 203-224
First-order logics: Some characterizations and closure properties
Christian Choffrut
,
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
Acta Informatica
49
(4), 2012, pp. 225-248
On timed alternating simulation for concurrent timed games
Laura Bozzelli
,
Axel Legay
,
Sophie Pinchinat
Acta Informatica
49
(4), 2012, pp. 249-279
Prefix-primitive annihilators of languages under some operations
Chen-Ming Fan
,
Cheng-Chih Huang
,
Christine Chifen Tseng
,
Jen-Tse Wang
Acta Informatica
49
(5), 2012, pp. 281-293
An algorithmic study of switch graphs
Bastian Katz
,
Ignaz Rutter
,
Gerhard Woeginger
Acta Informatica
49
(5), 2012, pp. 295-312
Abstract reduction in directed model checking CCS processes
Antonella Santone
,
Gigliola Vaglini
Acta Informatica
49
(5), 2012, pp. 313-341
Algebras for iteration and infinite computations
Walter Guttmann
Acta Informatica
49
(5), 2012, pp. 343-359
Inefficiency of equilibria for the machine covering game on uniform machines
Zhiyi Tan
,
Long Wan
,
Qi Zhang
,
Wei Ren
Acta Informatica
49
(6), 2012, pp. 361-379
Finding vertex-surjective graph homomorphisms
Petr A. Golovach
,
Bernard Lidický
,
Barnaby Martin
,
Daniël Paulusma
Acta Informatica
49
(6), 2012, pp. 381-394
On the power of enzymatic numerical P systems
Cristian Ioan Vasile
,
Ana Brânduşa Pavel
,
Ioan Dumitrache
,
Gheorghe Pȃun
Acta Informatica
49
(6), 2012, pp. 395-412
Multi-tilde-bar expressions and their automata
Pascal Caron
,
Jean-Marc Champarnaud
,
Ludovic Mignot
Acta Informatica
49
(6), 2012, pp. 413-436
Disjunctive languages related to
p
-primitive words
Cao Chunhua
,
Yang Di
,
Liu Yin
Acta Informatica
49
(7-8), 2012, pp. 437-444
Distinguishing and relating higher-order and first-order processes by expressiveness
Xian Xu
Acta Informatica
49
(7-8), 2012, pp. 445-484
Does indirect addressing matter?
Michael Brand
Acta Informatica
49
(7-8), 2012, pp. 485-491