Journal of Algorithms, Volume 51

Volume 51, Number 1, April 2004

• Jonathan H. Badger, Paul E. Kearney, Ming Li, John Tsang, Tao Jiang:
  Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme. 1-14
  Electronic Edition (link) BibTeX
• Bernadette Charron-Bost, André Schiper:
  Uniform consensus is harder than consensus. 15-37
  Electronic Edition (link) BibTeX
• Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc:
  Tree exploration with little memory. 38-63
  Electronic Edition (link) BibTeX
• George F. Georgakopoulos:
  Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees. 64-76
  Electronic Edition (link) BibTeX
• Stavros D. Nikolopoulos, Leonidas Palios:
  Parallel algorithms for P₄-comparability graphs. 77-104
  Electronic Edition (link) BibTeX

Volume 51, Number 2, May 2004

• Magnus Wahlström:
  Exact algorithms for finding minimum transversals in rank-3 hypergraphs. 107-121
  Electronic Edition (link) BibTeX
• Rasmus Pagh, Flemming Friche Rodler:
  Cuckoo hashing. 122-144
  Electronic Edition (link) BibTeX
• Amotz Bar-Noy, Grzegorz Malewicz:
  Establishing wireless conference calls under delay constraints. 145-169
  Electronic Edition (link) BibTeX
• Alois Panholzer, Helmut Prodinger, Marko Riedel:
  Permuting in place: analysis of two stopping rules. 170-184
  Electronic Edition (link) BibTeX
• Vincenzo Liberatore:
  Circular arrangements and cyclic broadcast scheduling. 185-215
  Electronic Edition (link) BibTeX