David Peleg
1983–2026 年に発表
- 397
- 論文数
- 18,145
- 被引用数
- 78
- h 指数
- 230
- i10 指数
被引用数
引用元
国・地域
機関
分野
- Computer Science83.2%
- Engineering4.8%
- Physics and Astronomy4.2%
- Medicine1.9%
- Decision Sciences1.4%
- Business, Management and Accounting1.1%
- その他3.4%
トピック
- 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%
- その他60.4%
共著者
- Amotz Bar-Noy40
- Zvi Lotker34
- Dror Rawitz30
- Shay Kutten27
- Baruch Awerbuch26
- Chen Avin21
- Merav Parter21
- Erez Kantor19
- Amos Korman17
- Toni Böhnlein16
- Andrzej Pelc15
- Cyril Gavoille15
- Eli Upfal14
- Guy Kortsarz12
- Pierre Fraigniaud12
- Shiri Chechik11
- Boaz Patt-Shamir10
- Liam Roditty10
- John Augustine9
- Avi Cohen8
- Avishai Wool8
- Gopal Pandurangan8
- Keerti Choudhary8
- Shachar Meir8
全論文
- The Dense k-Subgraph Problem
著者: Uriel Feige, Guy Kortsarz, David Peleg - Algorithmica 2001 被引用: 602
- Graph spanners
著者: David Peleg, Alejandro A. Schäffer - Journal of Graph Theory, J. Graph Theory 1989 被引用: 419
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
著者: Noa Agmon, David Peleg - SIAM Journal on Computing, SIAM J. Comput. 2004 被引用: 269
- Proof labeling schemes
著者: Amos Korman, Shay Kutten, David Peleg - Distributed Computing, Distributed Comput. 2005 被引用: 188
- A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
著者: David Peleg, Vitaly Rubinovich - SIAM Journal on Computing, SIAM J. Comput. 2000 被引用: 161
- Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II
著者: Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg - Lecture notes in computer science, ICALP (2) 2013 被引用: 51
- How to Allocate Network Centers
著者: Judit Bar-Ilan, Guy Kortsarz, David Peleg - Journal of Algorithms, J. Algorithms 1993 被引用: 172
- Homophily and the Glass Ceiling Effect in Social Networks
著者: Chen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne-Anne Pignolet - Conference on Innovations in Theoretical Computer Science, ITCS 2015 被引用: 88
- Distance labeling in graphs
著者: Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz - Journal of Algorithms, J. Algorithms 2001 被引用: 226
- Distributed Verification and Hardness of Distributed Approximation
著者: Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer - forty-third annual ACM symposium on Theory of computing, SIAM J. Comput. 2011 被引用: 215
- A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
著者: Juan A. Garay, Shay Kutten, David Peleg - SIAM Journal on Computing, SIAM J. Comput. 1998 被引用: 181
- Graph Exploration by a Finite Automaton
著者: Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg - Lecture notes in computer science, MFCS 2004 被引用: 176
- Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I
著者: Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg - Lecture notes in computer science, ICALP (1) 2013 被引用: 66
- A trade-off between space and efficiency for routing tables
著者: David Peleg, Eli Upfal - Journal of the ACM, J. ACM 1989 被引用: 350
- A Graph-Theoretic Game and Its Application to the k-Server Problem
著者: Noga Alon, Richard M. Karp, David Peleg, Douglas B. West - SIAM Journal on Computing, SIAM J. Comput. 1995 被引用: 316
- Local majorities, coalitions and monopolies in graphs: a review
著者: David Peleg - Theoretical Computer Science, Theor. Comput. Sci. 2002 被引用: 203
- Computing with Noisy Information
著者: Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal - SIAM Journal on Computing, SIAM J. Comput. 1994 被引用: 314
- Routing with Polynomial Communication-Space Trade-Off
著者: Baruch Awerbuch, David Peleg - SIAM Journal on Discrete Mathematics, SIAM J. Discret. Math. 1992 被引用: 196
- An Optimal Synchronizer for the Hypercube
著者: David Peleg, Jeffrey D. Ullman - sixth annual ACM Symposium on Principles of distributed computing - PODC '87 1987 被引用: 347
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
著者: Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, David Peleg - SIAM Journal on Computing, SIAM J. Comput. 2005 被引用: 124
- Distributed distance computation and routing with small messages
著者: Christoph Lenzen, Boaz Patt-Shamir, David Peleg - Distributed Computing, Distributed Comput. 2018 被引用: 28
- Fast Distributed Construction of Small k-Dominating Sets and Applications
著者: Shay Kutten, David Peleg - Journal of Algorithms, J. Algorithms 1998 被引用: 210
- Towards a complexity theory for local distributed computing
著者: Pierre Fraigniaud, Amos Korman, David Peleg - Journal of the ACM, J. ACM 2013 被引用: 116
- Realtime Classification for Encrypted Traffic
著者: Roni Bar - Yanai, Michael Langberg, David Peleg, Liam Roditty - Lecture notes in computer science, SEA 2010 被引用: 105
