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=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Extending the accommodating function
Joan Boyar
,
Lene M. Favrholdt
,
Kim S. Larsen
,
Morten N. Nielsen
Acta Informatica
40
(1), 2003, pp. 3-35
Pipelines: Modelling a software architecture through relations
Ernst-Erich Doberkat
Acta Informatica
40
(1), 2003, pp. 37-79
Element distinctness on one-tape Turing machines: A complete solution
Amir M. Ben-Amram
,
Omer Berkman
,
Holger Petersen
Acta Informatica
40
(2), 2003, pp. 81-94
Canonical prefixes of Petri net unfoldings
Victor Khomenko
,
Maciej Koutny
,
Walter Vogler
Acta Informatica
40
(2), 2003, pp. 95-118
Sticky-free and overhang-free DNA languages
Lila Kari
,
Stavros Konstantinidis
,
Elena Losseva
,
Geoff Wozniak
Acta Informatica
40
(2), 2003, pp. 119-157
Providing view synchrony for group communication services
N. Lesley
,
A. Fekete
Acta Informatica
40
(3), 2003, pp. 159-210
A distributed QoS-aware multicast routing protocol
Li Layuan
,
Li Chunlin
Acta Informatica
40
(3), 2003, pp. 211-233
Program reversals for evolutions with non-uniform step costs
Andrea Walther
Acta Informatica
40
(4), 2004, pp. 235-263
Specification transformers: A predicate transformer approach to composition
Michel Charpentier
,
K. Mani Chandy
Acta Informatica
40
(4), 2004, pp. 265-301
A bi-criterion single-machine scheduling problem with learning considerations
Wen-Chiung Lee
,
Chin-Chia Wu
,
Hua-Jung Sung
Acta Informatica
40
(4), 2004, pp. 303-315
Timed automata with urgent transitions
Roberto Barbuti
,
Luca Tesei
Acta Informatica
40
(5), 2004, pp. 317-347
Self-embedded context-free grammars with regular counterparts
Stefan Andrei
,
Wei-Ngan Chin
,
Salvador Valerio Cavadini
Acta Informatica
40
(5), 2004, pp. 349-365
Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
Yong He
,
Yiwei Jiang
Acta Informatica
40
(5), 2004, pp. 367-383
A new natural structural congruence in the pi-calculus with replication
Joost Engelfriet
,
Tjalling Gelsema
Acta Informatica
40
(6 - 7), 2004, pp. 385-430
Past is for free: On the complexity of verifying linear temporal properties with past
Nicolas Markey
Acta Informatica
40
(6 - 7), 2004, pp. 431-458
Reducing non-determinism in right nulled GLR parsers
Elizabeth Scott
,
Adrian Johnstone
Acta Informatica
40
(6 - 7), 2004, pp. 459-489
Trajectory-based codes
Michael Domaratzki
Acta Informatica
40
(6 - 7), 2004, pp. 491-527
On the equivalence and rewriting of aggregate queries
Stéphane Grumbach
,
Maurizio Rafanelli
,
Leonardo Tininini
Acta Informatica
40
(8), 2004, pp. 529-584
Exhaustive generation of combinatorial objects by ECO
Silvia Bacchelli
,
Elena Barcucci
,
Elisabetta Grazzini
,
Elisa Pergola
Acta Informatica
40
(8), 2004, pp. 585-602
Erratum to ''The complexity of drawing trees nicely''
Thorsten Akkerman
,
Christoph Buchheim
,
Michael Jünger
,
Daniel Teske
Acta Informatica
40
(8), 2004, pp. 603-607
Self-stabilizing group communication in directed networks
Shlomi Dolev
,
Elad Schiller
Acta Informatica
40
(9), 2004, pp. 609-636
On best transitive approximations to simple graphs
Steven Delvaux
,
Leon Horsten
Acta Informatica
40
(9), 2004, pp. 637-655
Approximation schemes for the min-max starting time problem
Leah Epstein
,
Tamir Tassa
Acta Informatica
40
(9), 2004, pp. 657-674