


default search action
Journal of Algorithms, Volume 55
Volume 55, Number 1, April 2005
- Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin:

An online throughput-competitive algorithm for multicast routing and admission control. 1-20 - Michael Filaseta, Douglas B. Meade:

Irreducibility testing of lacunary 0, 1-polynomials. 21-28 - Petra Sparl, Janez Zerovnik

:
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. 29-41 - Yoo Ah Kim:

Data migration to minimize the total completion time. 42-57 - Graham Cormode

, S. Muthukrishnan:
An improved data stream summary: the count-min sketch and its applications. 58-75 - Reuven Bar-Yehuda, Guy Even, Shimon Shahar:

On approximating a geometric prize-collecting traveling salesman problem with time windows. 76-92 - Moni Naor:

On fairness in the carpool problem. 93-98
Volume 55, Number 2, May 2005
- Micah Adler, Adi Rosén:

Tight bounds for the performance of Longest In System on DAGs. 101-112 - William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén:

Competitive queue policies for differentiated services. 113-141 - Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna:

The Guessing Secrets problem: a probabilistic approach. 142-176 - Benoît Larose, Cynthia Loten, László Zádori:

A polynomial-time algorithm for near-unanimity graphs. 177-191 - Yair Bartal, Manor Mendel:

Randomized k-server algorithms for growth-rate bounded graphs. 192-202

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














