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=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Random sprouts as internet models, and Pólya processes
Hosam M. Mahmoud
Acta Informatica
41
(1), 2004, pp. 1-18
An axiomatization of graphs
Symeon Bozapalidis
,
Antonios Kalampakas
Acta Informatica
41
(1), 2004, pp. 19-61
Erratum to ''The size of random bucket trees via urn models''
Hosam M. Mahmoud
Acta Informatica
41
(1), 2004, pp. 63-63
Maintaining mobile transactional consistency in hybrid broadcast environments
SungSuk Kim
,
Sun Ok Yang
,
SangKeun Lee
Acta Informatica
41
(2-3), 2004, pp. 65-81
Project scheduling with irregular costs: Complexity, approximability, and algorithms
Alexander Grigoriev
,
Gerhard J. Woeginger
Acta Informatica
41
(2-3), 2004, pp. 83-97
Limit laws for terminal nodes in random circuits with restricted fan-out: A family of graphs generalizing binary search trees
Hosam Mahmoud
,
Tatsuie Tsukiji
Acta Informatica
41
(2-3), 2004, pp. 99-110
Trading polarizations for labels in
P
systems with active membranes
Artiom Alhazov
,
Linqiang Pan
,
Gheorghe Păun
Acta Informatica
41
(2-3), 2004, pp. 111-144
P
systems with symport/antiport simulating counter automata
Pierluigi Frisco
,
Hendrik Jan Hoogeboom
Acta Informatica
41
(2-3), 2004, pp. 145-170
Three-element codes with one
d
-primitive word
Zheng-Zhu Li
,
Y.S. Tsai
Acta Informatica
41
(2-3), 2004, pp. 171-180
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