Journals in DBLP

J. Algorithms
2005, volume: 55, number: 2

1. Micah Adler, Adi Rosén
   Tight bounds for the performance of Longest In System on DAGs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:55, n:2, pp:101-112 [Journal]
   
2. William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén
   Competitive queue policies for differentiated services. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:55, n:2, pp:113-141 [Journal]
   
3. Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna
   The Guessing Secrets problem: a probabilistic approach. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:55, n:2, pp:142-176 [Journal]
   
4. Benoit Larose, Cynthia Loten, László Zádori
   A polynomial-time algorithm for near-unanimity graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:55, n:2, pp:177-191 [Journal]
   
5. Yair Bartal, Manor Mendel
   Randomized k-server algorithms for growth-rate bounded graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:55, n:2, pp:192-202 [Journal]