Volume 55,
Number 1,
April 2005
Volume 55,
Number 2,
May 2005
- Micah Adler, Adi Rosén:
Tight bounds for the performance of Longest In System on DAGs.
101-112
- William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén:
Competitive queue policies for differentiated services.
113-141
- Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna:
The Guessing Secrets problem: a probabilistic approach.
142-176
- Benoit Larose, Cynthia Loten, László Zádori:
A polynomial-time algorithm for near-unanimity graphs.
177-191
- Yair Bartal, Manor Mendel:
Randomized k-server algorithms for growth-rate bounded graphs.
192-202
Copyright © Mon Nov 2 21:43:02 2009
by Michael Ley (ley@uni-trier.de)