Merav Parter

1.3k total citations
61 papers, 509 citations indexed

About

Merav Parter is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Merav Parter has authored 61 papers receiving a total of 509 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computer Networks and Communications, 38 papers in Computational Theory and Mathematics and 17 papers in Artificial Intelligence. Recurrent topics in Merav Parter's work include Complexity and Algorithms in Graphs (34 papers), Advanced Graph Theory Research (18 papers) and Optimization and Search Problems (12 papers). Merav Parter is often cited by papers focused on Complexity and Algorithms in Graphs (34 papers), Advanced Graph Theory Research (18 papers) and Optimization and Search Problems (12 papers). Merav Parter collaborates with scholars based in Israel, United States and Switzerland. Merav Parter's co-authors include Nadav Kashtan, Uri Alon, Uri Alon, Mohsen Ghaffari, David Peleg, Zvi Lotker, E. Dekel, Avi Mayo, Eylon Yogev and Peter Maxwell Davies and has published in prestigious journals such as Evolution, PLoS Computational Biology and Journal of the ACM.

In The Last Decade

Merav Parter

51 papers receiving 493 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Merav Parter Israel 9 190 147 122 111 98 61 509
Erik Rauch United States 14 212 1.1× 180 1.2× 72 0.6× 167 1.5× 109 1.1× 18 819
Bart Naudts Belgium 13 279 1.5× 61 0.4× 171 1.4× 78 0.7× 372 3.8× 28 830
M. Venkatesulu India 9 116 0.6× 51 0.3× 33 0.3× 122 1.1× 117 1.2× 41 480
Steven Myers United States 13 48 0.3× 158 1.1× 27 0.2× 99 0.9× 157 1.6× 43 615
Boris Ryabko Russia 14 82 0.4× 59 0.4× 184 1.5× 73 0.7× 306 3.1× 95 651
Juan C. Pichel Spain 13 189 1.0× 171 1.2× 43 0.4× 34 0.3× 155 1.6× 54 577
Marc Hellmuth Germany 10 183 1.0× 48 0.3× 137 1.1× 99 0.9× 58 0.6× 54 352
Andreas Pavlogiannis Austria 13 40 0.2× 130 0.9× 127 1.0× 176 1.6× 95 1.0× 51 522
Alan Veliz‐Cuba United States 14 535 2.8× 38 0.3× 137 1.1× 94 0.8× 46 0.5× 28 672
Konstantinos Giannakis Greece 9 83 0.4× 72 0.5× 40 0.3× 37 0.3× 97 1.0× 40 299

Countries citing papers authored by Merav Parter

Since Specialization
Citations

This map shows the geographic impact of Merav Parter'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 Merav Parter with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Merav Parter more than expected).

Fields of papers citing papers by Merav Parter

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Merav Parter. 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 Merav Parter. The network helps show where Merav Parter may publish in the future.

Co-authorship network of co-authors of Merav Parter

This figure shows the co-authorship network connecting the top 25 collaborators of Merav Parter. A scholar is included among the top collaborators of Merav Parter 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 Merav Parter. Merav Parter is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Czumaj, Artur, et al.. (2024). Component stability in low-space massively parallel computation. Distributed Computing. 37(1). 35–64.
2.
Parter, Merav, et al.. (2023). Distributed CONGEST Algorithms against Mobile Adversaries. 262–273.
3.
Parter, Merav, et al.. (2022). Exponentially Faster Shortest Paths in the Congested Clique. Journal of the ACM. 69(4). 1–42. 1 indexed citations
4.
Chuzhoy, Julia, et al.. (2020). On Packing Low-Diameter Spanning Trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
5.
Parter, Merav, et al.. (2020). The Computational Cost of Asynchronous Neural Communication. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
6.
Parter, Merav. (2020). Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers.. arXiv (Cornell University). 1 indexed citations
7.
Lynch, Nancy, et al.. (2020). Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 31. 1 indexed citations
8.
Parter, Merav & Eylon Yogev. (2019). Low congestion cycle covers and their applications. arXiv (Cornell University). 1673–1692. 2 indexed citations
9.
Parter, Merav & Eylon Yogev. (2019). Distributed algorithms made secure: a graph theoretic approach. Symposium on Discrete Algorithms. 1693–1710. 2 indexed citations
10.
Parter, Merav & Eylon Yogev. (2019). Secure Distributed Computing Made (Nearly) Optimal. 107–116. 2 indexed citations
11.
Parter, Merav. (2016). Fault-Tolerant Logical Network Structures. Bulletin of the European Association for Theoretical Computer Science. 1(118). 5 indexed citations
12.
Chechik, Shiri, et al.. (2016). Secluded Connectivity Problems. Algorithmica. 79(3). 708–741. 10 indexed citations
13.
Ghaffari, Mohsen & Merav Parter. (2016). A Polylogarithmic Gossip Algorithm for Plurality Consensus. 117–126. 16 indexed citations
14.
Lotker, Zvi, et al.. (2015). The Topology of Wireless Communication. Journal of the ACM. 62(5). 1–32. 5 indexed citations
15.
Parter, Merav, David Peleg, & Shay Solomon. (2015). Local-on-Average Distributed Tasks. 220–239. 2 indexed citations
16.
Avin, Chen, Michael Borokhovich, Yoram Haddad, et al.. (2013). Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications. 478–497. 4 indexed citations
17.
Avin, Chen, Asaf Cohen, Yoram Haddad, et al.. (2012). SINR diagram with interference cancellation. Symposium on Discrete Algorithms. 502–515. 2 indexed citations
18.
Lotker, Zvi, et al.. (2011). The topology of wireless communication. 383–392. 10 indexed citations
19.
Kashtan, Nadav, Merav Parter, E. Dekel, Avi Mayo, & Uri Alon. (2009). EXTINCTIONS IN HETEROGENEOUS ENVIRONMENTS AND THE EVOLUTION OF MODULARITY. Evolution. 63(8). 1964–1975. 30 indexed citations
20.
Parter, Merav, Nadav Kashtan, & Uri Alon. (2008). Facilitated Variation: How Evolution Learns from Past Environments To Generalize to New Environments. PLoS Computational Biology. 4(11). e1000206–e1000206. 117 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

Breakdown of academic impact, for papers by Erik Rauch Breakdown of academic impact, for papers by Bart Naudts Breakdown of academic impact, for papers by M. Venkatesulu Breakdown of academic impact, for papers by Steven Myers Breakdown of academic impact, for papers by Boris Ryabko Breakdown of academic impact, for papers by Juan C. Pichel Breakdown of academic impact, for papers by Marc Hellmuth Breakdown of academic impact, for papers by Andreas Pavlogiannis Breakdown of academic impact, for papers by Alan Veliz‐Cuba Breakdown of academic impact, for papers by Konstantinos Giannakis
Rankless by CCL
2026