Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAdi Rosén
Person information
- affiliation: CNRS & University Paris Diderot, LIAFA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j39]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. Theory Comput. Syst. 62(8): 2006-2034 (2018)- 2017
- [j38]Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee:
Reordering buffer management with advice. J. Scheduling 20(5): 423-442 (2017) - [c46]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. ICALP 2017: 6:1-6:15 - 2016
- [j37]Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén:
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. Algorithmica 74(4): 1205-1223 (2016) - [j36]Benny Applebaum, Dariusz R. Kowalski, Boaz Patt-Shamir, Adi Rosén:
Clique Here: On the Distributed Complexity in Fully-Connected Networks. Parallel Processing Letters 26(1) (2016) - [j35]Christian Konrad, Adi Rosén:
Approximating Semi-matchings in Streaming and in Two-Party Communication. ACM Trans. Algorithms 12(3): 32:1-32:21 (2016) - [j34]Yuval Emek, Magnús M. Halldórsson, Adi Rosén:
Space-Constrained Interval Selection. ACM Trans. Algorithms 12(4): 51:1-51:32 (2016) - [j33]
- [c45]Guy Even, Moti Medina, Adi Rosén:
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. ESA 2016: 40:1-40:16 - [c44]
- [c43]Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén:
Unconditionally Secure Computation with Reduced Interaction. EUROCRYPT (2) 2016: 420-447 - [c42]Iordanis Kerenidis, Adi Rosén, Florent Urrutia:
Multi-Party Protocols, Information Complexity and Privacy. MFCS 2016: 57:1-57:16 - [i9]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. CoRR abs/1602.06159 (2016) - [i8]Guy Even, Moti Medina, Adi Rosén:
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. CoRR abs/1602.06174 (2016) - [i7]Iordanis Kerenidis, Adi Rosén, Florent Urrutia:
Multi-Party Protocols, Information Complexity and Privacy. CoRR abs/1606.06872 (2016) - 2015
- [j32]Marc P. Renault, Adi Rosén:
On Online Algorithms with Advice for the k-Server Problem. Theory Comput. Syst. 56(1): 3-21 (2015) - [j31]Marc P. Renault, Adi Rosén, Rob van Stee:
Online algorithms with advice for bin packing and scheduling problems. Theor. Comput. Sci. 600: 155-170 (2015) - [c41]Alejandro López-Ortiz, Marc P. Renault, Adi Rosén:
Paid Exchanges are Worth the Price. STACS 2015: 636-648 - [c40]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. WADS 2015: 40-53 - 2014
- [c39]
- [i6]
- 2013
- [c38]Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén:
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. APPROX-RANDOM 2013: 158-172 - [c37]Christian Konrad, Adi Rosén:
Approximating Semi-matchings in Streaming and in Two-Party Communication. ICALP (1) 2013: 637-649 - [c36]Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee:
Reordering Buffer Management with Advice. WAOA 2013: 132-143 - [i5]Christian Konrad, Adi Rosén:
Approximating Semi-Matchings in Streaming and in Two-Party Communication. CoRR abs/1304.6906 (2013) - [i4]Marc P. Renault, Adi Rosén, Rob van Stee:
Online Algorithms with Advice for Bin Packing and Scheduling Problems. CoRR abs/1311.7589 (2013) - 2012
- [c35]Yuval Emek, Magnús M. Halldórsson, Adi Rosén:
Space-Constrained Interval Selection. ICALP (1) 2012: 302-313 - [i3]Yuval Emek, Magnús M. Halldórsson, Adi Rosén:
Space-Constrained Interval Selection. CoRR abs/1202.4326 (2012) - 2011
- [j30]Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén:
Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. 44(9): 477-485 (2011) - [j29]Harald Räcke, Adi Rosén:
Approximation Algorithms for Time-Constrained Scheduling on Line Networks. Theory Comput. Syst. 49(4): 834-856 (2011) - [j28]Adi Rosén, Gabriel Scalosub:
Rate vs. buffer size-greedy information gathering on the line. ACM Trans. Algorithms 7(3): 32:1-32:22 (2011) - [j27]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
Online computation with advice. Theor. Comput. Sci. 412(24): 2642-2656 (2011) - [c34]Marc P. Renault, Adi Rosén:
On Online Algorithms with Advice for the k-Server Problem. WAOA 2011: 198-210 - 2010
- [j26]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the additive constant of the k-server Work Function Algorithm. Inf. Process. Lett. 110(24): 1120-1123 (2010) - [j25]Joseph Naor, Adi Rosén, Gabriel Scalosub:
Online time-constrained scheduling in linear and ring networks. J. Discrete Algorithms 8(4): 346-355 (2010) - [j24]Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén:
Fully decentralized computation of aggregates over data streams. SIGKDD Explorations 12(2): 83-91 (2010) - [j23]Eyal Gordon, Adi Rosén:
Competitive weighted throughput analysis of greedy protocols on DAGs. ACM Trans. Algorithms 6(3): 50:1-50:22 (2010)
2000 – 2009
- 2009
- [j22]Zvi Lotker, Boaz Patt-Shamir, Adi Rosén:
Distributed Approximate Matching. SIAM J. Comput. 39(2): 445-460 (2009) - [c33]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
Online Computation with Advice. ICALP (1) 2009: 427-438 - [c32]Harald Räcke, Adi Rosén:
Approximation algorithms for time-constrained scheduling on line networks. SPAA 2009: 337-346 - [c31]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the Additive Constant of the k-Server Work Function Algorithm. WAOA 2009: 128-134 - [i2]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
- [j21]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
- [c30]
- [c29]Adi Rosén, Gabriel Scalosub:
Rate vs. buffer size: greedy information gathering on the line. SPAA 2007: 305-314 - 2006
- [j20]Alexander Kesselman, Adi Rosén:
Scheduling policies for CIOQ switches. J. Algorithms 60(1): 60-83 (2006) - [j19]Adi Rosén, Michael S. Tsirkin:
On Delivery Times in Packet Networks under Adversarial Traffic. Theory Comput. Syst. 39(6): 805-827 (2006) - 2005
- [j18]Micah Adler, Adi Rosén:
Tight bounds for the performance of Longest In System on DAGs. J. Algorithms 55(2): 101-112 (2005) - [j17]William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén:
Competitive queue policies for differentiated services. J. Algorithms 55(2): 113-141 (2005) - [j16]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) - [c28]Joseph Naor, Adi Rosén, Gabriel Scalosub:
Online time-constrained scheduling in linear networks. INFOCOM 2005: 855-865 - [c27]Eyal Gordon, Adi Rosén:
Competitive weighted throughput analysis of greedy protocols on DAGs. PODC 2005: 227-236 - [c26]
- 2004
- [j15]Zvi Lotker, Boaz Patt-Shamir, Adi Rosén:
New stability results for adversarial queuing. SIAM J. Comput. 33(2): 286-303 (2004) - [c25]Adi Rosén, Michael S. Tsirkin:
On delivery times in packet networks under adversarial traffic. SPAA 2004: 1-10 - [c24]Dan Guez, Alexander Kesselman, Adi Rosén:
Packet-mode policies for input-queued switches. SPAA 2004: 93-102 - 2003
- [j14]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) - [j13]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Amortizing Randomness in Private Multiparty Computations. SIAM J. Discrete Math. 16(4): 533-544 (2003) - [c23]William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén:
Dynamic routing on networks with fixed-size buffers. SODA 2003: 771-780 - [c22]
- [c21]
- 2002
- [j12]Adi Rosén:
A note on models for non-probabilistic analysis of packet switching networks. Inf. Process. Lett. 84(5): 237-240 (2002) - [j11]Anna Gál, Adi Rosén:
A Theorem on Sensitivity and Applications in Private Computation. SIAM J. Comput. 31(5): 1424-1437 (2002) - [c20]Zvi Lotker, Boaz Patt-Shamir, Adi Rosén:
New stability results for adversarial queuing. SPAA 2002: 192-199 - [c19]Micah Adler, Adi Rosén:
Tight Bounds for the Performance of Longest-in-System on DAGs. STACS 2002: 88-99 - 2001
- [j10]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) - [j9]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
- [j8]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) - [j7]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. J. Cryptology 13(1): 107-142 (2000) - [c18]William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén:
Competitive Queue Policies for Differentiated Services. INFOCOM 2000: 431-440
1990 – 1999
- 1999
- [j6]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén:
On Capital Investment. Algorithmica 25(1): 22-36 (1999) - [j5]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Characterizing Linear Size Circuits in Terms of Pricacy. J. Comput. Syst. Sci. 58(1): 129-136 (1999) - [c17]Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén:
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. SPAA 1999: 1-12 - [c16]
- 1998
- [j4]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-Space Polynomial End-to-End Communication. SIAM J. Comput. 27(6): 1531-1549 (1998) - [j3]Eyal Kushilevitz, Adi Rosén:
A Randomness-Rounds Tradeoff in Private Computation. SIAM J. Discrete Math. 11(1): 61-80 (1998) - [c15]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Amortizing Randomness in Private Multiparty Computations. PODC 1998: 81-90 - [c14]Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén:
On-line Randomized Call Control Revisited. SODA 1998: 323-332 - [c13]William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Adaptive Packet Routing for Bursty Adversarial Traffic. STOC 1998: 359-368 - [i1]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. IACR Cryptology ePrint Archive 1998: 14 (1998) - 1997
- [j2]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) - [j1]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) - [c12]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness vs. Fault-Tolerance. PODC 1997: 35-44 - 1996
- [c11]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 - [c10]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén:
On Capital Investment. ICALP 1996: 429-441 - [c9]Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks:
Randomized Robot Navigation Algorithms. SODA 1996: 75-84 - [c8]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Characterizing Linear Size Circuits in Terms of Privacy. STOC 1996: 541-550 - 1995
- [c7]Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts:
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). FOCS 1995: 392-401 - [c6]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-Space Polynomial End-to-End Communication (Abstract). PODC 1995: 254 - [c5]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-space polynomial end-to-end communication. STOC 1995: 559-568 - 1994
- [c4]Eyal Kushilevitz, Adi Rosén:
A Randomnesss-Rounds Tradeoff in Private Computation. CRYPTO 1994: 397-410 - [c3]Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén:
Competitive Non-Preemptive Call Control. SODA 1994: 312-320 - 1992
- [c2]Yair Bartal, Adi Rosén:
The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms. FOCS 1992: 344-353 - [c1]Yehuda Afek, Eli Gafni, Adi Rosén:
The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract). PODC 1992: 35-46
Coauthor Index
maintained by 
at 
at 
last updated on 2018-09-13 00:29 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint