The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
David Peleg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Baruch Awerbuch, David Peleg
    Concurrent Online Tracking of Mobile Users. [Citation Graph (2, 0)][DBLP]
    SIGCOMM, 1991, pp:221-233 [Conf]
  2. Baruch Awerbuch, David Peleg
    Sparse Partitions (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1990, pp:503-513 [Conf]
  3. David Peleg, Avishai Wool
    Crumbling Walls: A Class of Practical and Efficient Quorum Systems. [Citation Graph (1, 0)][DBLP]
    Distributed Computing, 1997, v:10, n:2, pp:87-97 [Journal]
  4. Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish
    A Tradeoff between Information and Communication in Broadcast Protocols. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:369-379 [Conf]
  5. David Peleg
    Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:1-4 [Conf]
  6. Erez Kantor, David Peleg
    Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:211-222 [Conf]
  7. David Peleg
    Localized Network Representations. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:1- [Conf]
  8. David Peleg
    Spanning Trees with Low Maximum/Average Stretch. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:6- [Conf]
  9. Reuven Cohen, David Peleg
    Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:228-239 [Conf]
  10. Limor Drori, David Peleg
    Faster Exact Solutions for Some NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:450-461 [Conf]
  11. Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg
    Approximate Distance Labeling Schemes. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:476-487 [Conf]
  12. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk
    Achievable Cases in an Asynchronous Environment (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:337-346 [Conf]
  13. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
    Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:638-647 [Conf]
  14. Baruch Awerbuch, David Peleg
    Network Synchronization with Polylogarithmic Overhead [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:514-522 [Conf]
  15. Juan A. Garay, Shay Kutten, David Peleg
    A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:659-668 [Conf]
  16. Shay Kutten, David Peleg
    Tight Fault Locality (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:704-713 [Conf]
  17. Guy Kortsarz, David Peleg
    On Choosing a Dense Subgraph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:692-701 [Conf]
  18. David Peleg, Vitaly Rubinovich
    A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:253-261 [Conf]
  19. David Peleg, Eli Upfal
    The Token Distribution Problem (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:418-427 [Conf]
  20. Yosi Ben-Asher, David Peleg, R. Ramaswami, Assaf Schuster
    The POwer of Reconfiguration. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:139-150 [Conf]
  21. Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
    Label-Guided Graph Exploration by a Finite Automaton. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:335-346 [Conf]
  22. Michael Elkin, David Peleg
    Strong Inapproximability of the Basic k-Spanner Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:636-647 [Conf]
  23. Yehuda Hassin, David Peleg
    Distributed Probabilistic Polling and Applications to Proportionate Agreement. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:402-411 [Conf]
  24. Amos Korman, David Peleg
    Labeling Schemes for Weighted Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:369-383 [Conf]
  25. Amos Korman, David Peleg
    Dynamic Routing Schemes for General Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:619-630 [Conf]
  26. David Peleg
    Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:164-175 [Conf]
  27. David Peleg, Eilon Reshef
    Deterministic Polylog Approximation for Minimum Communication Spanning Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:670-681 [Conf]
  28. David Peleg, Eilon Reshef
    A Variant of the Arrow Distributed Directory with Low Average Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:615-624 [Conf]
  29. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle
    Adaptive Collaboration in Peer-to-Peer Systems. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2005, pp:71-80 [Conf]
  30. Baruch Awerbuch, Shay Kutten, David Peleg
    On Buffer-Economical Store-and-Forward Deadlock Prevention. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1991, pp:410-414 [Conf]
  31. Michael Elkin, David Peleg
    Approximating k-Spanner Problems for k>2. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:90-104 [Conf]
  32. Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg
    Station Layouts in the Presence of Location Constraints. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:269-278 [Conf]
  33. Ornan Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg
    Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:68-77 [Conf]
  34. Amos Korman, David Peleg, Yoav Rodeh
    Constructing Labeling Schemes Through Universal Matrices. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:409-418 [Conf]
  35. Judit Bar-Ilan, Guy Kortsarz, David Peleg
    Generalized Submodular Cover Problems and Applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:110-118 [Conf]
  36. Guy Kortsarz, David Peleg
    Approximation Algorithms for Minimum Time Broadcast. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:67-78 [Conf]
  37. Yosi Ben-Asher, David Peleg, Assaf Schuster
    The Complexity of Reconfiguring Network Models. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:79-90 [Conf]
  38. Nathan Linial, David Peleg, Yuri Rabinovich, Michael E. Saks
    Sphere Packing and Local Majorities in Graphs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:141-149 [Conf]
  39. David Peleg, Gideon Schechtman, Avishai Wool
    Approximating Bounded 0-1 Integer Linear Programs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:69-77 [Conf]
  40. Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
    Labeling Schemes for Tree Representation. [Citation Graph (0, 0)][DBLP]
    IWDC, 2005, pp:13-24 [Conf]
  41. David Peleg
    Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges. [Citation Graph (0, 0)][DBLP]
    IWDC, 2005, pp:1-12 [Conf]
  42. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
    Graph Exploration by a Finite Automaton. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:451-462 [Conf]
  43. David Peleg
    Informative Labeling Schemes for Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:579-588 [Conf]
  44. David Peleg
    Low Stretch Spanning Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:68-80 [Conf]
  45. David Peleg
    Distributed Algorithms for Systems of Autonomous Mobile Robots. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:1- [Conf]
  46. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
    Fast Network Decomposition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1992, pp:169-177 [Conf]
  47. Baruch Awerbuch, Alan E. Baratz, David Peleg
    Cost-Sensitive Analysis of Communication Protocols. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:177-187 [Conf]
  48. Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
    Broadcast with Partial Knowledge (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:153-163 [Conf]
  49. Baruch Awerbuch, Shay Kutten, David Peleg
    Efficient Deadlock-Free Routing. [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:177-188 [Conf]
  50. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
    Assigning labels in unknown anonymous networks (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:101-111 [Conf]
  51. Tamar Eilam, Cyril Gavoille, David Peleg
    Compact Routing Schemes with Low Stretch Factor (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:11-20 [Conf]
  52. Leszek Gasieniec, Andrzej Pelc, David Peleg
    The wakeup problem in synchronous broadcast systems (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:113-121 [Conf]
  53. Leszek Gasieniec, David Peleg, Qin Xin
    Faster communication in known topology radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:129-137 [Conf]
  54. Karni Gilon, David Peleg
    Compact Deterministic Distributed Dictionaries (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:81-94 [Conf]
  55. Yehuda Hassin, David Peleg
    Sparse communication networks and efficient routing in the plane (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:41-50 [Conf]
  56. Yehuda Hassin, David Peleg
    Average probe complexity in quorum systems. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:180-189 [Conf]
  57. Amos Korman, Shay Kutten, David Peleg
    Proof labeling schemes. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:9-18 [Conf]
  58. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
    The Complexity of Data Mining on the Web (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:153- [Conf]
  59. Shay Kutten, David Peleg
    Fault-Local Distributed Mending (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:20-27 [Conf]
  60. Shay Kutten, David Peleg
    Fast Distributed Construction of k-Dominating Sets and Applications. [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:238-249 [Conf]
  61. Zvi Lotker, Boaz Patt-Shamir, David Peleg
    Distributed MST for constant diameter graphs. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:63-71 [Conf]
  62. Andrzej Pelc, David Peleg
    Feasibility and complexity of broadcasting with random transmission failures. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:334-341 [Conf]
  63. David Peleg, Barbara Simons
    On Fault Tolerant Routings in General Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1986, pp:98-107 [Conf]
  64. David Peleg, Jeffrey D. Ullman
    An Optimal Synchronizer for the Hypercube. [Citation Graph (0, 0)][DBLP]
    PODC, 1987, pp:77-85 [Conf]
  65. David Peleg, Avishai Wool
    Crumbling Walls: A Class of Practical and Efficient Quorum Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:120-129 [Conf]
  66. David Peleg, Avishai Wool
    How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:290-299 [Conf]
  67. Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
    Randomized Broadcast in Networks. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:128-137 [Conf]
  68. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle
    Collaboration of untrusting peers with changing interests. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:112-119 [Conf]
  69. Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
    Tight Bounds on the Size of 2-Monopolies. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:170-179 [Conf]
  70. Jean-Claude Bermond, David Peleg
    The Power of Small Coalitions in Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1995, pp:173-184 [Conf]
  71. Michael Elkin, David Peleg
    The Client-Server 2-Spanner Problem with Applications to Network Design. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:117-132 [Conf]
  72. Reuven Cohen, David Peleg
    Local Algorithms for Autonomous Robot Systems. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:29-43 [Conf]
  73. Reuven Cohen, David Peleg
    Robot Convergence via Center-of-Gravity Algorithms. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:79-88 [Conf]
  74. Yehuda Hassin, David Peleg
    Extremal bounds for probabilistic polling in graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:167-180 [Conf]
  75. Rachel Matichin, David Peleg
    Approximation Algorithm for Hotlink Assignment in the Greedy Model. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:233-244 [Conf]
  76. David Peleg
    Majority Voting, Coalitions and Monopolies in Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:152-169 [Conf]
  77. David Peleg
    Approximating Minimum Communication Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:1-11 [Conf]
  78. David Peleg
    Size Bounds for Dynamic Monopolies. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:151-161 [Conf]
  79. Pilar de la Torre, Lata Narayanan, David Peleg
    Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper). [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:214-228 [Conf]
  80. Noa Agmon, David Peleg
    Fault-tolerant gathering algorithms for autonomous mobile robots. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1070-1078 [Conf]
  81. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle
    Improved recommendation systems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1174-1183 [Conf]
  82. Yuval Emek, David Peleg
    Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:261-270 [Conf]
  83. Yuval Emek, David Peleg
    A tight upper bound on the probabilistic embedding of series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1045-1053 [Conf]
  84. Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz
    Distance labeling in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:210-219 [Conf]
  85. Michal Katz, Nir A. Katz, Amos Korman, David Peleg
    Labeling schemes for flow and connectivity. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:927-936 [Conf]
  86. Guy Kortsarz, David Peleg
    Generating Low-Degree 2-Spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:556-563 [Conf]
  87. Guy Kortsarz, David Peleg
    Approximating Shallow-Light Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:103-110 [Conf]
  88. Shay Kutten, David Peleg, Uzi Vishkin
    Deterministic resource discovery in distributed networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:77-83 [Conf]
  89. Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg
    MST construction in O(log log n) communication rounds. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:94-100 [Conf]
  90. Shay Kutten, David Peleg
    Asynchronous Resource Discovery in Peer to Peer Networks. [Citation Graph (0, 0)][DBLP]
    SRDS, 2002, pp:224-231 [Conf]
  91. Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
    Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:418-427 [Conf]
  92. Reuven Cohen, David Peleg
    Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:549-560 [Conf]
  93. Michael Elkin, David Peleg
    The Hardness of Approximating Spanner Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:370-381 [Conf]
  94. Michal Katz, Nir A. Katz, David Peleg
    Distance Labeling Schemes for Well-Separated Graph Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:516-528 [Conf]
  95. Amos Korman, David Peleg, Yoav Rodeh
    Labeling Schemes for Dynamic Tree Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:76-87 [Conf]
  96. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
    On the Complexity of Radio Communication (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:274-285 [Conf]
  97. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
    Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:479-489 [Conf]
  98. Baruch Awerbuch, Shay Kutten, David Peleg
    Competitive Distributed Job Scheduling (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:571-580 [Conf]
  99. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks
    Adapting to Asynchronous Dynamic Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:557-570 [Conf]
  100. Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg
    Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:528-537 [Conf]
  101. Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
    Fault Tolerance in Networks of Bounded Degree (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:370-379 [Conf]
  102. Michael Elkin, David Peleg
    (1+epsilon, beta)-spanner constructions for general graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:173-182 [Conf]
  103. Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
    Computing with Unreliable Information (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:128-137 [Conf]
  104. Danny Krizanc, David Peleg, Eli Upfal
    A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:93-102 [Conf]
  105. David Peleg
    Concurrent Dynamic Logic (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:232-239 [Conf]
  106. David Peleg, Eli Upfal
    Constructing Disjoint Paths on Expander Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:264-273 [Conf]
  107. David Peleg, Eli Upfal
    A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:43-52 [Conf]
  108. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
    Low-Diameter Graph Decomposition is in NC. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:83-93 [Conf]
  109. Guy Kortsarz, David Peleg
    Generating Sparse 2-spanners. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:73-82 [Conf]
  110. Nissan Lev-Tov, David Peleg
    Exact Algorithms and Approximation Schemes for Base Station Placement Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:90-99 [Conf]
  111. David Peleg
    Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:220-230 [Conf]
  112. Judit Bar-Ilan, David Peleg
    Approximation Algorithms for Selecting Network Centers (Preliminary Vesion). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:343-354 [Conf]
  113. Ron Holzman, Yosi Marcus, David Peleg
    Load Balancing in Quorum Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:38-49 [Conf]
  114. Rachel Matichin, David Peleg
    Approximation Algorithm for Hotlink Assignments in Web Directories. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:271-280 [Conf]
  115. Yedidia Atzmony, David Peleg
    Distributed Algorithms for English Auctions. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:74-88 [Conf]
  116. Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg
    Optimal Broadcast with Partial Knowledge (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1995, pp:116-130 [Conf]
  117. Judit Bar-Ilan, David Peleg
    Distributed Resource Allocation Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1992, pp:277-291 [Conf]
  118. Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg
    Fault-Tolerant Critical Section Management in Asynchronous Networks. [Citation Graph (0, 0)][DBLP]
    WDAG, 1989, pp:13-23 [Conf]
  119. Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
    Directed Virtual Path Layouts in ATM Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:75-88 [Conf]
  120. Cyril Gavoille, David Peleg
    The Compactness of Interval Routing for Almost All Graphs. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:161-174 [Conf]
  121. Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
    Greedy Packet Scheduling. [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:169-184 [Conf]
  122. Guy Kortsarz, David Peleg
    Traffic-Light Scheduling on the Grid (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1992, pp:238-252 [Conf]
  123. David Peleg
    Distributed Data Structures: A Complexity-Oriented View. [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:71-89 [Conf]
  124. David Peleg, Uri Pincas
    The Average Hop Count Measure for Virtual Path Layouts. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:255-269 [Conf]
  125. Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena
    Small k-Dominating Sets in Planar Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:201-216 [Conf]
  126. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
    Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:268-278 [Conf]
  127. David Peleg
    Proximity-Preserving Labeling Schemes and Their Applications. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:30-41 [Conf]
  128. Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita
    Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    WONS, 2005, pp:125-130 [Conf]
  129. Uriel Feige, David Peleg, Guy Kortsarz
    The Dense k-Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:3, pp:410-421 [Journal]
  130. David Peleg, Gideon Schechtman, Avishai Wool
    Randomized Approximation of Bounded Multicovering Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:44-66 [Journal]
  131. Nissan Lev-Tov, David Peleg
    Polynomial time approximation schemes for base station coverage with minimum total radii. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2005, v:47, n:4, pp:489-501 [Journal]
  132. Shay Kutten, David Peleg
    Asynchronous resource discovery in peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2007, v:51, n:1, pp:190-206 [Journal]
  133. David Peleg, Eli Upfal
    Constructng disjoint paths on expander graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:3, pp:289-313 [Journal]
  134. Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
    The Power of Small Coalitions in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:399-414 [Journal]
  135. Michal Katz, Nir A. Katz, David Peleg
    Distance labeling schemes for well-separated graph classes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:3, pp:384-402 [Journal]
  136. Guy Kortsarz, David Peleg
    Traffic-light scheduling on the grid. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:211-234 [Journal]
  137. Guy Kortsarz, David Peleg
    Approximating the Weight of Shallow Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:2-3, pp:265-285 [Journal]
  138. David Peleg
    Size Bounds for Dynamic Monopolies. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:86, n:2-3, pp:263-273 [Journal]
  139. David Peleg, Avishai Wool
    The Availability of Crumbling Wall Quorum Systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:1, pp:69-83 [Journal]
  140. Tamar Eilam, Cyril Gavoille, David Peleg
    Average stretch analysis of compact routing schemes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:5, pp:598-610 [Journal]
  141. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
    Assigning labels in an unknown anonymous network with a leader. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:3, pp:163-183 [Journal]
  142. Cyril Gavoille, David Peleg
    Compact and localized distributed data structures. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:2-3, pp:111-120 [Journal]
  143. Zvi Lotker, Boaz Patt-Shamir, David Peleg
    Distributed MST for constant diameter graphs. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:6, pp:453-460 [Journal]
  144. Yehuda Hassin, David Peleg
    Sparse communication networks and efficient routing in the plane. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:4, pp:205-215 [Journal]
  145. Yaacov Choueka, David Peleg
    A note of omega-regular languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1983, v:21, n:, pp:21-23 [Journal]
  146. Judit Bar-Ilan, David Peleg
    Scheduling Jobs Using Common Resources. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:125, n:1, pp:52-61 [Journal]
  147. Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg
    Fault-Tolerant Critical Section Management in Asynchronous Environments [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:95, n:1, pp:1-20 [Journal]
  148. Yosi Ben-Asher, Klaus-Jörn Lange, David Peleg, Assaf Schuster
    The Complexity of Reconfiguring Network Models [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:1, pp:41-58 [Journal]
  149. David Harel, David Peleg
    On Static Logics, Dynamic Logics, and Complexity Classes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:60, n:1-3, pp:86-102 [Journal]
  150. Yehuda Hassin, David Peleg
    Distributed Probabilistic Polling and Applications to Proportionate Agreement. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:171, n:2, pp:248-268 [Journal]
  151. David Peleg
    Distance-Dependent Distributed Directories [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:103, n:2, pp:270-298 [Journal]
  152. David Peleg, Barbara Simons
    On Fault Tolerant Routings in General Networks [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:74, n:1, pp:33-49 [Journal]
  153. David Peleg, Avishai Wool
    The Availability of Quorum Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:2, pp:210-223 [Journal]
  154. Riccardo Focardi, Flaminia L. Luccio, David Peleg
    Feedback vertex set in hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:1-5 [Journal]
  155. David Harel, David Peleg
    More on Looping vs. Repeating in Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:2, pp:87-90 [Journal]
  156. Andrzej Pelc, David Peleg
    Broadcasting with locally bounded Byzantine faults. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:109-115 [Journal]
  157. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk
    Renaming in an Asynchronous Environment [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:524-548 [Journal]
  158. Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish
    A Trade-Off between Information and Communication in Broadcast Protocols [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:2, pp:238-256 [Journal]
  159. Baruch Awerbuch, David Peleg
    Online Tracking of Mobile Users. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:5, pp:1021-1058 [Journal]
  160. David Peleg
    Concurrent dynamic logic. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:2, pp:450-479 [Journal]
  161. David Peleg, Eli Upfal
    A trade-off between space and efficiency for routing tables. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:510-530 [Journal]
  162. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
    Improved Routing Strategies with Succinct Tables. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:3, pp:307-341 [Journal]
  163. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
    Single Round Simulation on Radio Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:2, pp:188-210 [Journal]
  164. Judit Bar-Ilan, Guy Kortsarz, David Peleg
    How to Allocate Network Centers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:3, pp:385-415 [Journal]
  165. Tamar Eilam, Cyril Gavoille, David Peleg
    Compact routing schemes with low stretch factor. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:46, n:2, pp:97-114 [Journal]
  166. Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
    Distance labeling in graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:53, n:1, pp:85-112 [Journal]
  167. Guy Kortsarz, David Peleg
    Generating Sparse 2-Spanners. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:2, pp:222-236 [Journal]
  168. Shay Kutten, David Peleg
    Fast Distributed Construction of Small k-Dominating Sets and Applications. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:40-66 [Journal]
  169. Shay Kutten, David Peleg
    Fault-Local Distributed Mending. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:1, pp:144-165 [Journal]
  170. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
    A Lower Bound for Radio Broadcast. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:2, pp:290-298 [Journal]
  171. Yehuda Hassin, David Peleg
    Average probe complexity in quorum systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:592-616 [Journal]
  172. David Peleg
    Communication in Concurrent Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:35, n:1, pp:23-58 [Journal]
  173. David Peleg, Eilon Reshef
    Low Complexity Variants of the Arrow Distributed Directory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:3, pp:474-485 [Journal]
  174. David Peleg, Uri Pincas
    Virtual path layouts optimizing total hop count on ATM tree networks. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:101-112 [Journal]
  175. David Peleg
    Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:55-64 [Journal]
  176. Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg
    Station Layouts in the Presence of Location Constraints. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:1-2, pp:1-17 [Journal]
  177. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
    Fast Distributed Network Decompositions and Covers. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:39, n:2, pp:105-114 [Journal]
  178. Yosi Ben-Asher, David Peleg, R. Ramaswami, Assaf Schuster
    The Power of Reconfiguration. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:13, n:2, pp:139-153 [Journal]
  179. David Peleg
    Time-Optimal Leader Election in General Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:8, n:1, pp:96-99 [Journal]
  180. David Peleg
    A Note on Optimal Time Broadcast in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:1, pp:132-136 [Journal]
  181. David Peleg, Allen Van Gelder
    Packet Distribution on a Ring. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1989, v:6, n:3, pp:558-567 [Journal]
  182. Amos Korman, David Peleg, Yoav Rodeh
    Labeling Schemes for Dynamic Tree Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:49-75 [Journal]
  183. Shay Kutten, David Peleg, Uzi Vishkin
    Deterministic Resource Discovery in Distributed Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:5, pp:479-495 [Journal]
  184. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
    Low-Diameter Graph Decomposition Is in NC. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:3, pp:441-452 [Journal]
  185. Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
    Randomized Broadcast in Networks. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:4, pp:447-460 [Journal]
  186. Noga Alon, Richard M. Karp, David Peleg, Douglas B. West
    A Graph-Theoretic Game and Its Application to the k-Server Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:78-100 [Journal]
  187. Noa Agmon, David Peleg
    Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:56-82 [Journal]
  188. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
    Near-Linear Time Construction of Sparse Neighborhood Covers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:263-277 [Journal]
  189. Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
    Optimal Broadcast with Partial Knowledge. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:511-524 [Journal]
  190. Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
    Greedy Packet Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:148-157 [Journal]
  191. Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg
    Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:804-833 [Journal]
  192. Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
    Fault Tolerance in Networks of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:975-988 [Journal]
  193. Michael Elkin, David Peleg
    (1+epsilon, beta)-Spanner Constructions for General Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:608-631 [Journal]
  194. Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal
    Computing with Noisy Information. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:1001-1018 [Journal]
  195. Juan A. Garay, Shay Kutten, David Peleg
    A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:302-316 [Journal]
  196. Cyril Gavoille, David Peleg
    The Compactness of Interval Routing for Almost All Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:706-721 [Journal]
  197. Michal Katz, Nir A. Katz, Amos Korman, David Peleg
    Labeling Schemes for Flow and Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:23-40 [Journal]
  198. Shay Kutten, David Peleg
    Tight Fault Locality. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:247-268 [Journal]
  199. Guy Kortsarz, David Peleg
    Generating Low-Degree 2-Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1438-1456 [Journal]
  200. Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, David Peleg
    Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:120-131 [Journal]
  201. David Peleg, Vitaly Rubinovich
    A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1427-1442 [Journal]
  202. David Peleg, Eli Upfal
    The Token Distribution Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:229-243 [Journal]
  203. David Peleg, Jeffrey D. Ullman
    An Optimal Synchronizer for the Hypercube. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:740-747 [Journal]
  204. David Peleg, Eli Upfal
    A Time-Randomness Trade-Off for Oblivious Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:256-266 [Journal]
  205. Baruch Awerbuch, David Peleg
    Routing with Polynomial Communication-Space Trade-Off. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:151-162 [Journal]
  206. Leszek Gasieniec, Andrzej Pelc, David Peleg
    The Wakeup Problem in Synchronous Broadcast Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:207-222 [Journal]
  207. Cyril Gavoille, David Peleg
    The Compactness of Interval Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:459-473 [Journal]
  208. Michelangelo Grigni, David Peleg
    Tight Bounds on Minimum Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:207-222 [Journal]
  209. Ron Holzman, Yosi Marcus, David Peleg
    Load Balancing in Quorum Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:2, pp:223-245 [Journal]
  210. Guy Kortsarz, David Peleg
    Approximation Algorithms for Minimum-Time Broadcast. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:3, pp:401-427 [Journal]
  211. David Peleg, Avishai Wool
    How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:3, pp:416-433 [Journal]
  212. Amotz Bar-Noy, David Peleg
    Square Meshes are not always Optimal. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:2, pp:196-204 [Journal]
  213. Judit Bar-Ilan, Guy Kortsarz, David Peleg
    Generalized submodular cover problems and applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:179-200 [Journal]
  214. Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
    Directed virtual path layouts in ATM networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:291, n:1, pp:3-28 [Journal]
  215. Limor Drori, David Peleg
    Faster exact solutions for some NP-hard problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:473-499 [Journal]
  216. Michael Elkin, David Peleg
    Approximating k-spanner problems for kge2. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:249-277 [Journal]
  217. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
    Graph exploration by a finite automaton. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:331-344 [Journal]
  218. David Harel, David Peleg
    Process Logic with Regular Formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:307-322 [Journal]
  219. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
    Approximate Maxima Finding of Continuous Functions under Restricted Budget. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:151-162 [Journal]
  220. Boaz Patt-Shamir, David Peleg
    Time-Space Tradeoffs for Set Operations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:110, n:1, pp:99-129 [Journal]
  221. David Peleg
    Local majorities, coalitions and monopolies in graphs: a review. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:282, n:2, pp:231-257 [Journal]
  222. David Peleg
    Informative labeling schemes for graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:3, pp:577-593 [Journal]
  223. David Peleg
    Concurrent Program Schemes and Their Logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:55, n:1, pp:1-45 [Journal]
  224. David Peleg, Jop F. Sibeyn
    Preface: Structural Information and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:3, pp:329-330 [Journal]
  225. David Peleg, Eli Upfal
    The Generalized Packet Routing Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:281-293 [Journal]
  226. Andrzej Pelc, David Peleg
    Feasibility and complexity of broadcasting with random transmission failures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:279-292 [Journal]
  227. Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
    Broadcasting in udg radio networks with unknown topology. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:195-204 [Conf]
  228. Asaf Efrima, David Peleg
    Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:180-194 [Conf]
  229. Asaf Efrima, David Peleg
    Distributed Models and Algorithms for Mobile Robot Systems. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:70-87 [Conf]
  230. David Peleg
    Time-Efficient Broadcasting in Radio Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:3-4 [Conf]
  231. Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su
    Energy and Time Efficient Broadcasting in Known Topology Radio Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:253-267 [Conf]
  232. Bilel Derbel, Cyril Gavoille, David Peleg
    Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:179-192 [Conf]
  233. Amos Korman, David Peleg
    Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:313-327 [Conf]
  234. Leszek Gasieniec, David Peleg, Qin Xin
    Faster communication in known topology radio networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2007, v:19, n:4, pp:289-300 [Journal]
  235. David Peleg
    A generalized closure and complement phenomenon. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:285-293 [Journal]
  236. Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
    Edge-disjoint spanners of complete graphs and complete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:133-159 [Journal]
  237. David Peleg
    On the maximum density of 0-1 matrices with no forbidden rectangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:140, n:1-3, pp:269-274 [Journal]
  238. Rachel Matichin, David Peleg
    Approximation algorithm for hotlink assignment in the greedy model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:1, pp:102-110 [Journal]
  239. Andrzej Pelc, David Peleg, Michel Raynal
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:137-138 [Journal]
  240. Ornan Ori Gerstel, Shay Kutten, Eduardo Sany Laber, Rachel Matichin, David Peleg, Artur Alves Pessoa, Críston de Souza
    Reducing human interactions in Web directory searches. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Inf. Syst., 2007, v:25, n:4, pp:- [Journal]

  241. Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. [Citation Graph (, )][DBLP]


  242. f-Sensitivity Distance Oracles and Routing Schemes. [Citation Graph (, )][DBLP]


  243. Towards Networked Computers: What Can Be Learned from Distributed Computing?. [Citation Graph (, )][DBLP]


  244. Sparse Reliable Graph Backbones. [Citation Graph (, )][DBLP]


  245. Time-Efficient Broadcasting in Radio Networks: A Review. [Citation Graph (, )][DBLP]


  246. Deterministic distributed resource discovery (brief announcement). [Citation Graph (, )][DBLP]


  247. On the locality of distributed sparse spanner construction. [Citation Graph (, )][DBLP]


  248. On the effect of the deployment setting on broadcasting in Euclidean radio networks. [Citation Graph (, )][DBLP]


  249. SINR diagrams: towards algorithmically usable SINR models of wireless networks. [Citation Graph (, )][DBLP]


  250. Forbidden-set distance labels for graphs of bounded doubling dimension. [Citation Graph (, )][DBLP]


  251. Equal-Area Locus-Based Convex Polygon Decomposition. [Citation Graph (, )][DBLP]


  252. A near-linear time algorithm for computing replacement paths in planar directed graphs. [Citation Graph (, )][DBLP]


  253. As Good as It Gets: Competitive Fault Tolerance in Network Structures. [Citation Graph (, )][DBLP]


  254. Robust Fault Tolerant Uncapacitated Facility Location. [Citation Graph (, )][DBLP]


  255. Relaxed Spanners for Directed Disk Graphs. [Citation Graph (, )][DBLP]


  256. Fault-tolerant spanners for general graphs. [Citation Graph (, )][DBLP]


  257. Degree-Constrained Subgraph Problems: Hardness and Approximation Results. [Citation Graph (, )][DBLP]


  258. Local Computation of Nearly Additive Spanners. [Citation Graph (, )][DBLP]


  259. Efficient k-Shot Broadcasting in Radio Networks. [Citation Graph (, )][DBLP]


  260. Realtime Classification for Encrypted Traffic. [Citation Graph (, )][DBLP]


  261. Low-Port Tree Representations. [Citation Graph (, )][DBLP]


  262. Computing the fault tolerance of multi-agent deployment. [Citation Graph (, )][DBLP]


  263. Labeling Schemes for Tree Representation. [Citation Graph (, )][DBLP]


  264. SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks [Citation Graph (, )][DBLP]


  265. Relaxed spanners for directed disk graphs [Citation Graph (, )][DBLP]


  266. Robust Fault Tolerant uncapacitated facility location [Citation Graph (, )][DBLP]


  267. Conflict-free coloring of unit disks. [Citation Graph (, )][DBLP]


  268. Time efficient k-shot broadcasting in known topology radio networks. [Citation Graph (, )][DBLP]


  269. Compact separator decompositions in dynamic trees and applications to labeling schemes. [Citation Graph (, )][DBLP]


  270. Broadcasting in UDG radio networks with unknown topology. [Citation Graph (, )][DBLP]


Search in 0.077secs, Finished in 0.091secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002