2009 |
52 | EE | Yuval Emek,
Pierre Fraigniaud,
Amos Korman,
Adi Rosén:
On the Additive Constant of the k-server Work Function Algorithm
CoRR abs/0902.1378: (2009) |
2008 |
51 | EE | Alexander Kesselman,
Adi Rosén:
Controlling CIOQ Switches with Priority Queuing and in Multistage Interconnection Networks.
Journal of Interconnection Networks 9(1/2): 53-72 (2008) |
2007 |
50 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Adi Rosén:
Distributed approximate matching.
PODC 2007: 167-174 |
49 | EE | Adi Rosén,
Gabriel Scalosub:
Rate vs. buffer size: greedy information gathering on the line.
SPAA 2007: 305-314 |
2006 |
48 | EE | Alexander Kesselman,
Adi Rosén:
Scheduling policies for CIOQ switches.
J. Algorithms 60(1): 60-83 (2006) |
47 | EE | Adi Rosén,
Michael S. Tsirkin:
On Delivery Times in Packet Networks under Adversarial Traffic.
Theory Comput. Syst. 39(6): 805-827 (2006) |
2005 |
46 | EE | Joseph Naor,
Adi Rosén,
Gabriel Scalosub:
Online time-constrained scheduling in linear networks.
INFOCOM 2005: 855-865 |
45 | EE | Eyal Gordon,
Adi Rosén:
Competitive weighted throughput analysis of greedy protocols on DAGs.
PODC 2005: 227-236 |
44 | EE | Harald Räcke,
Adi Rosén:
Distributed online call control on general networks.
SODA 2005: 791-800 |
43 | EE | Micah Adler,
Adi Rosén:
Tight bounds for the performance of Longest In System on DAGs.
J. Algorithms 55(2): 101-112 (2005) |
42 | EE | William Aiello,
Yishay Mansour,
S. Rajagopolan,
Adi Rosén:
Competitive queue policies for differentiated services.
J. Algorithms 55(2): 113-141 (2005) |
41 | EE | Anna Gál,
Adi Rosén:
Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation.
SIAM J. Comput. 34(4): 946-959 (2005) |
2004 |
40 | EE | Adi Rosén,
Michael S. Tsirkin:
On delivery times in packet networks under adversarial traffic.
SPAA 2004: 1-10 |
39 | EE | Dan Guez,
Alexander Kesselman,
Adi Rosén:
Packet-mode policies for input-queued switches.
SPAA 2004: 93-102 |
38 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Adi Rosén:
New stability results for adversarial queuing.
SIAM J. Comput. 33(2): 286-303 (2004) |
2003 |
37 | EE | William Aiello,
Rafail Ostrovsky,
Eyal Kushilevitz,
Adi Rosén:
Dynamic routing on networks with fixed-size buffers.
SODA 2003: 771-780 |
36 | EE | Alexander Kesselman,
Adi Rosén:
Scheduling policies for CIOQ switches.
SPAA 2003: 353-362 |
35 | EE | Anna Gál,
Adi Rosén:
Lower bounds on the amount of randomness in private computation.
STOC 2003: 659-666 |
34 | EE | Micah Adler,
Sanjeev Khanna,
Rajmohan Rajaraman,
Adi Rosén:
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
Algorithmica 36(2): 123-152 (2003) |
33 | EE | Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Amortizing Randomness in Private Multiparty Computations.
SIAM J. Discrete Math. 16(4): 533-544 (2003) |
2002 |
32 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Adi Rosén:
New stability results for adversarial queuing.
SPAA 2002: 192-199 |
31 | EE | Micah Adler,
Adi Rosén:
Tight Bounds for the Performance of Longest-in-System on DAGs.
STACS 2002: 88-99 |
30 | EE | Adi Rosén:
A note on models for non-probabilistic analysis of packet switching networks.
Inf. Process. Lett. 84(5): 237-240 (2002) |
29 | EE | Anna Gál,
Adi Rosén:
A Theorem on Sensitivity and Applications in Private Computation.
SIAM J. Comput. 31(5): 1424-1437 (2002) |
2001 |
28 | EE | Baruch Awerbuch,
Yossi Azar,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On-Line Competitive Algorithms for Call Admission in Optical Networks.
Algorithmica 31(1): 29-43 (2001) |
27 | EE | Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Alessio Presciutti,
Adi Rosén:
On-line Randomized Call Control Revisited .
SIAM J. Comput. 31(1): 86-112 (2001) |
2000 |
26 | EE | William Aiello,
Yishay Mansour,
S. Rajagopolan,
Adi Rosén:
Competitive Queue Policies for Differentiated Services.
INFOCOM 2000: 431-440 |
25 | | William Aiello,
Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Adaptive Packet Routing for Bursty Adversarial Traffic.
J. Comput. Syst. Sci. 60(3): 482-509 (2000) |
24 | EE | Ran Canetti,
Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Randomness versus Fault-Tolerance.
J. Cryptology 13(1): 107-142 (2000) |
1999 |
23 | EE | Micah Adler,
Sanjeev Khanna,
Rajmohan Rajaraman,
Adi Rosén:
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
SPAA 1999: 1-12 |
22 | EE | Anna Gál,
Adi Rosén:
A Theorem on Sensitivity and Applications in Private Computation.
STOC 1999: 348-357 |
21 | EE | Yossi Azar,
Yair Bartal,
Esteban Feuerstein,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On Capital Investment.
Algorithmica 25(1): 22-36 (1999) |
20 | | Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Characterizing Linear Size Circuits in Terms of Pricacy.
J. Comput. Syst. Sci. 58(1): 129-136 (1999) |
1998 |
19 | EE | Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Amortizing Randomness in Private Multiparty Computations.
PODC 1998: 81-90 |
18 | | Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Alessio Presciutti,
Adi Rosén:
On-line Randomized Call Control Revisited.
SODA 1998: 323-332 |
17 | EE | William Aiello,
Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Adaptive Packet Routing for Bursty Adversarial Traffic.
STOC 1998: 359-368 |
16 | EE | Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Log-Space Polynomial End-to-End Communication.
SIAM J. Comput. 27(6): 1531-1549 (1998) |
15 | EE | Eyal Kushilevitz,
Adi Rosén:
A Randomness-Rounds Tradeoff in Private Computation.
SIAM J. Discrete Math. 11(1): 61-80 (1998) |
1997 |
14 | | Ran Canetti,
Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Randomness vs. Fault-Tolerance.
PODC 1997: 35-44 |
13 | | Yehuda Afek,
Baruch Awerbuch,
Eli Gafni,
Yishay Mansour,
Adi Rosén,
Nir Shavit:
Slide-The Key to Polynomial End-to-End Communication.
J. Algorithms 22(1): 158-186 (1997) |
12 | | Yair Bartal,
Adi Rosén:
The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms.
J. Algorithms 23(2): 241-264 (1997) |
1996 |
11 | | Baruch Awerbuch,
Yossi Azar,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On-line Competive Algorithms for Call Admission in Optical Networks.
ESA 1996: 431-444 |
10 | | Yossi Azar,
Yair Bartal,
Esteban Feuerstein,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On Capital Investment.
ICALP 1996: 429-441 |
9 | | Piotr Berman,
Avrim Blum,
Amos Fiat,
Howard J. Karloff,
Adi Rosén,
Michael E. Saks:
Randomized Robot Navigation Algorithms.
SODA 1996: 75-84 |
8 | EE | Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Characterizing Linear Size Circuits in Terms of Privacy.
STOC 1996: 541-550 |
1995 |
7 | | Amos Fiat,
Yishay Mansour,
Adi Rosén,
Orli Waarts:
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).
FOCS 1995: 392-401 |
6 | | Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Log-Space Polynomial End-to-End Communication (Abstract).
PODC 1995: 254 |
5 | EE | Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Log-space polynomial end-to-end communication.
STOC 1995: 559-568 |
1994 |
4 | EE | Eyal Kushilevitz,
Adi Rosén:
A Randomnesss-Rounds Tradeoff in Private Computation.
CRYPTO 1994: 397-410 |
3 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat,
Adi Rosén:
Competitive Non-Preemptive Call Control.
SODA 1994: 312-320 |
1992 |
2 | | Yair Bartal,
Adi Rosén:
The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms
FOCS 1992: 344-353 |
1 | | Yehuda Afek,
Eli Gafni,
Adi Rosén:
The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract).
PODC 1992: 35-46 |