
Journals in DBLP
J. Algorithms 2005, volume: 55, number: 2
 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:101112 [Journal]
 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:113141 [Journal]
 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:142176 [Journal]
 Benoit Larose, Cynthia Loten, László Zádori
A polynomialtime algorithm for nearunanimity graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:55, n:2, pp:177191 [Journal]
 Yair Bartal, Manor Mendel
Randomized kserver algorithms for growthrate bounded graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:55, n:2, pp:192202 [Journal]
