Adi Rosén

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 26

Top Venues

CoRR

ACM Trans. Algorithms

ESA

Theor. Comput. Sci.

Publications

Geoffroy Couteau, Adi Rosén
Random Sources in Private Computation. IACR Cryptol. ePrint Arch. 2023 (2023)
Avinandan Das, Pierre Fraigniaud, Adi Rosén
Distributed Partial Coloring via Gradual Rounding. OPODIS (2023)
Geoffroy Couteau, Adi Rosén
Random Sources in Private Computation. ASIACRYPT (1) (2022)
Guy Even, Reut Levi, Moti Medina, Adi Rosén
Sublinear Random Access Generators for Preferential Attachment Graphs. ACM Trans. Algorithms 17 (4) (2021)
Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. SIAM J. Discret. Math. 35 (1) (2021)
Dror Rawitz, Adi Rosén
Online Budgeted Maximum Coverage. Algorithmica 83 (9) (2021)
Alejandro López-Ortiz, Marc P. Renault, Adi Rosén
Paid exchanges are worth the price. Theor. Comput. Sci. (2020)
Iordanis Kerenidis, Adi Rosén, Florent Urrutia
Multi-Party Protocols, Information Complexity and Privacy. ACM Trans. Comput. Theory 11 (2) (2019)
Adi Rosén, Florent Urrutia
A New Approach to Multi-Party Peer-to-Peer Communication Complexity. ITCS (2019)
Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. TCC (2) (2019)
Adi Rosén, Florent Urrutia
A New Approach to Multi-Party Peer-to-Peer Communication Complexity. CoRR (2019)
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) (2018)
Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
Reordering buffer management with advice. J. Sched. 20 (5) (2017)
Guy Even, Reut Levi, Moti Medina, Adi Rosén
Sublinear Random Access Generators for Preferential Attachment Graphs. ICALP (2017)
Guy Even, Moti Medina, Adi Rosén
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. CoRR (2016)
Guy Even, Reut Levi, Moti Medina, Adi Rosén
Sublinear Random Access Generators for Preferential Attachment Graphs. CoRR (2016)
Yuval Emek, Magnús M. Halldórsson, Adi Rosén
Space-Constrained Interval Selection. ACM Trans. Algorithms 12 (4) (2016)
Guy Even, Moti Medina, Adi Rosén
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. ESA (2016)
Dror Rawitz, Adi Rosén
Online Budgeted Maximum Coverage. ESA (2016)
Iordanis Kerenidis, Adi Rosén, Florent Urrutia
Multi-Party Protocols, Information Complexity and Privacy. MFCS (2016)
Benny Applebaum, Dariusz R. Kowalski, Boaz Patt-Shamir, Adi Rosén
Clique Here: On the Distributed Complexity in Fully-Connected Networks. Parallel Process. Lett. 26 (1) (2016)
Yuval Emek, Adi Rosén
Semi-Streaming Set Cover. ACM Trans. Algorithms 13 (1) (2016)
Christian Konrad, Adi Rosén
Approximating Semi-matchings in Streaming and in Two-Party Communication. ACM Trans. Algorithms 12 (3) (2016)
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) (2016)
Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén
Unconditionally Secure Computation with Reduced Interaction. EUROCRYPT (2) (2016)
Iordanis Kerenidis, Adi Rosén, Florent Urrutia
Multi-Party Protocols, Information Complexity and Privacy. CoRR (2016)
Marc P. Renault, Adi Rosén, Rob van Stee
Online algorithms with advice for bin packing and scheduling problems. Theor. Comput. Sci. 600 (2015)
Marc P. Renault, Adi Rosén
On Online Algorithms with Advice for the k-Server Problem. Theory Comput. Syst. 56 (1) (2015)
Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén
Online Bin Packing with Advice of Small Size. WADS (2015)
Alejandro López-Ortiz, Marc P. Renault, Adi Rosén
Paid Exchanges are Worth the Price. STACS (2015)
Yuval Emek, Adi Rosén
Semi-Streaming Set Cover - (Extended Abstract). ICALP (1) (2014)
Yuval Emek, Adi Rosén
Semi-Streaming Set Cover. CoRR (2014)
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)
Christian Konrad, Adi Rosén
Approximating Semi-matchings in Streaming and in Two-Party Communication. ICALP (1) (2013)
Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
Reordering Buffer Management with Advice. WAOA (2013)
Christian Konrad, Adi Rosén
Approximating Semi-Matchings in Streaming and in Two-Party Communication CoRR (2013)
Marc P. Renault, Adi Rosén, Rob van Stee
Online Algorithms with Advice for Bin Packing and Scheduling Problems. CoRR (2013)
Yuval Emek, Magnús M. Halldórsson, Adi Rosén
Space-Constrained Interval Selection CoRR (2012)
Yuval Emek, Magnús M. Halldórsson, Adi Rosén
Space-Constrained Interval Selection. ICALP (1) (2012)
Harald Räcke, Adi Rosén
Approximation Algorithms for Time-Constrained Scheduling on Line Networks. Theory Comput. Syst. 49 (4) (2011)
Marc P. Renault, Adi Rosén
On Online Algorithms with Advice for the k-Server Problem. WAOA (2011)
Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén
Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. 44 (9) (2011)
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
Online computation with advice. Theor. Comput. Sci. 412 (24) (2011)
Adi Rosén, Gabriel Scalosub
Rate vs. buffer size-greedy information gathering on the line. ACM Trans. Algorithms 7 (3) (2011)
Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén
Fully decentralized computation of aggregates over data streams. StreamKDD@KDD (2010)
Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén
Fully decentralized computation of aggregates over data streams. SIGKDD Explor. 12 (2) (2010)
Eyal Gordon, Adi Rosén
Competitive weighted throughput analysis of greedy protocols on DAGs. ACM Trans. Algorithms 6 (3) (2010)
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) (2010)
Joseph Naor, Adi Rosén, Gabriel Scalosub
Online time-constrained scheduling in linear and ring networks. J. Discrete Algorithms 8 (4) (2010)
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
-Server Work Function Algorithm. WAOA (2009)
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
Online Computation with Advice. ICALP (1) (2009)
Harald Räcke, Adi Rosén
Approximation algorithms for time-constrained scheduling on line networks. SPAA (2009)
Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
Distributed Approximate Matching. SIAM J. Comput. 39 (2) (2009)
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
On the Additive Constant of the k-server Work Function Algorithm CoRR (2009)
Alexander Kesselman, Adi Rosén
Controlling CIOQ Switches with Priority Queuing and in Multistage Interconnection Networks. J. Interconnect. Networks 9 (1/2) (2008)
Adi Rosén, Gabriel Scalosub
Rate vs. buffer size: greedy information gathering on the line. SPAA (2007)
Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
Distributed approximate matching. PODC (2007)
Alexander Kesselman, Adi Rosén
Scheduling policies for CIOQ switches. J. Algorithms 60 (1) (2006)
Adi Rosén, Michael S. Tsirkin
On Delivery Times in Packet Networks under Adversarial Traffic. Theory Comput. Syst. 39 (6) (2006)
William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén
Competitive queue policies for differentiated services. J. Algorithms 55 (2) (2005)
Eyal Gordon, Adi Rosén
Competitive weighted throughput analysis of greedy protocols on DAGs. PODC (2005)
Micah Adler, Adi Rosén
Tight bounds for the performance of Longest In System on DAGs. J. Algorithms 55 (2) (2005)
Harald Räcke, Adi Rosén
Distributed online call control on general networks. SODA (2005)
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) (2005)
Joseph Naor, Adi Rosén, Gabriel Scalosub
Online time-constrained scheduling in linear networks. INFOCOM (2005)
Dan Guez, Alexander Kesselman, Adi Rosén
Packet-mode policies for input-queued switches. SPAA (2004)
Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
New stability results for adversarial queuing. SIAM J. Comput. 33 (2) (2004)
Adi Rosén, Michael S. Tsirkin
On delivery times in packet networks under adversarial traffic. SPAA (2004)
Anna Gál, Adi Rosén
Lower bounds on the amount of randomness in private computation. STOC (2003)
William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén
Dynamic routing on networks with fixed-size buffers. SODA (2003)
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. Algorithmica 36 (2) (2003)
Alexander Kesselman, Adi Rosén
Scheduling policies for CIOQ switches. SPAA (2003)
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Amortizing Randomness in Private Multiparty Computations. SIAM J. Discret. Math. 16 (4) (2003)
Anna Gál, Adi Rosén
A Theorem on Sensitivity and Applications in Private Computation. SIAM J. Comput. 31 (5) (2002)
Adi Rosén
A note on models for non-probabilistic analysis of packet switching networks. Inf. Process. Lett. 84 (5) (2002)
Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
New stability results for adversarial queuing. SPAA (2002)
Micah Adler, Adi Rosén
Tight Bounds for the Performance of Longest-in-System on DAGs. STACS (2002)
Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén
On-line Randomized Call Control Revisited . SIAM J. Comput. 31 (1) (2001)
Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
On-Line Competitive Algorithms for Call Admission in Optical Networks. Algorithmica 31 (1) (2001)
Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Randomness versus Fault-Tolerance. J. Cryptol. 13 (1) (2000)
William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Adaptive Packet Routing for Bursty Adversarial Traffic. J. Comput. Syst. Sci. 60 (3) (2000)
William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén
Competitive Queue Policies for Differentiated Services. INFOCOM (2000)
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Characterizing Linear Size Circuits in Terms of Pricacy. J. Comput. Syst. Sci. 58 (1) (1999)
Anna Gál, Adi Rosén
A Theorem on Sensitivity and Applications in Private Computation. STOC (1999)
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. SPAA (1999)
Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
On Capital Investment. Algorithmica 25 (1) (1999)
Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Randomness versus Fault-Tolerance. IACR Cryptol. ePrint Arch. 1998 (1998)
Eyal Kushilevitz, Adi Rosén
A Randomness-Rounds Tradeoff in Private Computation. SIAM J. Discret. Math. 11 (1) (1998)
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Log-Space Polynomial End-to-End Communication. SIAM J. Comput. 27 (6) (1998)
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Amortizing Randomness in Private Multiparty Computations. PODC (1998)
William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Adaptive Packet Routing for Bursty Adversarial Traffic. STOC (1998)
Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén
On-line Randomized Call Control Revisited. SODA (1998)
Yair Bartal, Adi Rosén
The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms. J. Algorithms 23 (2) (1997)
Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Randomness vs. Fault-Tolerance. PODC (1997)
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) (1997)
Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
On Capital Investment. ICALP (1996)
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks
Randomized Robot Navigation Algorithms. SODA (1996)
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Characterizing Linear Size Circuits in Terms of Privacy. STOC (1996)
Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
On-line Competive Algorithms for Call Admission in Optical Networks. ESA (1996)
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
Log-Space Polynomial End-to-End Communication (Abstract). PODC (1995)

Adi Rosén.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Adi Rosén