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=J. Algorithms AND Volume=55
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An online throughput-competitive algorithm for multicast routing and admission control
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
Journal of Algorithms
55
(1), 2005, pp. 1-20
Irreducibility testing of lacunary 0,1-polynomials
Michael Filaseta
,
Douglas B. Meade
Journal of Algorithms
55
(1), 2005, pp. 21-28
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs
Petra S̑parl
,
Janez Z̑erovnik
Journal of Algorithms
55
(1), 2005, pp. 29-41
Data migration to minimize the total completion time
Yoo-Ah Kim
Journal of Algorithms
55
(1), 2005, pp. 42-57
An improved data stream summary: The count-min sketch and its aplications
Graham Cormode
,
S. Muthukrishnan
Journal of Algorithms
55
(1), 2005, pp. 58-75
On approximating a geometric prize-collecting Traveling Salesman problem with time windows
Reuven Bar-Yehuda
,
Guy Even
,
Shimon (Moni) Shahar
Journal of Algorithms
55
(1), 2005, pp. 76-92
On fairness in the carpool problem
Moni Naor
Journal of Algorithms
55
(1), 2005, pp. 93-98
Tight bounds for the performance of Longest In System on DAGs
Micah Adler
,
Adi Rosén
Journal of Algorithms
55
(2), 2005, pp. 101-112
Competitive queue policies for differentiated services
William A. Aiello
,
Yishay Mansour
,
S. Rajagopolan
,
Adi Rosén
Journal of Algorithms
55
(2), 2005, pp. 113-141
The Guessing Secrets problem: A probabilistic approach
Alberto Del Lungo
,
Guy Louchard
,
Claudio Marini
,
Franco Montagna
Journal of Algorithms
55
(2), 2005, pp. 142-176
A polynomial-time algorithm for near-unanimity graphs
Benoit Larose
,
Cynthia Loten
,
László Zádori
Journal of Algorithms
55
(2), 2005, pp. 177-191
Randomized
k
-server algorithms for growth-rate bounded graphs
Yair Bartal
,
Manor Mendel
Journal of Algorithms
55
(2), 2005, pp. 192-202