Journals in DBLP
J. Algorithms 2004, volume: 51, number: 1
Jonathan H. Badger , Paul E. Kearney , Ming Li , John Tsang , Tao Jiang Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2004, v:51, n:1, pp:1-14 [Journal ] Bernadette Charron-Bost , André Schiper Uniform consensus is harder than consensus. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2004, v:51, n:1, pp:15-37 [Journal ] Krzysztof Diks , Pierre Fraigniaud , Evangelos Kranakis , Andrzej Pelc Tree exploration with little memory. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2004, v:51, n:1, pp:38-63 [Journal ] George F. Georgakopoulos Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2004, v:51, n:1, pp:64-76 [Journal ] Stavros D. Nikolopoulos , Leonidas Palios Parallel algorithms for P_{4} -comparability graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2004, v:51, n:1, pp:77-104 [Journal ]