David Peleg

Active 1983–2026

397
Papers
18,145
Citations
78
h-index
230
i10-index

Citations

Citations per year for David Peleg1971: 1 citations1974: 1 citations1982: 1 citations1983: 2 citations1984: 4 citations1985: 5 citations1986: 6 citations1987: 8 citations1988: 19 citations1989: 30 citations1990: 55 citations1991: 47 citations1992: 102 citations1993: 102 citations1994: 116 citations1995: 143 citations1996: 136 citations1997: 145 citations1998: 172 citations1999: 152 citations2000: 180 citations2001: 276 citations2002: 201 citations2003: 290 citations2004: 283 citations2005: 318 citations2006: 421 citations2007: 403 citations2008: 472 citations2009: 483 citations2010: 409 citations2011: 471 citations2012: 472 citations2013: 498 citations2014: 534 citations2015: 573 citations2016: 505 citations2017: 526 citations2018: 551 citations2019: 532 citations2020: 530 citations2021: 613 citations2022: 329 citations2023: 282 citations2024: 290 citations2025: 257 citations2026: 116 citations1972–1973: no citations, so these years are not shown1975–1981: no citations, so these years are not shown

Citation sources

Countries

World map of the countries and regions citing this authorUnited States: 2,638 citing papers, 25.2% of this breakdownIsrael: 1,155 citing papers, 11% of this breakdownFrance: 863 citing papers, 8.2% of this breakdownCanada: 639 citing papers, 6.1% of this breakdownGermany: 628 citing papers, 6% of this breakdownUnited Kingdom: 425 citing papers, 4.1% of this breakdownItaly: 409 citing papers, 3.9% of this breakdownChina: 397 citing papers, 3.8% of this breakdownIndia: 385 citing papers, 3.7% of this breakdownSwitzerland: 350 citing papers, 3.3% of this breakdownJapan: 275 citing papers, 2.6% of this breakdownPoland: 178 citing papers, 1.7% of this breakdown
0%25.2%Other 20.4%

Fields

  • Computer Science83.2%
  • Engineering4.8%
  • Physics and Astronomy4.2%
  • Medicine1.9%
  • Decision Sciences1.4%
  • Business, Management and Accounting1.1%
  • Other3.4%

Topics

  • Complexity and Algorithms in Graphs10.1%
  • Optimization and Search Problems8.6%
  • Advanced Graph Theory Research7.1%
  • Distributed systems and fault tolerance6.9%
  • Mobile Ad Hoc Networks3.8%
  • Interconnection Networks and Systems3.1%
  • Other60.4%

Coauthors

All papers

Open in search
  1. The Dense k-Subgraph Problem

    Authors: , , - Algorithmica 2001 cited by 602

  2. Graph spanners

    Authors: , - Journal of Graph Theory, J. Graph Theory 1989 cited by 419

  3. Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

    Authors: , - SIAM Journal on Computing, SIAM J. Comput. 2004 cited by 269

  4. Proof labeling schemes

    Authors: , , - Distributed Computing, Distributed Comput. 2005 cited by 188

  5. A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction

    Authors: , - SIAM Journal on Computing, SIAM J. Comput. 2000 cited by 161

  6. Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II

    Authors: , , , - Lecture notes in computer science, ICALP (2) 2013 cited by 51

  7. How to Allocate Network Centers

    Authors: , , - Journal of Algorithms, J. Algorithms 1993 cited by 172

  8. Homophily and the Glass Ceiling Effect in Social Networks

    Authors: , , , , , - Conference on Innovations in Theoretical Computer Science, ITCS 2015 cited by 88

  9. Distance labeling in graphs

    Authors: , , , - Journal of Algorithms, J. Algorithms 2001 cited by 226

  10. Distributed Verification and Hardness of Distributed Approximation

    Authors: , , , , , , , - forty-third annual ACM symposium on Theory of computing, SIAM J. Comput. 2011 cited by 215

  11. A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees

    Authors: , , - SIAM Journal on Computing, SIAM J. Comput. 1998 cited by 181

  12. Graph Exploration by a Finite Automaton

    Authors: , , , , - Lecture notes in computer science, MFCS 2004 cited by 176

  13. Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I

    Authors: , , , - Lecture notes in computer science, ICALP (1) 2013 cited by 66

  14. A trade-off between space and efficiency for routing tables

    Authors: , - Journal of the ACM, J. ACM 1989 cited by 350

  15. A Graph-Theoretic Game and Its Application to the k-Server Problem

    Authors: , , , - SIAM Journal on Computing, SIAM J. Comput. 1995 cited by 316

  16. Local majorities, coalitions and monopolies in graphs: a review

    Authors: - Theoretical Computer Science, Theor. Comput. Sci. 2002 cited by 203

  17. Computing with Noisy Information

    Authors: , , , - SIAM Journal on Computing, SIAM J. Comput. 1994 cited by 314

  18. Routing with Polynomial Communication-Space Trade-Off

    Authors: , - SIAM Journal on Discrete Mathematics, SIAM J. Discret. Math. 1992 cited by 196

  19. An Optimal Synchronizer for the Hypercube

    Authors: , - sixth annual ACM Symposium on Principles of distributed computing - PODC '87 1987 cited by 347

  20. Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds

    Authors: , , , - SIAM Journal on Computing, SIAM J. Comput. 2005 cited by 124

  21. Distributed distance computation and routing with small messages

    Authors: , , - Distributed Computing, Distributed Comput. 2018 cited by 28

  22. Fast Distributed Construction of Small k-Dominating Sets and Applications

    Authors: , - Journal of Algorithms, J. Algorithms 1998 cited by 210

  23. Towards a complexity theory for local distributed computing

    Authors: , , - Journal of the ACM, J. ACM 2013 cited by 116

  24. Realtime Classification for Encrypted Traffic

    Authors: , , , - Lecture notes in computer science, SEA 2010 cited by 105