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=Inf.~Comput. AND Volume=196
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Completely iterative algebras and completely iterative monads
Stefan Milius
Information and Computation
196
(1), 2005, pp. 1-41
Fast approximate PCPs for multidimensional bin-packing problems
Tug̑kan Batu
,
Ronitt Rubinfeld
,
Patrick White
Information and Computation
196
(1), 2005, pp. 42-56
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
Zhiyi Tan
,
Yong He
,
Leah Epstein
Information and Computation
196
(1), 2005, pp. 57-70
Lower bounds on systolic gossip
Michele Flammini
,
Stéphane Pérennès
Information and Computation
196
(2), 2005, pp. 71-94
Decidable call-by-need computations in term rewriting
Irène Durand
,
Aart Middeldorp
Information and Computation
196
(2), 2005, pp. 95-126
Secrecy and group creation
Luca Cardelli
,
Giorgio Ghelli
,
Andrew D. Gordon
Information and Computation
196
(2), 2005, pp. 127-155