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
  Electronic Edition (link) BibTeX
• Michael Filaseta, Douglas B. Meade:
  Irreducibility testing of lacunary 0, 1-polynomials. 21-28
  Electronic Edition (link) BibTeX
• Petra Sparl, Janez Zerovnik:
  2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. 29-41
  Electronic Edition (link) BibTeX
• Yoo Ah Kim:
  Data migration to minimize the total completion time. 42-57
  Electronic Edition (link) BibTeX
• Graham Cormode, S. Muthukrishnan:
  An improved data stream summary: the count-min sketch and its applications. 58-75
  Electronic Edition (link) BibTeX
• Reuven Bar-Yehuda, Guy Even, Shimon Shahar:
  On approximating a geometric prize-collecting traveling salesman problem with time windows. 76-92
  Electronic Edition (link) BibTeX
• Moni Naor:
  On fairness in the carpool problem. 93-98
  Electronic Edition (link) BibTeX

Volume 55, Number 2, May 2005

• Micah Adler, Adi Rosén:
  Tight bounds for the performance of Longest In System on DAGs. 101-112
  Electronic Edition (link) BibTeX
• William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén:
  Competitive queue policies for differentiated services. 113-141
  Electronic Edition (link) BibTeX
• Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna:
  The Guessing Secrets problem: a probabilistic approach. 142-176
  Electronic Edition (link) BibTeX
• Benoit Larose, Cynthia Loten, László Zádori:
  A polynomial-time algorithm for near-unanimity graphs. 177-191
  Electronic Edition (link) BibTeX
• Yair Bartal, Manor Mendel:
  Randomized k-server algorithms for growth-rate bounded graphs. 192-202
  Electronic Edition (link) BibTeX