default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRotem Oshman
Person information
- affiliation: Tel-Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c49]Hagit Attiya
, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. PODC 2024: 14-24- [c48]Mark Braverman, Rotem Oshman, Tal Roth:
Multi-Party Set Disjointness and Intersection with Bounded Dependence. PODC 2024: 332-342 - [c47]Eden Aldema Tshuva, Rotem Oshman:
Fully Local Succinct Distributed Arguments. DISC 2024: 1:1-1:24 - [i15]Hagit Attiya, Michael A. Bender, Martin Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. CoRR abs/2403.14445 (2024) - [i14]Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman:
Locally Verifiable Distributed SNARGs. IACR Cryptol. ePrint Arch. 2024: 1385 (2024) - 2023
- [j6]Orr Fischer, Rotem Oshman:
A distributed algorithm for directed minimum-weight spanning tree. Distributed Comput. 36(1): 57-87 (2023) - [c46]Rotem Oshman, Tal Roth:
The Communication Complexity of Set Intersection Under Product Distributions. ICALP 2023: 95:1-95:20 - [c45]Uri Meir, Rotem Oshman, Ofer Shayevitz, Yuval Volkov:
Resilience of 3-Majority Dynamics to Non-Uniform Schedulers. ITCS 2023: 86:1-86:19 - [c44]Eden Aldema Tshuva, Rotem Oshman:
On Polynomial Time Local Decision. OPODIS 2023: 27:1-27:17 - [c43]Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman:
Locally Verifiable Distributed SNARGs. TCC (1) 2023: 65-90 - [e3]Rotem Oshman, Alexandre Nolin, Magnús M. Halldórsson, Alkida Balliu:
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023. ACM 2023 [contents] - [e2]Rotem Oshman:
37th International Symposium on Distributed Computing, DISC 2023, October 10-12, 2023, L'Aquila, Italy. LIPIcs 281, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-301-0 [contents] - [i13]Orr Fischer, Adi Horowitz, Rotem Oshman:
Massively Parallel Computation in a Heterogeneous Regime. CoRR abs/2302.14692 (2023) - 2022
- [j5]Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Comput. 35(3): 207-234 (2022) - [c42]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. ITCS 2022: 35:1-35:25 - [c41]Eden Aldema Tshuva, Rotem Oshman:
Brief Announcement: On Polynomial-Time Local Decision. PODC 2022: 48-50 - [c40]Orr Fischer, Adi Horowitz, Rotem Oshman:
Massively Parallel Computation in a Heterogeneous Regime. PODC 2022: 345-355 - [c39]Yoav Ben Shimon, Orr Fischer, Rotem Oshman:
Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs. SIROCCO 2022: 21-41 - [c38]Aviv Bick, Gillat Kol, Rotem Oshman:
Distributed Zero-Knowledge Proofs Over Networks. SODA 2022: 2426-2458 - [i12]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. CoRR abs/2201.03000 (2022) - 2021
- [j4]Assaf Ben-Yishai, Young-Han Kim, Rotem Oshman, Ofer Shayevitz:
On the Interactive Capacity of Finite-State Protocols. Entropy 23(1): 17 (2021) - [c37]Orr Fischer, Rotem Oshman, Dana Shamir:
Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators. OPODIS 2021: 21:1-21:22 - [c36]Nachum Dershowitz, Rotem Oshman, Tal Roth:
The communication complexity of multiparty set disjointness under product distributions. STOC 2021: 1194-1207 - [c35]Lior Solodkin, Rotem Oshman:
Truthful Information Dissemination in General Asynchronous Networks. DISC 2021: 37:1-37:19 - [e1]Quentin Bramas, Rotem Oshman, Paolo Romano:
24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference). LIPIcs 184, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-176-4 [contents] - [i11]Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. CoRR abs/2101.07590 (2021) - [i10]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. CoRR abs/2105.01958 (2021) - 2020
- [j3]Orr Fischer, Rotem Oshman, Uri Zwick:
Public vs. private randomness in simultaneous multi-party communication complexity. Theor. Comput. Sci. 810: 72-81 (2020) - [c34]Sepehr Assadi, Gillat Kol, Rotem Oshman:
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. PODC 2020: 79-88 - [c33]Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. DISC 2020: 33:1-33:17 - [i9]Assaf Ben-Yishai, Young-Han Kim, Rotem Oshman, Ofer Shayevitz:
On the Interactive Capacity of Finite-State Protocols. CoRR abs/2001.00499 (2020)
2010 – 2019
- 2019
- [c32]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. ITCS 2019: 40:1-40:16 - [c31]Uri Meir, Dor Minzer, Rotem Oshman:
Can Distributed Uniformity Testing Be Local? PODC 2019: 228-237 - [c30]Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
On Distributed Merlin-Arthur Decision Protocols. SIROCCO 2019: 230-245 - [c29]Mark Braverman, Gillat Kol, Rotem Oshman, Avishay Tal:
On the Computational Power of Radio Channels. DISC 2019: 8:1-8:17 - [c28]Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. DISC 2019: 15:1-15:16 - [c27]Orr Fischer, Rotem Oshman:
A Distributed Algorithm for Directed Minimum-Weight Spanning Tree. DISC 2019: 16:1-16:16 - 2018
- [c26]Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena:
Interactive Distributed Proofs. PODC 2018: 255-264 - [c25]Orr Fischer, Uri Meir, Rotem Oshman:
Distributed Uniformity Testing. PODC 2018: 455-464 - [c24]Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman:
Possibilities and Impossibilities for Distributed Subgraph Detection. SPAA 2018: 153-162 - [c23]Mohamad Ahmadi, Fabian Kuhn, Rotem Oshman:
Distributed Approximate Maximum Matching in the CONGEST Model. DISC 2018: 6:1-6:17 - [i8]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c22]Mark Braverman, Rotem Oshman:
A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness. FOCS 2017: 144-155 - [c21]Tzlil Gonen, Rotem Oshman:
Lower Bounds for Subgraph Detection in the CONGEST Model. OPODIS 2017: 6:1-6:16 - [c20]Orr Fischer, Shay Gershtein, Rotem Oshman:
On the Multiparty Communication Complexity of Testing Triangle-Freeness. PODC 2017: 111-120 - [c19]Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
Three Notes on Distributed Property Testing. DISC 2017: 15:1-15:30 - [c18]Gillat Kol, Rotem Oshman, Dafna Sadeh:
Interactive Compression for Multi-Party Protocol. DISC 2017: 31:1-31:15 - [i7]Orr Fischer, Tzlil Gonen, Rotem Oshman:
Distributed Property Testing for Subgraph-Freeness Revisited. CoRR abs/1705.04033 (2017) - [i6]Orr Fischer, Shay Gershtein, Rotem Oshman:
On The Multiparty Communication Complexity of Testing Triangle-Freeness. CoRR abs/1705.08438 (2017) - [i5]Orr Fischer, Tzlil Gonen, Rotem Oshman:
Superlinear Lower Bounds for Distributed Subgraph Detection. CoRR abs/1711.06920 (2017) - 2016
- [c17]Orr Fischer, Rotem Oshman, Uri Zwick:
Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. SIROCCO 2016: 60-74 - 2015
- [c16]Mark Braverman, Rotem Oshman:
On Information Complexity in the Broadcast Model. PODC 2015: 355-364 - [i4]Mark Braverman, Rotem Oshman:
The Communication Complexity of Number-In-Hand Set Disjointness with No Promise. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c15]Andrew Drucker, Fabian Kuhn, Rotem Oshman:
On the power of the congested clique model. PODC 2014: 367-376 - [c14]Rotem Oshman:
Communication Complexity Lower Bounds in Distributed Message-Passing. SIROCCO 2014: 14-17 - 2013
- [c13]Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan:
A Tight Bound for Set Disjointness in the Message-Passing Model. FOCS 2013: 668-677 - [c12]Rotem Oshman, Nir Shavit:
The SkipTrie: low-depth concurrent search without rebalancing. PODC 2013: 23-32 - [i3]Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan:
Tight Bounds for Set Disjointness in the Message Passing Model. CoRR abs/1305.4696 (2013) - 2012
- [c11]Andrew Drucker, Fabian Kuhn, Rotem Oshman:
The communication complexity of distributed task allocation. PODC 2012: 67-76 - 2011
- [j2]Fabian Kuhn, Thomas Locher, Rotem Oshman:
Gradient Clock Synchronization in Dynamic Networks. Theory Comput. Syst. 49(4): 781-816 (2011) - [j1]Fabian Kuhn, Rotem Oshman:
Dynamic networks: models and algorithms. SIGACT News 42(1): 82-96 (2011) - [c10]Fabian Kuhn, Yoram Moses, Rotem Oshman:
Coordinated consensus in dynamic networks. PODC 2011: 1-10 - [c9]Thomas Moscibroda, Rotem Oshman:
Resilience of mutual exclusion algorithms to transient memory faults. PODC 2011: 69-78 - [c8]Fabian Kuhn, Rotem Oshman:
The Complexity of Data Aggregation in Directed Networks. DISC 2011: 416-431 - 2010
- [c7]Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Rotem Oshman, Andréa W. Richa:
Broadcasting in unreliable radio networks. PODC 2010: 336-345 - [c6]Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman:
Optimal gradient clock synchronization in dynamic networks. PODC 2010: 430-439 - [c5]Fabian Kuhn, Nancy A. Lynch, Rotem Oshman:
Distributed computation in dynamic networks. STOC 2010: 513-522 - [i2]Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman:
Optimal Gradient Clock Synchronization in Dynamic Networks. CoRR abs/1005.2894 (2010)
2000 – 2009
- 2009
- [c4]Fabian Kuhn, Rotem Oshman:
Gradient Clock Synchronization Using Reference Broadcasts. OPODIS 2009: 204-218 - [c3]Fabian Kuhn, Thomas Locher, Rotem Oshman:
Gradient clock synchronization in dynamic networks. SPAA 2009: 270-279 - [c2]Rotem Oshman:
An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking. VMCAI 2009: 275-289 - [i1]Fabian Kuhn, Rotem Oshman:
Gradient Clock Synchronization using Reference Broadcasts. CoRR abs/0905.3454 (2009) - 2007
- [c1]Rotem Oshman, Orna Grumberg:
A New Approach to Bounded Model Checking for Branching Time Logics. ATVA 2007: 410-424
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
