Shlomo Moran
About
In The Last Decade
Shlomo Moran
109 papers receiving 2.8k citations
Peers
Comparison fields: 5 of 120
- Computer Networks and Communications 1.4k
- Computational Theory and Mathematics 1.1k
- Artificial Intelligence 1.0k
- Information Systems 553
- Statistical and Nonlinear Physics 308
Countries citing papers authored by Shlomo Moran
This map shows the geographic impact of Shlomo Moran'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 Shlomo Moran with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shlomo Moran more than expected).
Fields of papers citing papers by Shlomo Moran
This network shows the impact of papers produced by Shlomo Moran. 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 Shlomo Moran. The network helps show where Shlomo Moran may publish in the future.
Co-authorship network of co-authors of Shlomo Moran
This figure shows the co-authorship network connecting the top 25 collaborators of Shlomo Moran. A scholar is included among the top collaborators of Shlomo Moran 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 Shlomo Moran. Shlomo Moran is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 1 | |
| 3 | Fast and reliable reconstruction of phylogenetic trees with very short edges | 11 |
| 4 | 1 | |
| 5 | 23 | |
| 6 | 5 | |
| 7 | 0 | |
| 8 | The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. | 11 |
| 9 | Wait-Freedom vs. Bounded-Freedom in Public Data Structures. | 1 |
| 10 | On the Robustness of h^r_m | 8 |
| 11 | 8 | |
| 12 | 13 | |
| 13 | 6 | |
| 14 | Deciding 1-solvability of distributed task is NP-hard (extended abstract) | 5 |
| 15 | On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract) | 0 |
| 16 | 20 | |
| 17 | Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version) | 4 |
| 18 | 32 | |
| 19 | 300 | |
| 20 | 5 |
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.