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
• 
  Bernadette Charron-Bost, André Schiper: Uniform consensus is harder than consensus. 15-37
• 
  Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc: Tree exploration with little memory. 38-63
• 
  George F. Georgakopoulos: Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees. 64-76
• 
  Stavros D. Nikolopoulos, Leonidas Palios: Parallel algorithms for P₄-comparability graphs. 77-104

Volume 51, Number 2, May 2004

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

last updated on Thu May 23 04:23:24 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page