2026 David Peleg: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	89	648	630	12	10	457	26488

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

648

630

457

26488

Research.com Recognitions

2026 - Research.com Computer Science in Israel Leader Award
2025 - Research.com Computer Science in Israel Leader Award
2016 - ACM Fellow For contributions to distributed computing and graph algorithms.

Overview

David Peleg is affiliated with the Weizmann Institute of Science in Israel. Their research contributions span multiple areas within computer science, with a particular focus on graph theory, distributed computing, image processing, and network systems.

Their recent published work includes:

Mixed preferential attachment model: Homophily and minorities in social networks, 2020, Physica A Statistical Mechanics and its Applications
The generalized microscopic image reconstruction problem, 2022, Discrete Applied Mathematics
Efficiently Realizing Interval Sequences, 2020, SIAM Journal on Discrete Mathematics
Graph realizations: Maximum degree in vertex neighborhoods, 2023, Discrete Mathematics
Forcibly bipartite and acyclic (uni-)graphic sequences, 2023, Discrete Mathematics

Frequent collaborators include:

Amotz Bar-Noy
Dror Rawitz
Toni Böhnlein
Zvi Lotker
Yingli Ran

David Peleg has published extensively in these venues:

Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Theoretical Computer Science
arXiv (Cornell University)
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics

The main field of study for David Peleg is Computer Science, with publication distribution highlighting the following subfields:

Computer Networks and Communications
Computational Theory and Mathematics
Computer Vision and Pattern Recognition
Electrical and Electronic Engineering
Artificial Intelligence

The research topics covered by their work include:

Digital Image Processing Techniques
Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Interconnection Networks and Systems
Distributed systems and fault tolerance
Game Theory and Voting Systems
Medical Image Segmentation Techniques

In 2016, David Peleg was recognized as an ACM Fellow for contributions to distributed computing and graph algorithms.

Best Publications

Distributed Computing: A Locality-Sensitive Approach

David Peleg

1737
Citations
An optimal synchronizer for the hypercube

David Peleg;Jeffrey D. Ullman

1015
Citations
Distance labeling in graphs

Cyril Gavoille;David Peleg;Stéphane Pérennes;Ran Raz

758
Citations
The Dense k -Subgraph Problem

Uriel Feige;Guy Kortsarz;David Peleg

737
Citations
A trade-off between space and efficiency for routing tables

David Peleg;Eli Upfal

603
Citations
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

Noa Agmon;David Peleg

421
Citations
A lower bound for radio broadcast

Noga Alon;Noga Alon;Amotz Bar-Noy;Nathan Linial;Nathan Linial;David Peleg

417
Citations
Sparse partitions

B. Awerbuch;D. Peleg

403
Citations
Renaming in an asynchronous environment

Hagit Attiya;Amotz Bar-Noy;Danny Dolev;David Peleg

396
Citations
A Graph-Theoretic Game and its Application to the $k$-Server Problem

Noga Alon;Richard M. Karp;David Peleg;Douglas West

396
Citations
Computing with Noisy Information

Uriel Feige;Prabhakar Raghavan;David Peleg;Eli Upfal

361
Citations
Randomized broadcast in networks

Uriel Feige;David Peleg;Prabhakar Raghavan;Eli Upfal

343
Citations
Fast Distributed Construction of Smallk-Dominating Sets and Applications

Shay Kutten;David Peleg

339
Citations
The power of reconfiguration

Yosi Ben-Asher;David Peleg;R. Ramaswami;Assaf Schuster

336
Citations
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees

Juan A. Garay;Shay Kutten;David Peleg

297
Citations
Compact distributed data structures for adaptive routing

B. Awerbuch;Amotz Bar-Noy;Nathan Linial;D. Peleg

293
Citations
Concurrent online tracking of mobile users

Baruch Awerbuch;David Peleg

280
Citations
Local majorities, coalitions and monopolies in graphs: a review

David Peleg

276
Citations
Routing with polynomial communication-space trade-off

Baruch Awerbuch;David Peleg

272
Citations
Distributed Verification and Hardness of Distributed Approximation

Atish Das Sarma;Stephan Holzer;Liah Kor;Amos Korman

240
Citations
Graph spanners

Unknown

180
Citations

Frequent Co-Authors

Zvi Lotker Bar-Ilan University

Shay Kutten Technion – Israel Institute of Technology

Baruch Awerbuch Johns Hopkins University

Amotz Bar-Noy City University of New York

Andrzej Pelc Université du Québec en Outaouais

Eli Upfal Brown University

Guy Kortsarz Rutgers, The State University of New Jersey

Cyril Gavoille University of Bordeaux

Liam Roditty Bar-Ilan University

Boaz Patt-Shamir Tel Aviv University

External Links

Wikipedia of David Peleg Personal website of David Peleg Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees in Computer Science opens diverse options for students seeking flexible learning and versatile careers. Many learners gravitate toward programs that lead to short careers that pay well, allowing for faster entry into high-demand tech fields.

Artificial intelligence is another popular focus area within Computer Science. Pursuing an ai online degree can provide a competitive edge, as AI continues to power innovation across industries. These specialized degrees are often available online, making them accessible for students worldwide.

When selecting a major, it’s important to consider the best college degrees for the future. Fields like Computer Science, Data Science, and Software Engineering consistently top these lists for their promising career trajectories and earning potential.

For professionals seeking advancement, there are options among the easiest online master’s degree programs that provide both flexibility and relevant skills. Choosing the right path depends on your goals, desired pace, and preferred areas of study.