Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Distributed Computing: A Locality-Sensitive Approach
This map shows the geographic impact of David Peleg'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 David Peleg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Peleg more than expected).
This network shows the impact of papers produced by David Peleg. 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 David Peleg. The network helps show where David Peleg may publish in the future.
Co-authorship network of co-authors of David Peleg
This figure shows the co-authorship network connecting the top 25 collaborators of David Peleg.
A scholar is included among the top collaborators of David Peleg 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 David Peleg. David Peleg 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.
Bar-Noy, Amotz, et al.. (2024). Graph realization of distance sets. Theoretical Computer Science. 1019. 114810–114810.1 indexed citations
Peleg, David. (1996). Majority Voting, Coalitions and Monopolies in Graphs.. 152–169.1 indexed citations
13.
Dolev, Shlomi, Evangelos Kranakis, Danny Kriz̧anc, & David Peleg. (1995). Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract).. 528–537.1 indexed citations
14.
Kortsarz, Guy & David Peleg. (1994). Generating low-degree 2-spanners. Symposium on Discrete Algorithms. 556–563.2 indexed citations
15.
Kortsarz, Guy & David Peleg. (1993). On Choosing a Dense Subgraph (Extended Abstract). 692–701.9 indexed citations
16.
Garay, Juan A., Shay Kutten, & David Peleg. (1993). A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract). 659–668.2 indexed citations
17.
Bar‐Ilan, Judit & David Peleg. (1991). Approximation Algorithms for Selecting Network Centers (Preliminary Vesion).. 343–354.1 indexed citations
18.
Feige, Uriel, David Peleg, Prabhakar Raghavan, & Eli Upfal. (1990). Computing with Unreliable Information (Preliminary Version). 128–137.1 indexed citations
Choueka, Yaacov & David Peleg. (1983). A note of omega-regular languages.. Bulletin of the European Association for Theoretical Computer Science. 21. 21–23.4 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.