Adi Rosén - RankMe

112 papers A* 23A 7B 14Journal 58Unranked 9

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