Rotem Oshman

1.5k total citations
36 papers, 533 citations indexed

About

Rotem Oshman is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Rotem Oshman has authored 36 papers receiving a total of 533 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computer Networks and Communications, 22 papers in Computational Theory and Mathematics and 16 papers in Artificial Intelligence. Recurrent topics in Rotem Oshman's work include Complexity and Algorithms in Graphs (21 papers), Distributed systems and fault tolerance (15 papers) and Optimization and Search Problems (13 papers). Rotem Oshman is often cited by papers focused on Complexity and Algorithms in Graphs (21 papers), Distributed systems and fault tolerance (15 papers) and Optimization and Search Problems (13 papers). Rotem Oshman collaborates with scholars based in Israel, United States and Switzerland. Rotem Oshman's co-authors include Fabian Kühn, Nancy Lynch, Andrew Drucker, Yoram Moses, Thomas Locher, Mark Braverman, Nir Shavit, Toniann Pitassi, Faith Ellen and Vinod Vaikuntanathan and has published in prestigious journals such as Theoretical Computer Science, Theory of Computing Systems and Distributed Computing.

In The Last Decade

Rotem Oshman

31 papers receiving 520 citations

Peers

Rotem Oshman

CNC

CTM

AI

EEE

HA

Mohsen Ghaffari Switzerland

Philipp Woelfel Canada

Loukas Georgiadis Greece

Robert Elsässer⋆ Germany

Krzysztof Diks Poland

Stephan Kreutzer Germany

Michal Koucký Czechia

Bogdan S. Chlebus United States

Russell Bradford United Kingdom

Aimin Pan China

Mohsen Ghaffari Switzerland

Rotem Oshman

392 ×0.9

CNC

380 ×2.0

CTM

217 ×2.0

AI

55 ×1.4

EEE

17 ×0.5

HA

Citations per year, relative to Rotem Oshman Rotem Oshman (= 1×) peers Mohsen Ghaffari

Countries citing papers authored by Rotem Oshman

Since Specialization

Citations

This map shows the geographic impact of Rotem Oshman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Rotem Oshman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rotem Oshman more than expected).

Fields of papers citing papers by Rotem Oshman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Rotem Oshman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Rotem Oshman. The network helps show where Rotem Oshman may publish in the future.

Co-authorship network of co-authors of Rotem Oshman

This figure shows the co-authorship network connecting the top 25 collaborators of Rotem Oshman. A scholar is included among the top collaborators of Rotem Oshman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Rotem Oshman. Rotem Oshman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Attiya, Hagit, et al.. (2025). History-Independent Concurrent Hash Tables. 1283–1294. 1 indexed citations

2.

Attiya, Hagit, et al.. (2024). History-Independent Concurrent Objects. 14–24. 1 indexed citations

3.

Oshman, Rotem, et al.. (2022). Massively Parallel Computation in a Heterogeneous Regime. 345–355. 1 indexed citations

4.

Oshman, Rotem, et al.. (2021). A distributed algorithm for directed minimum-weight spanning tree. Distributed Computing. 36(1). 57–87. 3 indexed citations

5.

Dershowitz, Nachum, et al.. (2021). The communication complexity of multiparty set disjointness under product distributions. 1194–1207.

6.

Assadi, Sepehr, Gillat Kol, & Rotem Oshman. (2020). Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. View. 79–88. 3 indexed citations

7.

Censor-Hillel, Keren, et al.. (2020). Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

8.

Oshman, Rotem, et al.. (2019). A Distributed Algorithm for Directed Minimum-Weight Spanning Tree. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

9.

Haitner, Iftach, et al.. (2019). On the Communication Complexity of Key-Agreement Protocols. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 25. 16.

10.

Oshman, Rotem, et al.. (2018). Public vs. private randomness in simultaneous multi-party communication complexity. Theoretical Computer Science. 810. 72–81. 1 indexed citations

11.

Kol, Gillat, et al.. (2018). Interactive Distributed Proofs. 255–264. 6 indexed citations

12.

Kühn, Fabian, et al.. (2018). Distributed Approximate Maximum Matching in the CONGEST Model. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 8 indexed citations

13.

Braverman, Mark & Rotem Oshman. (2017). A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness. 144–155. 6 indexed citations

14.

Oshman, Rotem, et al.. (2017). On the Multiparty Communication Complexity of Testing Triangle-Freeness. 75. 111–120. 1 indexed citations

15.

Braverman, Mark & Rotem Oshman. (2015). The Communication Complexity of Number-In-Hand Set Disjointness with No Promise.. Electronic colloquium on computational complexity. 22. 2.

16.

Oshman, Rotem & Nir Shavit. (2013). The SkipTrie. DSpace@MIT (Massachusetts Institute of Technology). 23–32. 20 indexed citations

17.

Drucker, Andrew, Fabian Kühn, & Rotem Oshman. (2012). The communication complexity of distributed task allocation. 67–76. 12 indexed citations

18.

Kühn, Fabian, Thomas Locher, & Rotem Oshman. (2011). Gradient Clock Synchronization in Dynamic Networks. Theory of Computing Systems. 49(4). 781–816. 8 indexed citations

19.

Kühn, Fabian, Christoph Lenzen, Thomas Locher, & Rotem Oshman. (2010). Optimal gradient clock synchronization in dynamic networks. 430–439. 14 indexed citations

20.

Kühn, Fabian, Thomas Locher, & Rotem Oshman. (2009). Gradient clock synchronization in dynamic networks. 270–279. 18 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact