The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Adi Rosén: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  51. Online Computation with Advice. [Citation Graph (, )][DBLP]


  52. Approximation algorithms for time-constrained scheduling on line networks. [Citation Graph (, )][DBLP]


  53. On the Additive Constant of the k-Server Work Function Algorithm. [Citation Graph (, )][DBLP]


  54. On the Additive Constant of the k-server Work Function Algorithm [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002