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 YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On-line coloring and cliques covering for
K_{s,t}
-free graphs
Iwona Cieślik
Acta Informatica
42
(1), 2005, pp. 1-20
Enhanced prefetching and caching strategies for single- and multi-disk systems
Markus Büttner
Acta Informatica
42
(1), 2005, pp. 21-42
N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets
Floris Geerts
,
Lieven Smits
,
Jan Van den Bussche
Acta Informatica
42
(1), 2005, pp. 43-56
Exponentially decreasing number of operations in balanced trees
Lars Jacobsen
,
Kim Skak Larsen
Acta Informatica
42
(1), 2005, pp. 57-78
Genericity and the
\pi
-calculus
Martin Berger
,
Kohei Honda
,
Nobuko Yoshida
Acta Informatica
42
(2-3), 2005, pp. 83-141
MOMI: A calculus for mobile mixins
Lorenzo Bettini
,
Viviana Bono
,
Betti Venneri
Acta Informatica
42
(2-3), 2005, pp. 143-190
Subtyping for session types in the pi calculus
Simon Gay
,
Malcolm Hole
Acta Informatica
42
(2-3), 2005, pp. 191-225
SAFEDPI: A language for controlling mobile code
Matthew Hennessy
,
Julian Rathke
,
Nobuko Yoshida
Acta Informatica
42
(4-5), 2005, pp. 227-290
Type-based information flow analysis for the
\pi
-calculus
Naoki Kobayashi
Acta Informatica
42
(4-5), 2005, pp. 291-347
A general framework for types in graph rewriting
Barbara König
Acta Informatica
42
(4-5), 2005, pp. 349-388
Type-based hot swapping of running modules
Dominic Duggan
Acta Informatica
41
(4-5), 2005, pp. 181-220
A deterministic skip list for
k
-dimensional range search
Michael G. Lamoureux
,
Bradford G. Nickerson
Acta Informatica
41
(4-5), 2005, pp. 221-255
Hybrid networks of evolutionary processors are computationally complete
Erzsébet Csuhaj-Varjú
,
Carlos Martín-Vide
,
Victor Mitrana
Acta Informatica
41
(4-5), 2005, pp. 257-272
Fast allocation and deallocation with an improved buddy system
Gerth Stlting Brodal
,
Erik D. Demaine
,
J. Ian Munro
Acta Informatica
41
(4-5), 2005, pp. 273-291
Families of automata characterizing context-sensitive languages
Christophe Morvan
,
Chloé Rispal
Acta Informatica
41
(4-5), 2005, pp. 293-314
Preemptive online algorithms for scheduling with machine cost
Yiwei Jiang
,
Yong He
Acta Informatica
41
(6), 2005, pp. 315-340
Optimal recovery schemes in fault tolerant distributed computing
Kamilla Klonowska
,
Hkan Lennerstad
,
Lars Lundberg
,
Charlie Svahnberg
Acta Informatica
41
(6), 2005, pp. 341-365
On the complexity of deciding typability in the relational algebra
Stijn Vansummeren
Acta Informatica
41
(6), 2005, pp. 367-381
The weakest specifunction
Yifeng Chen
,
J.W. Sanders
Acta Informatica
41
(7-8), 2005, pp. 383-414
The stuttering principle revisited
Antonín Kuc̑era
,
Jan Strejc̑ek
Acta Informatica
41
(7-8), 2005, pp. 415-434
Compiling quantum programs
Paolo Zuliani
Acta Informatica
41
(7-8), 2005, pp. 435-473
A comprehensive database schema integration method based on the theory of formal concepts
Ingo Schmitt
,
Gunter Saake
Acta Informatica
41
(7-8), 2005, pp. 475-524
\pi
-calculus with noisy channels
Mingsheng Ying
Acta Informatica
41
(9), 2005, pp. 525-593
Online square and cube packing
Leah Epstein
,
Rob van Stee
Acta Informatica
41
(9), 2005, pp. 595-606