Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("ROSEN, Adi")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 14 of 14

  • Page / 1

Export

Selection :

  • and

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

Scheduling policies for CIOQ switchesKESSELMAN, Alex; ROSEN, Adi.Journal of algorithms (Print). 2006, Vol 60, Num 1, pp 60-83, issn 0196-6774, 24 p.Article

A theorem on sensitivity and applications in private computationGAL, Anna; ROSEN, Adi.SIAM journal on computing (Print). 2002, Vol 31, Num 5, pp 1424-1437, issn 0097-5397, 14 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

Tight bounds for the performance of longest-in-system on DAGsADLER, Micah; ROSEN, Adi.Lecture notes in computer science. 2002, pp 88-99, issn 0302-9743, isbn 3-540-43283-3Conference Paper

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

On the additive constant of the k-server Work Function AlgorithmEMEK, Yuval; FRAIGNIAUD, Pierre; KORMAN, Amos et al.Information processing letters. 2010, Vol 110, Num 24, pp 1120-1123, issn 0020-0190, 4 p.Article

New stability results for adversarial queuingLOTKER, Zvi; PATT-SHAMIR, Boaz; ROSEN, Adi et al.SIAM journal on computing (Print). 2004, Vol 33, Num 2, pp 286-303, issn 0097-5397, 18 p.Article

Amortizing randomness in private multiparty computationsKUSHILEVITZ, Eyal; OSTROVSKY, Rafail; ROSEN, Adi et al.SIAM journal on discrete mathematics (Print). 2003, Vol 16, Num 4, pp 533-544, issn 0895-4801, 12 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

On-line randomized call control revisitedLEONARDI, Stefano; MARCHETTI-SPACCAMELA, Alberto; PRESCIUTTI, Alessio et al.SIAM journal on computing (Print). 2001, Vol 31, Num 1, pp 86-112, issn 0097-5397Article

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

  • Page / 1