A note on models for non-probabilistic analysis of packet switching networksROSEN, Adi.Information processing letters. 2002, Vol 84, Num 5, pp 237-240, issn 0020-0190, 4 p.Article

Tight bounds for the performance of Longest in System on DAGsADLER, Micah; ROSEN, Adi.Journal of algorithms (Print). 2005, Vol 55, Num 2, pp 101-112, issn 0196-6774, 12 p.Article

Ω(log n) lower bounds on the amount of randomness in 2-private computationGAL, Anna; ROSEN, Adi.SIAM journal on computing (Print). 2005, Vol 34, Num 4, pp 946-959, issn 0097-5397, 14 p.Article

DISTRIBUTED APPROXIMATE MATCHINGLOTKER, Zvi; PATT-SHAMIR, Boaz; ROSEN, Adi et al.SIAM journal on computing (Print). 2010, Vol 39, Num 2, pp 445-460, issn 0097-5397, 16 p.Article

Time-constrained scheduling of weighted packets on trees and meshesADLER, Micah; KHANNA, Sanjeev; RAJARAMAN, Rajmohan et al.Algorithmica. 2003, Vol 36, Num 2, pp 123-152, issn 0178-4617, 30 p.Article

Competitive queue policies for differentiated servicesAIELLO, William A; MANSOUR, Yishay; RAJAGOPOLAN, S et al.Journal of algorithms (Print). 2005, Vol 55, Num 2, pp 113-141, issn 0196-6774, 29 p.Article

Online computation with adviceEMEK, Yuval; FRAIGNIAUD, Pierre; KORMAN, Amos et al.Theoretical computer science. 2011, Vol 412, Num 24, pp 2642-2656, issn 0304-3975, 15 p.Article