| 2026 | PODC | Brief Announcement: A Space-Efficient Lock-Free Linear-Probing Hash Table. | Hagit Attiya, Rotem Oshman, Noa Schiller |
| 2026 | SPAA | Fast Concurrent Primitives Despite Contention. | Michael A. Bender, Guy E. Blelloch, Martin Farach-Colton, Yang Hu, Rob Johnson, Rotem Oshman, Renfei Zhou |
| 2025 | STOC | History-Independent Concurrent Hash Tables. | Hagit Attiya, Michael A. Bender, Martn Farach-Colton, Rotem Oshman, Noa Schiller |
| 2025 | SIROCCO | Pointer Chasing with Unlimited Interaction. | Orr Fischer, Rotem Oshman, Adi Rosn, Tal Roth |
| 2024 | OPODIS | Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries. | Franois Le Gall, Oran Nadler, Harumichi Nishimura, Rotem Oshman |
| 2024 | PODC | History-Independent Concurrent Objects. | Hagit Attiya, Michael A. Bender, Martn Farach-Colton, Rotem Oshman, Noa Schiller |
| 2024 | PODC | Multi-Party Set Disjointness and Intersection with Bounded Dependence. | Mark Braverman, Rotem Oshman, Tal Roth |
| 2023 | ICALP | The Communication Complexity of Set Intersection Under Product Distributions. | Rotem Oshman, Tal Roth |
| 2023 | OPODIS | On Polynomial Time Local Decision. | Eden Aldema Tshuva, Rotem Oshman |
| 2023 | TCC | Locally Verifiable Distributed SNARGs. | Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman |
| 2022 | PODC | Massively Parallel Computation in a Heterogeneous Regime. | Orr Fischer, Adi Horowitz, Rotem Oshman |
| 2022 | PODC | Brief Announcement: On Polynomial-Time Local Decision. | Eden Aldema Tshuva, Rotem Oshman |
| 2022 | SODA | Distributed Zero-Knowledge Proofs Over Networks. | Aviv Bick, Gillat Kol, Rotem Oshman |
| 2022 | SIROCCO | Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs. | Yoav Ben Shimon, Orr Fischer, Rotem Oshman |
| 2021 | OPODIS | Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators. | Orr Fischer, Rotem Oshman, Dana Shamir |
| 2021 | STOC | The communication complexity of multiparty set disjointness under product distributions. | Nachum Dershowitz, Rotem Oshman, Tal Roth |
| 2020 | PODC | Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. | Sepehr Assadi, Gillat Kol, Rotem Oshman |
| 2019 | PODC | Can Distributed Uniformity Testing Be Local? | Uri Meir, Dor Minzer, Rotem Oshman |
| 2019 | SIROCCO | On Distributed Merlin-Arthur Decision Protocols. | Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca |
| 2018 | PODC | Distributed Uniformity Testing. | Orr Fischer, Uri Meir, Rotem Oshman |
| 2018 | PODC | Interactive Distributed Proofs. | Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena |
| 2018 | SPAA | Possibilities and Impossibilities for Distributed Subgraph Detection. | Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman |
| 2017 | FOCS | A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness. | Mark Braverman, Rotem Oshman |
| 2017 | OPODIS | Lower Bounds for Subgraph Detection in the CONGEST Model. | Tzlil Gonen, Rotem Oshman |
| 2017 | PODC | On the Multiparty Communication Complexity of Testing Triangle-Freeness. | Orr Fischer, Shay Gershtein, Rotem Oshman |
| 2016 | SIROCCO | Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. | Orr Fischer, Rotem Oshman, Uri Zwick |
| 2015 | PODC | On Information Complexity in the Broadcast Model. | Mark Braverman, Rotem Oshman |
| 2014 | PODC | On the power of the congested clique model. | Andrew Drucker, Fabian Kuhn, Rotem Oshman |
| 2014 | SIROCCO | Communication Complexity Lower Bounds in Distributed Message-Passing. | Rotem Oshman |
| 2013 | FOCS | A Tight Bound for Set Disjointness in the Message-Passing Model. | Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan |
| 2013 | PODC | The SkipTrie: low-depth concurrent search without rebalancing. | Rotem Oshman, Nir Shavit |
| 2012 | PODC | The communication complexity of distributed task allocation. | Andrew Drucker, Fabian Kuhn, Rotem Oshman |
| 2011 | PODC | Coordinated consensus in dynamic networks. | Fabian Kuhn, Yoram Moses, Rotem Oshman |
| 2011 | PODC | Resilience of mutual exclusion algorithms to transient memory faults. | Thomas Moscibroda, Rotem Oshman |
| 2010 | PODC | Optimal gradient clock synchronization in dynamic networks. | Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman |
| 2010 | PODC | Broadcasting in unreliable radio networks. | Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Rotem Oshman, Andra W. Richa |
| 2010 | STOC | Distributed computation in dynamic networks. | Fabian Kuhn, Nancy A. Lynch, Rotem Oshman |
| 2009 | OPODIS | Gradient Clock Synchronization Using Reference Broadcasts. | Fabian Kuhn, Rotem Oshman |
| 2009 | SPAA | Gradient clock synchronization in dynamic networks. | Fabian Kuhn, Thomas Locher, Rotem Oshman |
| 2009 | VMCAI | An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking. | Rotem Oshman |
| 2007 | ATVA | A New Approach to Bounded Model Checking for Branching Time Logics. | Rotem Oshman, Orna Grumberg |