| 2025 | STACS | Colorful Vertex Recoloring of Bipartite Graphs. | Boaz Patt-Shamir, Adi Rosn, Seeun William Umboh |
| 2025 | SIROCCO | Pointer Chasing with Unlimited Interaction. | Orr Fischer, Rotem Oshman, Adi Rosn, Tal Roth |
| 2023 | OPODIS | Distributed Partial Coloring via Gradual Rounding. | Avinandan Das, Pierre Fraigniaud, Adi Rosn |
| 2022 | ASIACRYPT | Random Sources in Private Computation. | Geoffroy Couteau, Adi Rosn |
| 2019 | TCC | Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. | Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosn, Adrian Thillard, Damien Vergnaud |
| 2017 | ICALP | Sublinear Random Access Generators for Preferential Attachment Graphs. | Guy Even, Reut Levi, Moti Medina, Adi Rosn |
| 2016 | ESA | A Constant Approximation Algorithm for Scheduling Packets on Line Networks. | Guy Even, Moti Medina, Adi Rosn |
| 2016 | ESA | Online Budgeted Maximum Coverage. | Dror Rawitz, Adi Rosn |
| 2016 | EuroCrypt | Unconditionally Secure Computation with Reduced Interaction. | Ivan Damgrd, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosn |
| 2016 | MFCS | Multi-Party Protocols, Information Complexity and Privacy. | Iordanis Kerenidis, Adi Rosn, Florent Urrutia |
| 2015 | STACS | Paid Exchanges are Worth the Price. | Alejandro Lpez-Ortiz, Marc P. Renault, Adi Rosn |
| 2015 | WADS | Online Bin Packing with Advice of Small Size. | Spyros Angelopoulos, Christoph Drr, Shahin Kamali, Marc P. Renault, Adi Rosn |
| 2014 | ICALP | Semi-Streaming Set Cover - (Extended Abstract). | Yuval Emek, Adi Rosn |
| 2013 | ICALP | Approximating Semi-matchings in Streaming and in Two-Party Communication. | Christian Konrad, Adi Rosn |
| 2013 | WAOA | Reordering Buffer Management with Advice. | Anna Adamaszek, Marc P. Renault, Adi Rosn, Rob van Stee |
| 2012 | ICALP | Space-Constrained Interval Selection. | Yuval Emek, Magns M. Halldrsson, Adi Rosn |
| 2011 | WAOA | On Online Algorithms with Advice for the k-Server Problem. | Marc P. Renault, Adi Rosn |
| 2010 | KDD | Fully decentralized computation of aggregates over data streams. | Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosn |
| 2009 | ICALP | Online Computation with Advice. | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosn |
| 2009 | SPAA | Approximation algorithms for time-constrained scheduling on line networks. | Harald Rcke, Adi Rosn |
| 2009 | WAOA | On the Additive Constant of the | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosn |
| 2007 | PODC | Distributed approximate matching. | Zvi Lotker, Boaz Patt-Shamir, Adi Rosn |
| 2007 | SPAA | Rate vs. buffer size: greedy information gathering on the line. | Adi Rosn, Gabriel Scalosub |
| 2005 | INFOCOM | Online time-constrained scheduling in linear networks. | Joseph Naor, Adi Rosn, Gabriel Scalosub |
| 2005 | PODC | Competitive weighted throughput analysis of greedy protocols on DAGs. | Eyal Gordon, Adi Rosn |
| 2005 | SODA | Distributed online call control on general networks. | Harald Rcke, Adi Rosn |
| 2004 | SPAA | Packet-mode policies for input-queued switches. | Dan Guez, Alexander Kesselman, Adi Rosn |
| 2004 | SPAA | On delivery times in packet networks under adversarial traffic. | Adi Rosn, Michael S. Tsirkin |
| 2003 | SODA | Dynamic routing on networks with fixed-size buffers. | William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosn |
| 2003 | STOC | Lower bounds on the amount of randomness in private computation. | Anna Gl, Adi Rosn |
| 2003 | SPAA | Scheduling policies for CIOQ switches. | Alexander Kesselman, Adi Rosn |
| 2002 | STACS | Tight Bounds for the Performance of Longest-in-System on DAGs. | Micah Adler, Adi Rosn |
| 2002 | SPAA | New stability results for adversarial queuing. | Zvi Lotker, Boaz Patt-Shamir, Adi Rosn |
| 2000 | INFOCOM | Competitive Queue Policies for Differentiated Services. | William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosn |
| 1999 | STOC | A Theorem on Sensitivity and Applications in Private Computation. | Anna Gl, Adi Rosn |
| 1999 | SPAA | Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. | Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosn |
| 1998 | PODC | Amortizing Randomness in Private Multiparty Computations. | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1998 | SODA | On-line Randomized Call Control Revisited. | Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosn |
| 1998 | STOC | Adaptive Packet Routing for Bursty Adversarial Traffic. | William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1997 | PODC | Randomness vs. Fault-Tolerance. | Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1996 | ESA | On-line Competive Algorithms for Call Admission in Optical Networks. | Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosn |
| 1996 | ICALP | On Capital Investment. | Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosn |
| 1996 | SODA | Randomized Robot Navigation Algorithms. | Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosn, Michael E. Saks |
| 1996 | STOC | Characterizing Linear Size Circuits in Terms of Privacy. | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1995 | FOCS | Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). | Amos Fiat, Yishay Mansour, Adi Rosn, Orli Waarts |
| 1995 | PODC | Log-Space Polynomial End-to-End Communication (Abstract). | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1995 | STOC | Log-space polynomial end-to-end communication. | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1994 | CRYPTO | A Randomnesss-Rounds Tradeoff in Private Computation. | Eyal Kushilevitz, Adi Rosn |
| 1994 | SODA | Competitive Non-Preemptive Call Control. | Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosn |
| 1992 | FOCS | The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms | Yair Bartal, Adi Rosn |
| 1992 | PODC | The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract). | Yehuda Afek, Eli Gafni, Adi Rosn |