A New Approach to Bounded Model Checking for Branching Time Logics. - Rotem Oshman; Orna Grumberg (ATVA, 2007)

Gradient Clock Synchronization Using Reference Broadcasts. - Fabian Kuhn; Rotem Oshman (OPODIS, 2009)

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking. - Rotem Oshman (VMCAI, 2009)

Optimal gradient clock synchronization in dynamic networks. - Fabian Kuhn; Christoph Lenzen 001; Thomas Locher; Rotem Oshman (PODC, 2010)

Broadcasting in unreliable radio networks. - Fabian Kuhn; Nancy A. Lynch; Calvin C. Newport; Rotem Oshman; Andréa W. Richa (PODC, 2010)

Distributed computation in dynamic networks. - Fabian Kuhn; Nancy A. Lynch; Rotem Oshman (STOC, 2010)

Coordinated consensus in dynamic networks. - Fabian Kuhn; Yoram Moses; Rotem Oshman (PODC, 2011)

Resilience of mutual exclusion algorithms to transient memory faults. - Thomas Moscibroda; Rotem Oshman (PODC, 2011)

The Complexity of Data Aggregation in Directed Networks. - Fabian Kuhn; Rotem Oshman (DISC, 2011)

Gradient Clock Synchronization in Dynamic Networks. - Fabian Kuhn; Thomas Locher; Rotem Oshman (Theory Comput. Syst., 2011)

Dynamic networks: models and algorithms. - Fabian Kuhn; Rotem Oshman (SIGACT News, 2011)

The communication complexity of distributed task allocation. - Andrew Drucker; Fabian Kuhn; Rotem Oshman (PODC, 2012)

A Tight Bound for Set Disjointness in the Message-Passing Model. - Mark Braverman; Faith Ellen; Rotem Oshman; Toniann Pitassi; Vinod Vaikuntanathan (FOCS, 2013)

The SkipTrie: low-depth concurrent search without rebalancing. - Rotem Oshman; Nir Shavit (PODC, 2013)

Tight Bounds for Set Disjointness in the Message Passing Model - Mark Braverman; Faith Ellen; Rotem Oshman; Toniann Pitassi; Vinod Vaikuntanathan (CoRR, 2013)

On the power of the congested clique model. - Andrew Drucker; Fabian Kuhn; Rotem Oshman (PODC, 2014)

Communication Complexity Lower Bounds in Distributed Message-Passing. - Rotem Oshman (SIROCCO, 2014)

On Information Complexity in the Broadcast Model. - Mark Braverman; Rotem Oshman (PODC, 2015)

The Communication Complexity of Number-In-Hand Set Disjointness with No Promise. - Mark Braverman; Rotem Oshman (Electron. Colloquium Comput. Complex., 2015)

A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness. - Mark Braverman; Rotem Oshman (FOCS, 2017)

Lower Bounds for Subgraph Detection in the CONGEST Model. - Tzlil Gonen; Rotem Oshman (OPODIS, 2017)

On the Multiparty Communication Complexity of Testing Triangle-Freeness. - Orr Fischer; Shay Gershtein; Rotem Oshman (PODC, 2017)

Three Notes on Distributed Property Testing. - Guy Even; Orr Fischer; Pierre Fraigniaud; Tzlil Gonen; Reut Levi; Moti Medina; Pedro Montealegre 001; Dennis Olivetti; Rotem Oshman; Ivan Rapaport; Ioan Todinca (DISC, 2017)

Interactive Compression for Multi-Party Protocol. - Gillat Kol; Rotem Oshman; Dafna Sadeh (DISC, 2017)

Distributed Property Testing for Subgraph-Freeness Revisited. - Orr Fischer; Tzlil Gonen; Rotem Oshman (CoRR, 2017)

Superlinear Lower Bounds for Distributed Subgraph Detection. - Orr Fischer; Tzlil Gonen; Rotem Oshman (CoRR, 2017)

Distributed Uniformity Testing. - Orr Fischer; Uri Meir; Rotem Oshman (PODC, 2018)

Interactive Distributed Proofs. - Gillat Kol; Rotem Oshman; Raghuvansh R. Saxena (PODC, 2018)

Possibilities and Impossibilities for Distributed Subgraph Detection. - Orr Fischer; Tzlil Gonen; Fabian Kuhn; Rotem Oshman (SPAA, 2018)

Distributed Approximate Maximum Matching in the CONGEST Model. - Mohamad Ahmadi; Fabian Kuhn; Rotem Oshman (DISC, 2018)

On the Communication Complexity of Key-Agreement Protocols. - Iftach Haitner; Noam Mazor; Rotem Oshman; Omer Reingold; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2018)

Can Distributed Uniformity Testing Be Local? - Uri Meir; Dor Minzer; Rotem Oshman (PODC, 2019)

On Distributed Merlin-Arthur Decision Protocols. - Pierre Fraigniaud; Pedro Montealegre 001; Rotem Oshman; Ivan Rapaport; Ioan Todinca (SIROCCO, 2019)

On the Computational Power of Radio Channels. - Mark Braverman; Gillat Kol; Rotem Oshman; Avishay Tal (DISC, 2019)

Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. - Sepehr Assadi; Gillat Kol; Rotem Oshman (PODC, 2020)

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. - Keren Censor-Hillel; Orr Fischer; Tzlil Gonen; François Le Gall; Dean Leitersdorf; Rotem Oshman (DISC, 2020)

Public vs. private randomness in simultaneous multi-party communication complexity. - Orr Fischer; Rotem Oshman; Uri Zwick (Theor. Comput. Sci., 2020)

Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators. - Orr Fischer; Rotem Oshman; Dana Shamir (OPODIS, 2021)

The communication complexity of multiparty set disjointness under product distributions. - Nachum Dershowitz; Rotem Oshman; Tal Roth (STOC, 2021)

Truthful Information Dissemination in General Asynchronous Networks. - Lior Solodkin; Rotem Oshman (DISC, 2021)

On the Interactive Capacity of Finite-State Protocols. - Assaf Ben-Yishai; Young-Han Kim 001; Rotem Oshman; Ofer Shayevitz (Entropy, 2021)

Quantum Distributed Algorithms for Detection of Cliques. - Keren Censor-Hillel; Orr Fischer; François Le Gall; Dean Leitersdorf; Rotem Oshman (ITCS, 2022)

Massively Parallel Computation in a Heterogeneous Regime. - Orr Fischer; Adi Horowitz; Rotem Oshman (PODC, 2022)

Brief Announcement: On Polynomial-Time Local Decision. - Eden Aldema Tshuva; Rotem Oshman (PODC, 2022)

Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs. - Yoav Ben Shimon; Orr Fischer; Rotem Oshman (SIROCCO, 2022)

Distributed Zero-Knowledge Proofs Over Networks. - Aviv Bick; Gillat Kol; Rotem Oshman (SODA, 2022)

Sublinear-time distributed algorithms for detecting small cliques and even cycles. - Talya Eden; Nimrod Fiat; Orr Fischer; Fabian Kuhn; Rotem Oshman (Distributed Comput., 2022)

The Communication Complexity of Set Intersection Under Product Distributions. - Rotem Oshman; Tal Roth (ICALP, 2023)

Resilience of 3-Majority Dynamics to Non-Uniform Schedulers. - Uri Meir; Rotem Oshman; Ofer Shayevitz; Yuval Volkov (ITCS, 2023)

On Polynomial Time Local Decision. - Eden Aldema Tshuva; Rotem Oshman (OPODIS, 2023)

A distributed algorithm for directed minimum-weight spanning tree. - Orr Fischer; Rotem Oshman (Distributed Comput., 2023)

Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries. - François Le Gall; Oran Nadler; Harumichi Nishimura; Rotem Oshman (OPODIS, 2024)

History-Independent Concurrent Objects. - Hagit Attiya; Michael A. Bender; Martín Farach-Colton; Rotem Oshman; Noa Schiller (PODC, 2024)

Multi-Party Set Disjointness and Intersection with Bounded Dependence. - Mark Braverman; Rotem Oshman; Tal Roth (PODC, 2024)

Fully Local Succinct Distributed Arguments. - Eden Aldema Tshuva; Rotem Oshman (DISC, 2024)

Locally Verifiable Distributed SNARGs. - Eden Aldema Tshuva; Elette Boyle; Ran Cohen; Tal Moran; Rotem Oshman (IACR Cryptol. ePrint Arch., 2024)

Dynamic Rental Games with Stagewise Individual Rationality. - Batya Berzack; Rotem Oshman; Inbal Talgam-Cohen (EC, 2025)

Pointer Chasing with Unlimited Interaction. - Orr Fischer; Rotem Oshman; Adi Rosén; Tal Roth (SIROCCO, 2025)

History-Independent Concurrent Hash Tables. - Hagit Attiya; Michael A. Bender; Martín Farach-Colton; Rotem Oshman; Noa Schiller (STOC, 2025)