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=46
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On decidability of LTL model checking for process rewrite systems
Laura Bozzelli
,
Mojmír Kȓetínský
,
Vojtȇch Ȓehák
,
Jan Strejc̑ek
Acta Informatica
46
(1), 2009, pp. 1-28
Semi-synchronous transductions
Vince Bárány
Acta Informatica
46
(1), 2009, pp. 29-42
Exploiting colored Petri nets to decide on permutation admissibility
Rza Bashirov
,
Fabrice Kordon
,
Hüseyin Lort
Acta Informatica
46
(1), 2009, pp. 43-55
A complexity tradeoff in ranking-function termination proofs
Amir M. Ben-Amram
Acta Informatica
46
(1), 2009, pp. 57-72
A queue based mutual exclusion algorithm
Alex A. Aravind
,
Wim H. Hesselink
Acta Informatica
46
(1), 2009, pp. 73-86
A theory of structural stationarity in the
\pi
-Calculus
Roland Meyer
Acta Informatica
46
(2), 2009, pp. 87-137
The time complexity of typechecking tree-walking tree transducers
Joost Engelfriet
Acta Informatica
46
(2), 2009, pp. 139-154
Random walks for selected Boolean implication and equivalence problems
K. Subramani
,
Hong-Jian Lai
,
Xiaofeng Gu
Acta Informatica
46
(2), 2009, pp. 155-168
Hardness of equivalence checking for composed finite-state systems
Zdenȇk Sawa
,
Petr Janc̑ar
Acta Informatica
46
(3), 2009, pp. 169-191
On the closure of pattern expressions languages under intersection with regular languages
Cezar Câmpeanu
,
Nicolae Santean
Acta Informatica
46
(3), 2009, pp. 193-207
Liveness of a mutex algorithm in a fair process algebra
Flavio Corradini
,
Maria Rita Di Berardini
,
Walter Vogler
Acta Informatica
46
(3), 2009, pp. 209-235
A decomposition theorem for finite persistent transition systems
Eike Best
,
Philippe Darondeau
Acta Informatica
46
(3), 2009, pp. 237-254
Semantics, calculi, and analysis for object-oriented specifications
Achim D. Brucker
,
Burkhart Wolff
Acta Informatica
46
(4), 2009, pp. 255-284
The maximum gain of increasing the number of preemptions in multiprocessor scheduling
Kamilla Klonowska
,
Lars Lundberg
,
Håkan Lennerstad
Acta Informatica
46
(4), 2009, pp. 285-295
Correctness proof of a database replication protocol under the perspective of the I/O automaton model
José Enrique Armendáriz-Iñigo
,
José Ramón González de Mendívil
,
José Ramón Garitagoitia
,
Francesc D. Muñoz-Escoí
Acta Informatica
46
(4), 2009, pp. 297-330
A theory of ultimately periodic languages and automata with an application to time granularity
Davide Bresolin
,
Angelo Montanari
,
Gabriele Puppis
Acta Informatica
46
(5), 2009, pp. 331-360
Final and sequential behaviours of M-automata
Gabriel Ciobanu
,
Sergiu Rudeanu
Acta Informatica
46
(5), 2009, pp. 361-374
Machine structure oriented control code logic
J.A. Bergstra
,
C.A. Middelburg
Acta Informatica
46
(5), 2009, pp. 375-401
Reasoning about faulty quantum programs
Paolo Zuliani
Acta Informatica
46
(6), 2009, pp. 403-432
STG decomposition strategies in combination with unfolding
Victor Khomenko
,
Mark Schaefer
,
Walter Vogler
,
Ralf Wollowski
Acta Informatica
46
(6), 2009, pp. 433-474
Preserving key in XML data transformation
Md. Sumon Shahriar
,
Jixue Liu
Acta Informatica
46
(7), 2009, pp. 475-507
On the power of deep pushdown stacks
Argimiro Arratia Quesada
,
Iain A. Stewart
Acta Informatica
46
(7), 2009, pp. 509-531
On regular tree languages and deterministic pushdown automata
Jan Janous̑ek
,
Boȓivoj Melichar
Acta Informatica
46
(7), 2009, pp. 533-547
Early action in an Earley parser
John Aycock
,
Angelo Borsotti
Acta Informatica
46
(8), 2009, pp. 549-559
Extended multi bottom-up tree transducers
Joost Engelfriet
,
Eric Lilin
,
Andreas Maletti
Acta Informatica
46
(8), 2009, pp. 561-590
Seiten 1
2
>