Rotem Oshman - RankMe

85 papers A* 26A 16B 15Journal 27Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Collaborative Incrementally Verifiable Computation. IACR Cryptol. ePrint Arch. Eden Aldema Tshuva, Sanjam Garg, Abhiram Kothapalli, Rotem Oshman, Omkant Pandey, Bhaskar Roberts
2026	A	`conf`	Model-Generic Incrementally Verifiable Computation from Updatable BARGs. ITCS Eden Aldema Tshuva, Rotem Oshman
2025	A	`conf`	Brief Announcement: Incrementally Verifiable Distributed Computation. DISC Eden Aldema Tshuva, Rotem Oshman
2025	A*	`conf`	Dynamic Rental Games with Stagewise Individual Rationality. EC Batya Berzack, Rotem Oshman, Inbal Talgam-Cohen
2025	J	`jnl`	Dynamic Rental Games with Stagewise Individual Rationality. CoRR Batya Berzack, Rotem Oshman, Inbal Talgam-Cohen
2025	A*	`conf`	History-Independent Concurrent Hash Tables. STOC Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller
2025	J	`jnl`	History-Independent Concurrent Hash Tables. CoRR Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller
2025	J	`jnl`	Massively parallel computation in a heterogeneous regime. Distributed Comput. Orr Fischer, Adi Horowitz, Rotem Oshman
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
2024	A	`conf`	Fully Local Succinct Distributed Arguments. DISC Eden Aldema Tshuva, Rotem Oshman
2024	A*	`conf`	History-Independent Concurrent Objects. PODC Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller
2024	J	`jnl`	History-Independent Concurrent Objects. CoRR Hagit Attiya, Michael A. Bender, Martin Farach-Colton, Rotem Oshman, Noa Schiller
2024	J	`jnl`	Locally Verifiable Distributed SNARGs. IACR Cryptol. ePrint Arch. Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman
2024	A*	`conf`	Multi-Party Set Disjointness and Intersection with Bounded Dependence. PODC Mark Braverman, Rotem Oshman, Tal Roth
2024	B	`conf`	Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries. OPODIS François Le Gall, Oran Nadler, Harumichi Nishimura, Rotem Oshman
2024	J	`jnl`	Quantum Simultaneous Protocols without Public Coins using Modified Equality Queries. CoRR François Le Gall, Oran Nadler, Harumichi Nishimura, Rotem Oshman
2023	A	`ed.`	37th International Symposium on Distributed Computing, DISC 2023, L'Aquila, Italy, October 10-12, 2023 DISC Rotem Oshman
2023	J	`jnl`	A distributed algorithm for directed minimum-weight spanning tree. Distributed Comput. Orr Fischer, Rotem Oshman
2023	—	`conf`	Locally Verifiable Distributed SNARGs. TCC (1) Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman
2023	J	`jnl`	Massively Parallel Computation in a Heterogeneous Regime. CoRR Orr Fischer, Adi Horowitz, Rotem Oshman
2023	B	`conf`	On Polynomial Time Local Decision. OPODIS Eden Aldema Tshuva, Rotem Oshman
2023	A*	`ed.`	Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023 PODC Rotem Oshman, Alexandre Nolin, Magnús M. Halldórsson, Alkida Balliu
2023	A	`conf`	Resilience of 3-Majority Dynamics to Non-Uniform Schedulers. ITCS Uri Meir, Rotem Oshman, Ofer Shayevitz, Yuval Volkov
2023	A*	`conf`	The Communication Complexity of Set Intersection Under Product Distributions. ICALP Rotem Oshman, Tal Roth
2022	A*	`conf`	Brief Announcement: On Polynomial-Time Local Decision. PODC Eden Aldema Tshuva, Rotem Oshman
2022	A*	`conf`	Distributed Zero-Knowledge Proofs Over Networks. SODA Aviv Bick, Gillat Kol, Rotem Oshman
2022	A*	`conf`	Massively Parallel Computation in a Heterogeneous Regime. PODC Orr Fischer, Adi Horowitz, Rotem Oshman
2022	B	`conf`	Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs. SIROCCO Yoav Ben Shimon, Orr Fischer, Rotem Oshman
2022	A	`conf`	Quantum Distributed Algorithms for Detection of Cliques. ITCS Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman
2022	J	`jnl`	Quantum Distributed Algorithms for Detection of Cliques. CoRR Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman
2022	J	`jnl`	Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Comput. Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman
2021	B	`ed.`	24th International Conference on Principles of Distributed Systems, OPODIS 2020, Strasbourg, France (Virtual Conference), December 14-16, 2020 OPODIS Quentin Bramas, Rotem Oshman, Paolo Romano
2021	B	`conf`	Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators. OPODIS Orr Fischer, Rotem Oshman, Dana Shamir
2021	J	`jnl`	Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. CoRR Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman
2021	J	`jnl`	On the Communication Complexity of Key-Agreement Protocols. CoRR Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
2021	J	`jnl`	On the Interactive Capacity of Finite-State Protocols. Entropy Assaf Ben-Yishai, Young-Han Kim, Rotem Oshman, Ofer Shayevitz
2021	A*	`conf`	The communication complexity of multiparty set disjointness under product distributions. STOC Nachum Dershowitz, Rotem Oshman, Tal Roth
2021	A	`conf`	Truthful Information Dissemination in General Asynchronous Networks. DISC Lior Solodkin, Rotem Oshman
2020	A	`conf`	Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. DISC Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman
2020	A*	`conf`	Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. PODC Sepehr Assadi, Gillat Kol, Rotem Oshman
2020	J	`jnl`	On the Interactive Capacity of Finite-State Protocols. CoRR Assaf Ben-Yishai, Young-Han Kim, Rotem Oshman, Ofer Shayevitz
2020	J	`jnl`	Public vs. private randomness in simultaneous multi-party communication complexity. Theor. Comput. Sci. Orr Fischer, Rotem Oshman, Uri Zwick
2019	A	`conf`	A Distributed Algorithm for Directed Minimum-Weight Spanning Tree. DISC Orr Fischer, Rotem Oshman
2019	A*	`conf`	Can Distributed Uniformity Testing Be Local? PODC Uri Meir, Dor Minzer, Rotem Oshman
2019	B	`conf`	On Distributed Merlin-Arthur Decision Protocols. SIROCCO Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca
2019	A	`conf`	On the Communication Complexity of Key-Agreement Protocols. ITCS Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
2019	A	`conf`	On the Computational Power of Radio Channels. DISC Mark Braverman, Gillat Kol, Rotem Oshman, Avishay Tal
2019	A	`conf`	Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. DISC Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman
2018	A	`conf`	Distributed Approximate Maximum Matching in the CONGEST Model. DISC Mohamad Ahmadi, Fabian Kuhn, Rotem Oshman
2018	A*	`conf`	Distributed Uniformity Testing. PODC Orr Fischer, Uri Meir, Rotem Oshman
2018	A*	`conf`	Interactive Distributed Proofs. PODC Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena
2018	J	`jnl`	On the Communication Complexity of Key-Agreement Protocols. Electron. Colloquium Comput. Complex. Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
2018	B	`conf`	Possibilities and Impossibilities for Distributed Subgraph Detection. SPAA Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman
2017	A*	`conf`	A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness. FOCS Mark Braverman, Rotem Oshman
2017	J	`jnl`	Distributed Property Testing for Subgraph-Freeness Revisited. CoRR Orr Fischer, Tzlil Gonen, Rotem Oshman
2017	A	`conf`	Interactive Compression for Multi-Party Protocol. DISC Gillat Kol, Rotem Oshman, Dafna Sadeh
2017	B	`conf`	Lower Bounds for Subgraph Detection in the CONGEST Model. OPODIS Tzlil Gonen, Rotem Oshman
2017	J	`jnl`	On The Multiparty Communication Complexity of Testing Triangle-Freeness. CoRR Orr Fischer, Shay Gershtein, Rotem Oshman
2017	A*	`conf`	On the Multiparty Communication Complexity of Testing Triangle-Freeness. PODC Orr Fischer, Shay Gershtein, Rotem Oshman
2017	J	`jnl`	Superlinear Lower Bounds for Distributed Subgraph Detection. CoRR Orr Fischer, Tzlil Gonen, Rotem Oshman
2017	A	`conf`	Three Notes on Distributed Property Testing. DISC Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca
2016	B	`conf`	Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. SIROCCO Orr Fischer, Rotem Oshman, Uri Zwick
2015	A*	`conf`	On Information Complexity in the Broadcast Model. PODC Mark Braverman, Rotem Oshman
2015	J	`jnl`	The Communication Complexity of Number-In-Hand Set Disjointness with No Promise. Electron. Colloquium Comput. Complex. Mark Braverman, Rotem Oshman
2014	B	`conf`	Communication Complexity Lower Bounds in Distributed Message-Passing. SIROCCO Rotem Oshman
2014	A*	`conf`	On the power of the congested clique model. PODC Andrew Drucker, Fabian Kuhn, Rotem Oshman
2013	A*	`conf`	A Tight Bound for Set Disjointness in the Message-Passing Model. FOCS Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan
2013	A*	`conf`	The SkipTrie: low-depth concurrent search without rebalancing. PODC Rotem Oshman, Nir Shavit
2013	J	`jnl`	Tight Bounds for Set Disjointness in the Message Passing Model CoRR Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan
2012	A*	`conf`	The communication complexity of distributed task allocation. PODC Andrew Drucker, Fabian Kuhn, Rotem Oshman
2011	A*	`conf`	Coordinated consensus in dynamic networks. PODC Fabian Kuhn, Yoram Moses, Rotem Oshman
2011	J	`jnl`	Dynamic networks: models and algorithms. SIGACT News Fabian Kuhn, Rotem Oshman
2011	J	`jnl`	Gradient Clock Synchronization in Dynamic Networks. Theory Comput. Syst. Fabian Kuhn, Thomas Locher, Rotem Oshman
2011	A*	`conf`	Resilience of mutual exclusion algorithms to transient memory faults. PODC Thomas Moscibroda, Rotem Oshman
2011	A	`conf`	The Complexity of Data Aggregation in Directed Networks. DISC Fabian Kuhn, Rotem Oshman
2010	A*	`conf`	Broadcasting in unreliable radio networks. PODC Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Rotem Oshman, Andréa W. Richa
2010	A*	`conf`	Distributed computation in dynamic networks. STOC Fabian Kuhn, Nancy A. Lynch, Rotem Oshman
2010	J	`jnl`	Optimal Gradient Clock Synchronization in Dynamic Networks CoRR Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman
2010	A*	`conf`	Optimal gradient clock synchronization in dynamic networks. PODC Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman
2009	B	`conf`	An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking. VMCAI Rotem Oshman
2009	B	`conf`	Gradient Clock Synchronization Using Reference Broadcasts. OPODIS Fabian Kuhn, Rotem Oshman
2009	J	`jnl`	Gradient Clock Synchronization using Reference Broadcasts CoRR Fabian Kuhn, Rotem Oshman
2009	B	`conf`	Gradient clock synchronization in dynamic networks. SPAA Fabian Kuhn, Thomas Locher, Rotem Oshman
2007	B	`conf`	A New Approach to Bounded Model Checking for Branching Time Logics. ATVA Rotem Oshman, Orna Grumberg