Publications

Book

  • D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, Philadelphia, PA, 2000.

Refereed Journals

  1. D. Peleg, A Generalized Closure and Complement Phenomenon, DM  50, (1984), 285-293.

  2. D. Harel and D. Peleg, On Static Logics, Dynamic Logics and Complexity Classes, Info. & Contr. 60, (1984), 86-102.
  3. D. Harel and D. Peleg, Process Logic with Regular Formulas, TCS 38, (1985), 307-322.
  4. D. Harel and D. Peleg, More on Looping vs. Repeating in Dynamic Logic, IPL 20, (1985), 87-90.
  5. D. Peleg, Concurrent Dynamic Logic, J. ACM 34, (1987), 450-479.
  6. D. Peleg, Communication in Concurrent Dynamic Logic, JCSS 35, (1987), 23-58.
  7.  D. Peleg and B. Simons, On Fault Tolerant Routings in General Networks, I&C 74, (1987), 33-49.
  8. J. Intrator and D. Peleg, An Ecient Algorithm for the Long Transportation Problem, Asia-Pacific J. of Operational Research 4, (1987), 57-68.
  9. D. Peleg and E. Upfal, The Generalized Packet Routing Problem, TCS 53, (1987), 281-293.
  10.  D. Peleg, Concurrent Program Schemes and Their Logics, TCS 55, (1987), 1-45.
  11. C. Dwork, D. Peleg, N. Pippenger and E. Upfal, Fault Tolerance in Networks of Bounded Degree, SICOMP 17, (1988), 975-988.
  12. D. Peleg and A. Van Gelder, Packet Distribution on a Ring, JPDC  6, (1989), 558-567.
  13. D. Peleg and E. Upfal, The Token Distribution Problem, SICOMP  18, (1989), 229-243.
  14. D. Peleg and A.A. Schaffer, Graph Spanners, JGT  13, (1989), 99-116.
  15. D. Peleg and J.D. Ullman, An Optimal Synchronizer for the Hypercube, SICOMP 18, (1989), 740-747.
  16. D. Peleg and E. Upfal, A Tradeoff Between Space and Efficiency for Routing Tables, J. ACM 36, (1989), 510-530.
  17. D. Peleg and A.A. Schaffer, Time Bounds on Fault Tolerant Broadcasting, Networks 19, (1989), 803-822.
  18. D. Peleg and E. Upfal, Constructing Disjoint Paths on Expander Graphs, Combinatorica 9, (1989), 289-313.
  19. B. Awerbuch, A. Bar-Noy, N. Linial and D. Peleg, Compact Distributed Data Structures for Adaptive Routing, CWI Quarterly  2, (1989), 277-305.
  20. D. Peleg, Time-Optimal Leader Election in General Networks (Research Note), JPDC 8, (1990), 96-99.
  21. D. Peleg and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, SICOMP 19, (1990), 256-266.
  22. B. Awerbuch, O. Goldreich, D. Peleg and R. Vainish, A Tradeoff Between Information and Communication in Broadcast Protocols, J. ACM 37, (1990), 238-256.
  23.  H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg and R. Reischuk, Renaming in an Asynchronous Environment, J. ACM 37, (1990), 524-548.
  24. B. Awerbuch, A. Bar-Noy, N. Linial and D. Peleg, Improved Routing Strategies with Succinct Tables, JALG 11, (1990), 307-341.
  25. U. Feige, D. Peleg, P. Raghavan and E. Upfal, Randomized Broadcast in Networks, J. RSA 1, (1990), 447-460.
  26. A. Bar-Noy and D. Peleg, Square Meshes are Not Always Optimal, IEEE Trans. Computers 40, (1991), 196-204.
  27. M. Grigni and D. Peleg, Tight Bounds on Minimum Broadcast Networks, SIDMA 4, (1991), 207-222.
  28. Y. Ben-Asher, D. Peleg, R. Ramaswami and A. Schuster, The Power of Reconguration, JPDC 13, (1991), 139-153.
  29. N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A Lower Bound for Radio Broadcast, JCSS 43, (1991), 290-298.
  30.  A. Bar-Noy, D. Dolev, D. Koller and D. Peleg, Fault-Tolerant Critical Section Management in Asynchronous Environments, I&C 95, (1991), 1-20.
  31. B. Awerbuch and D. Peleg, Routing with Polynomial Communication-Space Trade-off, SIDMA 5, (1992), 151-162.
  32. N. Alon, A. Bar-Noy, N. Linial and D. Peleg, Single Round Simulation on Radio Networks, JALG 13, (1992), 188-210.
  33.  D. Peleg, Distance-Dependent Distributed Directories, I&C 103 (1993), 270-298.
  34.  J. Bar-Ilan, G. Kortsarz and D. Peleg, How to Allocate Network Centers, JALG 15, (1993), 385-415.
  35.  B. Patt and D. Peleg, Time-Space Tradeoffs for Set Operations, TCS 110, (1993), 99-129.
  36. B. Awerbuch, S. Kutten and D. Peleg, On Buffer-Economical Store-and-Forward Deadlock Prevention, IEEE Trans. Commun., 42, (1994), 2934-2937. 
  37. G. Kortsarz and D. Peleg, Traffic-Light Scheduling on the Grid, DAM 53, (1994), 211-234.
  38. G. Kortsarz and D. Peleg, Generating Sparse 2-Spanners, JALG 17, (1994), 222-236.
  39. U. Feige, D. Peleg, P. Raghavan and E. Upfal, Computing with Noisy Information, SICOMP 23, (1994), 1001-1018.
  40. B. Awerbuch, B. Berger, L. Cowen and D. Peleg, Low Diameter Graph Decomposition is in NC, J. RSA 5, (1994), 442-452.
  41. J. Bar-Ilan, G. Kortsarz and D. Peleg, Information Centre Allocation, The Electronic Library, 12, (1994), 361-365.
  42.  I. Cidon, S. Kutten, Y. Mansour and D. Peleg, Greedy Packet Scheduling, SICOMP 24, (1995), 148-57.
  43. D. Peleg, A Note on Optimal Time Broadcast in Faulty Hypercubes, JPDC 26, (1995), 132-135.
  44. D. Peleg, On the Maximum Density of 0-1 Matrices with No Forbidden Rectangles, DM  140, (1995), 269-274.
  45.  N. Alon, R.M. Karp, D. Peleg and D. West, A Graph-Theoretic Game and its Application to the k-Server Problem, SICOMP 24, (1995), 78-100.
  46. Y. Ben-Asher, K.-J. Lange, D. Peleg and A. Schuster, The Complexity of Reconguring Network Models, I&C 121, (1995), 41-58.
  47. B. Awerbuch and D. Peleg, Online Tracking of Mobile Users, J. ACM, 42, (1995), 1021-1058
  48.  G. Kortsarz and D. Peleg, Approximation Algorithms for Minimum Time Broadcast, SIDMA 8, (1995), 401-427.
  49. D. Peleg and A. Wool, The Availability of Quorum Systems, I&C 123, (1995), 210-223.
  50. J. Bar-Ilan and D. Peleg, Scheduling Jobs Using Common Resources, I&C 125, (1996), 52-61.
  51.  B. Awerbuch, B. Berger, L. Cowen and D. Peleg, Fast Distributed Network Decompositions and Covers, JPDC 39, (1996), 105-114.
  52. D. Peleg and A. Wool, Crumbling walls: a class of practical and efficient quorum systems, DC 10, (1997), 87-97.
  53.  D. Peleg and A. Wool, The Availability of Crumbling Wall Quorum Systems, DAM 74, (1997), 69-83.
  54. D. Peleg, G. Schechtman and A. Wool, Randomized Approximation of Bounded Multicovering Problems, Algorithmica 18, (1997), 44-66.
  55. R. Holzman, Y. Marcus and D. Peleg, Load Balancing in Quorum Systems, SIDMA 10, (1997), 223-245.
  56. J. Garay, S. Kutten and D. Peleg, A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees, SICOMP 27, (1998), 302-316.
  57. G. Kortsarz and D. Peleg, Generating Low-Degree 2-Spanners, SICOMP 27, (1998), 1438-1456.
  58. S. Kutten and D. Peleg, Fast distributed construction of k-dominating sets and applications, JALG 28, (1998), 40-66.
  59. E. Kranakis, D. Krizanc, A. Pelc and D. Peleg, Approximate Maxima Finding of Continuous Functions under Restricted Budget, TCS 203, (1998), 151-162.
  60. D. Peleg, Size Bounds for Dynamic Monopolies, DAM 86, (1998), 263-273.
  61. B. Awerbuch, B. Berger, L. Cowen and D. Peleg, Near-Linear Time Construction of Sparse Neighborhood Covers, SICOMP 28, (1998), 263-277.
  62. B. Awerbuch, I. Cidon, S. Kutten, Y. Mansour and D. Peleg, Optimal Broadcast with Partial Knowledge, SICOMP , (1998), 511-524.
  63. C. Laforest, A.L. Liestman, D. Peleg, T.C. Shermer and D. Sotteau, Edge Disjoint Spanners of Complete Graphs and Complete Digraphs, DM 203, (1999), 133-159.
  64. C. Gavoille and D. Peleg, The Compactness of Interval Routing, SIDMA 12, (1999), 459-473.
  65. S. Dolev, E. Kranakis, D. Krizanc and D. Peleg, Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks, SICOMP 29, (1999), 804-833.
  66. G. Kortsarz and D. Peleg, Approximating the Weight of Shallow Steiner Trees, DAM 93, (1999), 265-285.
  67. S. Kutten and D. Peleg, Fault-Local Distributed Mending, JALG 30, (1999), 144-165.
  68. D. Peleg, Proximity-Preserving Labeling Schemes, JGT 33, (2000), 167-176.
  69. R. Focardi, F.L. Luccio and D. Peleg, Feedback vertex set in hypercbes, IPL 76, (2000), 1-5.
  70. S. Kutten and D. Peleg, Tight fault locality, SICOMP 30, (2000), 247-268.
  71. D. Peleg and V. Rubinovich, A near-tight lower bound on the time complexity of distributed MST construction, SICOMP 30, (2000), 1427-1442.
  72. J. Bar-Ilan, G. Kortsarz and D. Peleg, Generalized Submodular Cover Problems and Applications, TCS 250, (2001), 179-200.
  73. U. Feige, G. Kortsarz and D. Peleg, The Dense k-Subgraph Problem, Algorithmica 29, (2001), 410-421.
  74. L. Gasieniec, A. Pelc and D. Peleg, The wakeup problem in synchronous broadcast systems, SIDMA 14, (2001), 207-222.
  75. C. Gavoille and D. Peleg, The Compactness of Interval Routing for Almost All Graphs, SICOMP 31, (2001), 706-721.
  76. Y. Hassin and D. Peleg, Distributed Probabilistic Polling and Applications to Proportionate Agreement, I&C 171, (2001), 248-268.
  77. Y. Hassin and D. Peleg, Sparse Communication Networks and Efficient Routing in the Plane, DC 14, (2001), 205-215.
  78. P. Fraigniaud, A. Pelc, D. Peleg and S. Perennes, Assigning Labels in Unknown Anonymous Networks, DC 14, (2001), 163-183.
  79. D. Peleg and E. Reshef, Low complexity variants of the Arrow Distributed Directory, JCSS 63, (2001), 474-485.
  80. D. Peleg, Local Majorities, Coalitions and Monopolies in Graphs: A Review, TCS 282, (2002), 231-257. 
  81. P. Bose, C. Kaklamanis, L.M. Kirousis, E. Kranakis, D. Krizanc and D. Peleg, Station Layouts in the Presence of Location Constraints, J. of Interconnection Networks 3, (2002), 1-19.
  82. L. Drori and D. Peleg, Faster Exact Solutions for Some NP-Hard Problems, TCS 287, (2002), 473-499.
  83. D. Peleg and A. Wool, How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems, SIDMA 15, (2002), 416-433.
  84. J.-C. Bermond, J. Bond, D. Peleg and S. Perennes, The Power of Small Coalitions in Graphs, DAM 127, (2003), 399-414.
  85. J.-C. Bermond, N. Marlin, D. Peleg and S. Perennes, Directed Virtual Path Layouts in ATM networks, TCS 291, (2003), 3-28.
  86. T. Eilam, C. Gavoille and D. Peleg, Compact Routing Schemes with Low Stretch Factor, JALG 46, (2003), 97-114.
  87. C. Gavoille and D. Peleg, Compact and Localized Distributed Data Structures, DC 16, (2003), 111-120.
  88. S. Kutten, D. Peleg and U. Vishkin, Deterministic Resource Discovery in Distributed Networks, TOCS 36, (2003), 479-495.
  89. A. Korman, D. Peleg and Y. Rodeh, Labeling Schemes for Dynamic Tree Networks, TOCS 37, (2004), 49-75.
  90.  C. Gavoille, D. Peleg, S. Perennes and R. Raz, Distance Labeling in Graphs, JALG 53, (2004), 85-112.
  91. M. Elkin and D. Peleg, (1+PG1hdGg+CiAgICA8bXRleHQ+JiN4M0I1OzwvbXRleHQ+CjwvbWF0aD4=,ß)-Spanner Constructions for General Graphs, SICOMP 33, (2004), 608-631.
  92. M. Katz, N.A. Katz, A. Korman and D. Peleg, Labeling Schemes for Flow and Connectivity, SICOMP 34, (2004), 23-40.
  93. A. Pelc and D. Peleg, Broadcasting with locally bounded Byzantine faults, IPL 93, (2005), 109-115.
  94. D. Peleg and U. Pincas, Virtual path layouts optimizing total hop count on ATM tree networks, JDA 3, (2005), 101-112.
  95. N. Lev-Tov and D. Peleg, Polynomial Time Approximation Schemes for Base Station Coverage with Minimum Total Radii, Computer Networks 47, (2005), 489-501.
  96. R. Cohen and D. Peleg, Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems, SICOMP 34, (2005), 1516-1528.
  97. D. Peleg, Informative Labeling Schemes for Graphs, TCS 340, (2005), 577-593.
  98. M. Katz, N. Katz and D. Peleg, Distance Labeling Schemes for Well-Separated Graph Classes, DAM 145, (2005), 384-402.
  99. M. Elkin and D. Peleg, Approximating k-Spanner Problems for k > 2, TCS 337, (2005), 249-277.
  100. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc and D. Peleg, Graph Exploration by a Finite Automaton, TCS 345, (2005), 331-344.
  101. Z. Lotker, B. Patt-Shamir, E. Pavlov and D. Peleg, MST Construction in O(loglog n) Communication Rounds, SICOMP 35, (2005), 120-131.
  102. N. Agmon and D. Peleg, Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, SICOMP 36, (2006), 56-82.
  103. Y. Hassin and D. Peleg, Average Probe Complexity in Quorum Systems, JCSS 72, (2006), 592-616.
  104. Z. Lotker, B. Patt-Shamir and D. Peleg, Distributed MST for Constant Diameter Graphs, DC 18, (2006), 453-460.
  105. S. Kutten and D. Peleg, Asynchronous Resource Discovery in Peer to Peer Networks Computer Networks 51, (2007), 190-206.
  106. T. Eilam, C. Gavoille and D. Peleg, Average Stretch Analysis of Compact Routing Schemes, DAM 155, (2007), 598-610.
  107. D. Peleg, Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems, JDA 5, (2007), 55-64.
  108. R. Matichin and D. Peleg, Approximation Algorithm for Hotlink Assignment in the Greedy Model, TCS 383, (2007), 102-110.
  109. L. Gasieniec, D. Peleg and Q. Xin, Faster Communication in Known Topology Radio Networks, DC 19, (2007), 289-300.
  110. A. Pelc and D. Peleg, Feasibility and Complexity of Broadcasting with Random Transmission Failures, TCS 370, (2007), 279-292.
  111. M. Elkin and D. Peleg, The Hardness of Approximating Spanner Problems, TOCS 41, (2007), 691-729.
  112. O. Gerstel, S. Kutten, E.S. Laber, R. Matichin, D. Peleg, A.A. Pessoa and C. Souza, Reducing Human Interactions in Web Directory Searches, ACM Trans. Information Systems 25, (2007).
  113. A. Korman and D. Peleg, Labeling Schemes for Weighted Dynamic Trees, I&C 205, (2007), 1721-1740.
  114. R. Cohen and D. Peleg, Convergence of Autonomous Mobile Robots With Inaccurate Sensors and Movements, SICOMP 38, (2008), 276-302.
  115. R. Cohen and D. Peleg, Local Spreading Algorithms for Autonomous Robot Systems, TCS 399, (2008), 71-82.
  116. A. Korman and D. Peleg, Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes, DC 21, (2008), 141-161.
  117. Y. Emek and D. Peleg, Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs, SICOMP 38, (2008), 176-1781.
  118. L. Gasieniec, E. Kantor, D.R. Kowalski, D. Peleg and C. Su, Time efficient k-shot broadcasting in known topology radio networks, DC 21, (2008), 117-127.
  119. A. Korman and D. Peleg, Dynamic Routing Schemes for Graphs with Low Local Density, ACM TALG 4, (2008), 41:1-41:18.
  120. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg, Label-Guided Graph Exploration by a Finite Automaton, ACM TALG 4, (2008), 42:1-42:18.
  121. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg, Labeling Schemes for Tree Representation, Algorithmica 53, (2009), 1-15.
  122. Y. Zhang, E. Manisterski, S. Kraus, V.S. Subrahmanian and D. Peleg, Computing the Fault Tolerant Capability of Multiagent Deployment, Articial Intelligence 173, (2009), 437-465.
  123. N. Lev-Tov and D. Peleg, Conflict Free Coloring of Unit Disks, DAM 157, (2009), 1521-1532.
  124. E. Kantor and D. Peleg, Approximate Hierarchical Facility Location and Applications to the Bounded Depth Steiner Tree and Range Assignment Problems, JDA 7, (2009), 341-362.
  125. A. Efrima and D. Peleg, Distributed Algorithms for Partitioning A Swarm of Autonomous Mobile Robots, TCS 14, (2009), 1355-1368.
  126. Y. Emek, L. Gasieniec, E. Kantor, A. Pelc, D. Peleg and C. Su, Broadcasting in UDG Radio Networks with Unknown Topology, DC 21, (2009), 331-351.
  127. Y. Emek and D. Peleg, A tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs, SIDMA 23, (2009), 1827-1841.
  128. A. Korman, D. Peleg and Y. Rodeh, Constructing Labeling Schemes Through Universal Matrices, Algorithmica 57, (2010), 641-652.
  129. A. Korman, S. Kutten and D. Peleg, Proof Labeling Schemes, DC 22, (2010), 215-233.
  130. D. Adjiashvili and D. Peleg, Equal-Area Locus-Based Convex Polygon Decomposition, TCS 411, (2010), 1648-1667.
  131. S. Chechik, M. Langberg, D. Peleg and L. Roditty, Fault-Tolerant Spanners for General Graphs, SICOMP 39, (2010), 3403-3423.
  132. D. Peleg and L. Roditty, Localized spanner construction for Ad Hoc Networks with Variable Transmission Range, ACM Trans. on Sensor Networks 7, (2010).
  133. Y. Emek, D. Peleg and L. Roditty, A Near-Linear Time Algorithm for Computing Replacement Paths in Planar Directed Graphs, ACM TALG 6, (2010).
  134. O. Weimann and D. Peleg, A note on exact distance labeling, IPL 111, (2011), 671-673.
  135. S. Chechik, M. Langberg, D. Peleg and L. Roditty, f-Sensitivity Distance Oracles and Routing Schemes, Algorithmica 63, (2012), 861-882.
  136. S. Chechik, Y. Emek, B. Patt-Shamir and D. Peleg, Sparse Reliable Graph Backbones, I&C 210, (2012), 31-39.
  137. O. Amini, D. Peleg, S. Perennes, I. Sau and S. Saurabh, On the approximability of some degree-constrained subgraph problems DAM 160, (2012), 1661-1679.
  138. C. Avin, Y. Emek, E. Kantor, Z. Lotker, D. Peleg and L. Roditty, SINR Diagrams: Convexity and Its Applications in Wireless Networks. J. ACM 59, (2012).
  139. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg and R. Wattenhofer, Distributed Verication and Hardness of Distributed Approximation, SICOMP 41, (2012), 1235-1265.
  140. D. Peleg, I. Sau and M. Shalom, On Approximating the d-Girth of a Graph, DAM 161, (2013), 2587-2596.
  141. D. Peleg and L. Roditty, Relaxed spanners for directed disk graphs, Algorithmica 65, (2013), 146-158.
  142. L. Kor, A. Korman and D. Peleg, Tight Bounds For Distributed MST Verication, TOCS 53, (2013), 318-340.
  143. P. Fraigniaud, A. Korman and D. Peleg, Towards a Complexity Theory for Local Distributed Computing, J. ACM 60(5), (2013), 35.
  144. Y. Dieudonne, A. Pelc and D. Peleg, Gathering despite mischief, ACM TALG 11, (2014), 28pp.
  145. S. Chechik and D. Peleg, Robust Fault Tolerant Uncapacitated Facility Location, TCS 543, (2014), 9-23.
  146. P. Fraigniaud, M. Goos, A. Korman, M. Parter and D. Peleg, Randomized Distributed Decision, DC 27, (2014), 419-434.
  147. C. Avin, M. Borokhovich, Y. Haddad, E. Kantor, Z. Lotker, M. Parter and D. Peleg, Testing the Irreducibility of Nonsquare Perron-Frobenius Systems, IPL 114, (2014), 728-733.
  148. S. Chechik and D. Peleg, The Fault Tolerant Capacitated k-Center Problem, TCS 566, (2015), 12-25.
  149. S. Kutten, G. Pandurangan, D. Peleg, P. Robinson and A. Trehan, Sublinear Bounds for Randomized Leader Election, TCS 561, (2015).
  150. G. Braunschvig, A. Brutzkus, D. Peleg and A. Sealfon, Truth Tellers and Liars With Fewer Questions, DM 338,(2015), 1310-1316.
  151. S. Kutten, G. Pandurangan, D. Peleg, P. Robinson and A. Trehan, On the Complexity of Universal Leader Election, J. ACM 62(1), (2015), 7:1-7:27.
  152. E. Kantor, Z. Lotker, M. Parter and D. Peleg, The Topology of Wireless Communication, J. ACM 62(5), (2015), 37:1-7:32.
  153. G. Braunschvig, S. Chechik, D. Peleg and A. Sealfon, Fault Tolerant Additive and (µ,PG1hdGg+CiAgICA8bXRleHQ+JiN4M0IxOzwvbXRleHQ+CjwvbWF0aD4=)-Spanners, TCS 580, (2015), 94-100.
  154. I. Abraham, S. Chechik, C. Gavoille and D. Peleg, Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension, ACM TALG 12, (2016), 22:1-17.
  155. B. Haeupler, G. Pandurangan, D. Peleg, R. Rajaraman and Z. Sun, Discovery through Gossip, J. RSA 48, (2016), 565-587.
  156. E. Kantor and D. Peleg, Ecient k-shot Broadcasting in Radio Networks, DAM 202, (2016), 79-94.
  157. M. Parter and D. Peleg, Sparse Fault-Tolerant BFS Trees, ACM TALG 13, (2016), 24:1-24.
  158. C. Avin, Z. Lotker, D. Peleg and I. Turkel, On Social Networks of Program Committees, Social Network Analysis and Mining 6 (1), (2016), 1-20.
  159. Y. Emek, E. Kantor and D. Peleg, On the Effect of the Deployment Setting on Broadcasting in Euclidean Radio Networks, DC 29, (2016), 409-434.
  160. C. Avin, M. Borokhovich, Z. Lotker and D. Peleg, Distributed Computing on Core-Periphery Networks: Axiom-based Design, JPDC 99, (2017), 51-67.
  161. C. Avin, A. Cohen, Y. Haddad, E. Kantor, Z. Lotker, M. Parter and D. Peleg, SINR Diagram with Interference Cancellation, AHNJ 54, (2017), 1-16.
  162. S. Chechik, M. Johnson, M. Parter and D. Peleg, Secluded Connectivity Problems, Algorithmica 79, (2017), 708-741.
  163. M. Parter and D. Peleg, Fault-Tolerant Approximate BFS Structures, ACM TALG 14, (2018), 10:1-15.
  164. A. Bar-Noy, D. Peleg, G. Rabanca and I. Vigan, Improved Approximation Algorithms forWeighted 2-path Partitions, DAM 239, (2018), 15-37.
  165. E. Kantor, Z. Lotker, M. Parter and D. Peleg, The topology of wireless communication on a line, TCS 711, (2018), 105-108.

Conference Proceedings and Collections

  1. Y. Choueka and D. Peleg, A Note on PG1hdGg+CiAgICA8bXRleHQ+JiN4M0M5OzwvbXRleHQ+CjwvbWF0aD4=-regular Languages, Bulletin of the EATCS 21, (1983), 21-23.

  2. D. Peleg, Concurrent Dynamic Logic, STOC 232-239, 1985.

  3. C. Dwork, D. Peleg, N. Pippenger and E. Upfal, Fault Tolerance in Networks of Bounded Degree, STOC 370-379, 1986.

  4. D. Peleg and B. Simons, On Fault Tolerant Routings in General Networks, PODC 98-107, 1986.

  5. D. Peleg and E. Upfal, The Token Distribution Problem, FOCS 418-427, 1986.

  6. D. Peleg and E. Upfal, Constructing Disjoint Paths on Expander Graphs, STOC 264-273, 1987.

  7. D. Peleg and J.D. Ullman, An Optimal Synchronizer for the Hypercube, PODC 77-85, 1987.

  8. H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg and R. Reischuk, Achievable Cases in an Asynchronous Environment, FOCS 337-346, 1987.

  9. D. Peleg and E. Upfal, A Tradeoff Between Space and Efficiency for Routing Tables, STOC 43-52, 1988.

  10.  D. Krizanc, D. Peleg and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, STOC 93-102, 1988.

  11. B. Awerbuch, O. Goldreich, D. Peleg and R. Vainish, A Tradeoff Between Information and Communication in Broadcast Protocols, AWOC 1988, 369-379.

  12. B. Awerbuch, A. Bar-Noy, N. Linial and D. Peleg, Compact Distributed Data Structures for Adaptive Routing, STOC 1989, 479-489.

  13. N. Alon, A. Bar-Noy, N. Linial and D. Peleg, On the Complexity of Radio Communication, STOC 1989, 274-285.

  14. A. Bar-Noy and D. Peleg, Square Meshes are Not Always Optimal, SPAA 1989, 138-147.

  15. A. Bar-Noy, D. Dolev, D. Koller and D. Peleg, Fault-Tolerant Critical Section Management in Asynchronous Environments, WDAG 1989.

  16. U. Feige, D. Peleg, P. Raghavan and E. Upfal, Computing with Unreliable Information, STOC 1990, 128-137.

  17. U. Feige, D. Peleg, P. Raghavan and E. Upfal, The Complexity of Randomized Broadcast, SIGAL 1990, 128-137.

  18. B. Awerbuch, A. Baratz and D. Peleg, Cost-sensitive analysis of communication protocols, PODC 1990, 177-187.

  19. D. Peleg, Distributed Data Structures: A Complexity Oriented View, WDAG 1990, 71-89.

  20. I. Cidon, S. Kutten, Y. Mansour and D. Peleg, Greedy Packet Scheduling, WDAG 1990, 169-184.

  21. B. Awerbuch and D. Peleg, Sparse Partitions, FOCS 1990, 503-513.

  22. B. Awerbuch and D. Peleg, Network Synchronization with Polylogarithmic Overhead, FOCS 1990, 514-522.

  23. B. Awerbuch, S. Kutten and D. Peleg, On Buffer-Economical Store-and-Forward Deadlock Prevention, INFOCOM 1991, 410-414.

  24. Y. Ben-Asher, D. Peleg, R. Ramaswami and A. Schuster, The Power of Reconfiguration, ICALP 1991.

  25. B. Awerbuch, S. Kutten and D. Peleg, Efficient Deadlock-Free Routing, PODC 1991, 177-188.

  26. B. Awerbuch, I. Cidon, S. Kutten, Y. Mansour and D. Peleg, Broadcast with Partial Knowledge, PODC 1991, 153-163.

  27. K. Gilon and D. Peleg, Compact Deterministic Distributed Dictionaries, PODC 1991, 81-94.

  28. J. Bar-Ilan and D. Peleg, Approximation Algorithms for Selecting Network Centers, WADS 1991, 343-354.

  29. B. Awerbuch and D. Peleg, Concurrent Online Tracking of Mobile Users, SIGCOMM 1991, 221-233.

  30. N. Alon, R.M. Karp, D. Peleg and D. West, A Graph-Theoretic Game and its Application to the k-Server Problem, DIMACS Workshop on Online Algo. 1991, 1-9.

  31. B. Awerbuch, B. Patt-Shamir, D. Peleg and M. Saks, Adapting to Asynchronous Dynamic Networks, STOC 1992, 557-570.

  32. B. Awerbuch, S. Kutten and D. Peleg, Competitive Distributed Job Load Balancing, STOC 1992, 571-580.

  33. G. Kortsarz and D. Peleg, Approximation Algorithms for Minimum Time Broadcast, ISTCS 1992, 67-78.

  34. Y. Ben-Asher, D. Peleg and A. Schuster, The Complexity of Reconfiguring Network Models, ISTCS 1992, 79-90.

  35. G. Kortsarz and D. Peleg, Generating Sparse 2-Spanners, SWAT 1992, 73-82.

  36. B. Awerbuch, B. Berger, L. Cowen and D. Peleg, Low Diameter Graph Decomposition is in NC, SWAT 1992, 83-93.

  37. B. Awerbuch, B. Berger, L. Cowen and D. Peleg, Fast Network Decomposition, PODC 1992, 169-177.

  38. G. Kortsarz and D. Peleg, Trac-Light Scheduling on the Grid, WDAG 1992, 238-252.

  39. J. Bar-Ilan and D. Peleg, Distributed Resource Allocation Algorithms, WDAG 1992, 277-291.

  40. D. Peleg, G. Schechtman and A. Wool, Approximating Bounded 0-1 Integer Linear Programs, ISTCS 1993, 69-77.

  41. N. Linial, D. Peleg, Y. Rabinovich and M. Saks, Sphere Packing and Local Majorities in Graphs, ISTCS 1993, 141-149.

  42. B. Awerbuch, B. Berger, L. Cowen and D. Peleg, Near-Linear Cost Sequential and Distributed Constructions of Sparse Neighborhood Covers, FOCS 1993, 638-647.

  43. G. Kortsarz and D. Peleg, On Choosing a Dense Subgraph, FOCS 1993, 692-701.

  44. J. Garay, S. Kutten and D. Peleg, A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees, FOCS 1993, 659-668.

  45. G. Kortsarz and D. Peleg, Generating Low-Degree 2-Spanners, SODA 1994, 556-563.

  46. S. Dolev, E. Kranakis, D. Krizanc and D. Peleg, Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks, STOC 1995.

  47. J.-C. Bermond and D. Peleg, The Power of Small Coalitions in Graphs, SIROCCO 1995, 173-184.

  48. D. Peleg and A. Wool, Crumbling walls: a class of practical and ecient quorum systems, PODC 1995, 120-129.

  49. S. Kutten and D. Peleg, Fast distributed construction of k-dominating sets and applications, PODC 1995, 238-249.

  50. S. Kutten and D. Peleg, Fault-Local Distributed Mending, PODC 1995, 20-27.

  51. R. Holzman, Y. Marcus and D. Peleg, Load Balancing in Quorum Systems, WADS 1995, 38-49.

  52. B. Awerbuch, S. Kutten, Y. Mansour and D. Peleg, Optimal Broadcast with Partial Knowledge, WDAG 1995.

  53. S. Kutten and D. Peleg, Tight fault locality, FOCS 1995.

  54. D. Peleg and A. Wool, How to be an Ecient Snoop, or the Probe Complexity of Quorum Systems, PODC 1996, 290-299.

  55. J. Bar-Ilan, G. Kortsarz and D. Peleg, Generalized Submodular Cover Problems and Applications, ISTCS 1996.

  56. J.-C. Bermond, J. Bond, D. Peleg and S. Perennes, Tight Bounds on the Size of 2-Monopolies, SIROCCO 1996, 152-169.

  57. D. Peleg, Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review, SIROCCO 1996, 170-179.

  58. E. Kranakis, D. Krizanc, A. Pelc and D. Peleg, Approximate Maxima Finding of Continuous Functions under Restricted Budget, WG 1996.

  59. G. Kortsarz and D. Peleg, Approximating Shallow-Light Trees, SODA 1997, 103-110.

  60. D. Peleg, Size Bounds for Dynamic Monopolies, SIROCCO 1997, 151-161.

  61. D. Peleg, Approximating Minimum Communication Spanning Trees, SIROCCO 1997.

  62. T. Eilam, C. Gavoille and D. Peleg, Compact Routing Schemes with Low Average Stretch Factor, PODC 1998, 11-20.

  63. D. Peleg, Algorithmic aspects of dynamic coalitions and monopolies in graphs, Fun with Algorithms, 1998.

  64. D. Peleg, Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees, ICALP 1998, 164-175.

  65. D. Peleg and E. Reshef, Deterministic Polylog Approximation for Minimum Communication Spanning Trees, ICALP 1998, 670-681.

  66. P. de la Torre, L. Narayanan and D. Peleg, Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper), SIROCCO 1998.

  67. C. Gavoille and D. Peleg, The Compactness of Interval Routing for Almost All Graphs, DISC 1998, 161-174.

  68. J.-C. Bermond, N. Marlin, D. Peleg and S. Perennes, Directed Virtual Path Layouts in ATM networks, DISC 1998, 75-88.

  69. J.-C. Bermond, N. Marlin, D. Peleg and S. Perennes, Virtual Path Layouts in Simple ATM networks, IFIP Workshop on Perform. Model. & Evaluat. ATM Networks 1998.

  70. Y. Mansour and D. Peleg, An Approximation Algorithm for Minimum-Cost Network Design, DIMACS Workshop on Robust Commun. Networks: Interconn. & Surviv. 1998, 97-106.

  71. D. Peleg, Proximity-Preserving Labeling Schemes and Their Applications, WG 1999, 30-41.

  72. Y. Hassin and D. Peleg, Distributed Probabilistic Polling and Applications to Proportionate Agreement, ICALP 1999, 402-411.

  73. D. Peleg and E. Reshef, A Variant of the Arrow Distributed Directory with Low Average Complexity, ICALP 1999, 615-624.

  74. L. Drori and D. Peleg, Faster Exact Solutions for Some NP-Hard Problems, ESA 1999.

  75. D. Peleg and V. Rubinovich, A near-tight lower bound on the time complexity of distributed MST construction, FOCS 1999, 253-261.

  76. P. Bose, C. Kaklamanis, L.M. Kirousis, E. Kranakis, D. Krizanc and D. Peleg, Station Layouts in the Presence of Location Constraints, ISAAC 1999.

  77. M. Elkin and D. Peleg, The Hardness of Approximating Spanner Problems, STACS 2000, 370-381.

  78. M. Katz, N. Katz and D. Peleg, Distance Labeling Schemes for Well-Separated Graph Classes, STACS 2000, 516-528.

  79. Y. Hassin and D. Peleg, Extremal Bounds for Probabilistic Polling in Graphs, SIROCCO 2000, 167-180.

  80. D. Peleg, Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems, SWAT 2000.

  81. M. Elkin and D. Peleg, Strong Inapproximability of the Basic k-Spanner Problem, ICALP 2000, 636-647.

  82. P. Fraigniaud, A. Pelc, D. Peleg and S. Perennes, Assigning Labels in Unknown Anonymous Networks, PODC 2000.

  83. L. Gasieniec, A. Pelc and D. Peleg, The wakeup problem in synchronous broadcast systems, PODC 2000.

  84. Y. Hassin and D. Peleg, Sparse Communication Networks and Ecient Routing in the Plane, PODC 2000, 41-50.

  85. D. Peleg, Informative Labeling Schemes for Graphs, MFCS 2000, 579-588.

  86. Y. Atzmony and D. Peleg, Distributed Algorithms for English Auctions, DISC 2000.

  87. C. Gavoille, D. Peleg, S. Perennes and R. Raz, Distance Labeling in Graphs, SODA 2001, 210-219.

  88. M. Elkin and D. Peleg, Approximating k-Spanner Problems for k > 2, IPCO 2001.

  89. M. Elkin and D. Peleg, (1+PG1hdGg+CiAgICA8bXRleHQ+JiN4M0I1OzwvbXRleHQ+CjwvbWF0aD4=,ß)-Spanner Constructions for General Graphs, STOC 2001.

  90. S. Kutten, D. Peleg and U. Vishkin, Deterministic Resource Discovery in Distributed Networks, SPAA 2001, 77-83.

  91. Y. Hassin and D. Peleg, Average Probe Complexity in Quorum Systems, PODC 2001, 180-189.

  92. Z. Lotker, B. Patt-Shamir and D. Peleg, Distributed MST for Constant Diameter Graphs, PODC 2001.

  93. C. Gavoille, D. Peleg, A. Raspaud and E. Sopena, Small k-Dominating Sets in Planar Graphs with Applications, WG 2001.

  94. M. Elkin and D. Peleg, The Client-Server 2-Spanner Problem and Applications to Network Design, SIROCCO 2001, 117-132.

  95. C. Gavoille, M. Katz, N.A. Katz, C. Paul and D. Peleg, Approximate Distance Labeling Schemes, ESA 2001, 476-488.

  96. D. Peleg and U. Pincas, The Average Hop Count Measure for Virtual Path Layouts, DISC 2001, 255-269.

  97. D. Peleg, Distributed Algorithms for Systems of Autonomous Mobile Robots, OPODIS 2005.

  98. M. Katz, N.A. Katz, A. Korman and D. Peleg, Labeling Schemes for Flow and Connectivity, SODA 2002, 927-936.

  99. A. Korman, D. Peleg and Y. Rodeh, Labeling Schemes for Dynamic Tree Networks, STACS 2002, 76-87.

  100. N. Lev-Tov and D. Peleg, Exact Algorithms and Approximation Schemes for Base Station Placement Problems, SWAT 2002, 90-99.

  101. D. Peleg, Low stretch spanning trees, MFCS 2002, 68-80.

  102. S. Kutten and D. Peleg, Asynchronous Resource Discovery in Peer to Peer Networks, SRDS 2002.

  103. D. Peleg, Localized Network Representations, CIAC 2003, Rome, Italy.

  104. D. Peleg, Spanning Trees with Low Maximum/Average Stretch, CIAC 2003, Rome, Italy.

  105. Z. Lotker, B. Patt-Shamir, E. Pavlov and D. Peleg, MST Construction in O(loglog n) Communication Rounds, SPAA 2003, 94-100.

  106. A. Korman and D. Peleg, Labeling Schemes for Weighted Dynamic Trees, ICALP 2003, 369-383.

  107. R. Matichin and D. Peleg, Approximation Algorithm for Hotlink Assignments in Web Directories, WADS 2003, 271-280.

  108. O. Gerstel, S. Kutten, R. Matichin and D. Peleg, Hotlink Enhancement Algorithms for Web Directories, ISAAC 2003, 68-77.

  109. N. Agmon and D. Peleg, Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, SODA 2004, 1063-1071.

  110. Y. Emek and D. Peleg, Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs, SODA 2004, 254-263.

  111. C. Ambuhl, A.E.F. Clementi, M. Di Ianni, N. Lev-Tov, A. Monti, D. Peleg, G. Rossi and R. Silvestri, Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks, STACS 2004, 418-427.

  112. B. Awerbuch, B. Patt-Shamir, D. Peleg and M. Tuttle, Collaboration of Untrusting Peers with Changing Interests, EC 2004, 112-119.

  113. R. Cohen and D. Peleg, Robot Convergence via Center-of-Gravity Algorithms, SIROCCO 2004, 79-88.

  114. R. Matichin and D. Peleg, Approximation Algorithm for Hotlink Assignment in the Greedy Model, SIROCCO 2004, 233-244.

  115. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc and D. Peleg, Graph Exploration by a Finite Automaton, MFCS 2004, 451-462.

  116. R. Cohen and D. Peleg, Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems, ESA 2004, 228-239.

  117. B. Awerbuch, B. Patt-Shamir, D. Peleg and M. Tuttle, Improved Recommendation Systems, SODA 2005, 1174-1183.

  118. S. Kutten, H. Ono, D. Peleg, K. Sadakane and M. Yamashita, Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks, WONS 2005, 125-130.

  119. B. Awerbuch, B. Patt-Shamir, D. Peleg and M. Tuttle, Adaptive Collaboration in Peer-to-Peer Systems, ICDCS 2005, 71-80.

  120. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg, Label-Guided Graph Exploration by a Finite Automaton, ICALP 2005, 335-346.

  121. A. Pelc and D. Peleg, Feasibility and Complexity of Broadcasting with Random Transmission Failures, PODC 2005, 334-341.

  122. L. Gasieniec, D. Peleg and Q. Xin, Faster Communication in Known Topology Radio Networks, PODC 2005, 129-137.

  123. A. Korman, S. Kutten and D. Peleg, Proof Labeling Schemes, PODC 2005, 9-18.

  124. D. Peleg, Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges, IWDC 2005, 1-12.

  125. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg, Labeling Schemes for Tree Representation, IWDC 2005, 13-24.

  126. Y. Emek and D. Peleg, A tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs, SODA 2006, 1045-1053.

  127. R. Cohen and D. Peleg, Convergence of Autonomous Mobile Robots With Inaccurate Sensors and Movements, STACS 2006, 549-560.

  128. E. Kantor and D. Peleg, Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems, CIAC 2006, 211-222.

  129. R. Cohen and D. Peleg, Local Algorithms for Autonomous Robot Systems, SIROCCO 2006, 29-43.

  130. A. Korman and D. Peleg, Dynamic Routing Schemes for General Graphs, ICALP 2006, 619-930.

  131. D. Peleg, Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks, CAAN 2006, 1-4.

  132. A. Korman, D. Peleg and Y. Rodeh, Constructing Labeling Schemes Through Universal Matrices, ISAAC 2006, 409-418.

  133. A. Efrima and D. Peleg, Distributed Models and Algorithms for Mobile Robot Systems, SOFSEM 2007, 70-87.

  134. A. Efrima and D. Peleg, Distributed Algorithms for Partitioning A Swarm of Autonomous Mobile Robots, SIROCCO 2007, 270-284.

  135. Y. Emek, L. Gasieniec, E. Kantor, A. Pelc, D. Peleg and C. Su, Broadcasting in UDG Radio Networks with Unknown Topology, PODC 2007, 195-204.

  136. B. Derbel, C. Gavoille and D. Peleg, Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time, DISC 2007, 179-192.

  137. A. Korman and D. Peleg, Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes, DISC 2007, 313-327.

  138. L. Gasieniec, E. Kantor, D.R. Kowalski, D. Peleg and C. Su, Energy and Time Ecient Broadcasting in Known Topology Radio Networks, DISC 2007, 253-267.

  139. D. Peleg, Time Ecient Broadcasting in Radio Networks, DISC 2007, LNCS 4731, 3-4.

  140. D. Peleg, Time Ecient Broadcasting in Radio Networks: a review, ICDCIT 2007, 1-18.

  141. Y. Emek, D. Peleg and L. Roditty, A Near-Linear Time Algorithm for Computing Replacement Paths in Planar Directed Graphs, SODA 2008, 428-435.

  142. D. Adjiashvili and D. Peleg, Equal-Area Locus-Based Convex Polygon Decomposition, SIROCCO 2008, 141-155.

  143. B. Derbel, C. Gavoille, D. Peleg and L. Viennot, On the Locality of Distributed Sparse Spanner Construction, PODC 2008, 273-282.

  144. Y. Emek, E. Kantor and D. Peleg, On the Effect of the Deployment Setting on Broadcasting in Euclidean Radio Networks, PODC 2008, 223-232.

  145. D. Peleg and L. Roditty, Localized spanner construction for Ad Hoc Networks with Variable Transmission Range, AdHoc-NOW 2008, 135-147.

  146. O. Amini, D. Peleg, S. Perennes, I. Sau and S. Saurabh, Degree-Constrained Subgraph Problems: Hardness and Approximation Results, WAOA 2008, 29-42.

  147. S. Chechik, M. Langberg, D. Peleg and L. Roditty, Fault-Tolerant Spanners for General Graphs, STOC 2009, 435-444.

  148. S. Chechik and D. Peleg, Low-Port Tree Representations, WG 2009, 66-76.

  149. C. Avin, Y. Emek, E. Kantor, Z. Lotker, D. Peleg and L. Roditty, SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks, PODC 2009, 200-209.

  150. E. Kantor and D. Peleg, Efficient k-shot Broadcasting in Radio Networks, DISC 2009, 481-495.

  151. B. Derbel, C. Gavoille, D. Peleg and L. Viennot, Local Computation of Additive Spanners, DISC 2009, 176-190.

  152. D. Peleg and T. Radzik, Time-Efficient Broadcast in Radio Networks, In Graphs and Algorithms in Communication Networks (A. Koster and X. Munoz, Ed's), SV, 2009, 311-334.

  153. R. Bar-Yanai, M. Langberg, D. Peleg and L. Roditty, Realtime Classification for Encrypted traffic, SEA 2010, 373-385.

  154. S. Chechik, Y. Emek, B. Patt-Shamir and D. Peleg, Sparse Reliable Graph Backbones, ICALP 2010, 261-272.

  155. I. Abraham, S. Chechik, C. Gavoille and D. Peleg, Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension, PODC 2010, 192-200.

  156. S. Chechik, M. Langberg, D. Peleg and L. Roditty, f-Sensitivity Distance Oracles and Routing Schemes, ESA 2010, 84-96.

  157. Z. Lotker and D. Peleg, Structure and algorithms in the SINR wireless model, SIGACT News 41, (2010), 74-84.

  158. D. Peleg, As good as it gets: Competitive fault tolerance in network structures, SSS 2009, LNCS 5873, 35-46.

  159. S. Chechik and D. Peleg, Rigid and Competitive Fault Tolerance for Logical Information Structures in Networks (Extended Summary), IEEEI 2010.

  160. D. Peleg, I. Sau and M. Shalom, On Approximating the d-Girth of a Graph, SOFSEM 2011, 467-481.

  161. L. Kor, A. Korman and D. Peleg, Tight Bounds For Distributed MST Verification, STACS 2011, 69-80.

  162. Z. Lotker, M. Parter and D. Peleg and Y.-A. Pignolet, Distributed Power Control in the SINR Model, INFOCOM 2011, 2525-2533.

  163. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg and R. Wattenhofer, Distributed Verification and Hardness of Distributed Approximation, STOC 2011, 363-372.

  164. E. Kantor, Z. Lotker, M. Parter and D. Peleg, The Topology of Wireless Communication, STOC 2011, 383-392.

  165. P. Fraigniaud, A. Korman and D. Peleg, Local Distributed Decision, FOCS 2011, 708-717.

  166. Y. Dieudonne, A. Pelc and D. Peleg, Gathering despite mischief, SODA 2012, 527-540.

  167. C. Avin, A. Cohen, Y. Haddad, E. Kantor, Z. Lotker, M. Parter and D. Peleg, SINR Diagram with Interference Cancellation, SODA 2012, 502-515.

  168. S. Chechik and D. Peleg, The Fault Tolerant Capacitated k-Center Problem, SIROCCO 2012.

  169. Y. Emek, P. Fraigniaud, A. Korman, S. Kutten and D. Peleg, Notions of Connectivity in Overlay Networks, SIROCCO 2012.

  170. B. Haeupler, G. Pandurangan, D. Peleg, R. Rajaraman and Z. Sun, Discovery through Gossip, SPAA 2012.

  171. D. Peleg, L. Roditty and E. Tal, Distributed Algorithms for Network Diameter and Girth, ICALP 2012.

  172. G. Braunschvig, S. Chechik and D. Peleg, Fault Tolerant Additive Spanners, WG 2012.

  173. David Peleg, Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance. WG 2012.

  174. P. Fraigniaud, A. Korman, M. Parter and D. Peleg, Randomized Distributed Decision, DISC 2012, 375-389.

  175. S. Chechik, Q. Godfroy and D. Peleg, Multipath Spanners via Fault-Tolerant Spanners, MedAlg 2012, 108-119.

  176. D. Peleg, Randomized Distributed Decision, FCT 2013.

  177. C. Avin, M. Borokhovich, Y. Haddad, E. Kantor, Z. Lotker, M. Parter and D. Peleg, Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications, SODA 2013, 478-497.

  178. S. Kutten, G. Pandurangan, D. Peleg, P. Robinson and A. Trehan, Sublinear Bounds for Randomized Leader Election, ICDCN 2013, 348-362.

  179. S. Kutten, G. Pandurangan, D. Peleg, P. Robinson and A. Trehan, On the Complexity of Universal Leader Election, PODC 2013.

  180. C. Lenzen and D. Peleg, Ecient Distributed Source Detection with Limited Bandwidth, PODC 2013.

  181. M. Parter and D. Peleg, Sparse Fault-Tolerant BFS Trees, ESA 2013.

  182. S. Chechik, M. Johnson, M. Parter and D. Peleg, Secluded Connectivity Problems, ESA 2013.

  183. S. Holzer, D. Peleg, L. Roditty and R. Wattenhofer, Distributed 3/2-Approximation of the Diameter. DISC 2014, 562-564.

  184. M. Parter and D. Peleg, Fault Tolerant Approximate BFS Trees, SODA 2014.

  185. B. Keller, D. Peleg and R. Wattenhofer, How Even Tiny Influence Can Have a Big Impact! Fun with Algorithms, 2014, 252-263.

  186. C. Avin, M. Borokhovich, Z. Lotker and D. Peleg, Distributed Computing on Core-Periphery Networks: Axiom-based Design, ICALP 2014.

  187. D. Peleg, Immunity Against Local Influence, In: Language, Culture, Computation: Essays Dedicated to Yaacov Choueka, Nachum Dershowitz and Ephraim Nissan, Editors, LNCS, Springer-Verlag, Part I, LNCS 8001, pp. 168-179, 2014.

  188. C. Avin, B. Keller, Z. Lotker, C. Mathieu, D. Peleg and Y.-A. Pignolet, Homophily and the Glass Ceiling Effect in Social Networks, ITCS 2015.

  189. M. Parter and D. Peleg, Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff , SPAA 2015.

  190. M. Parter and D. Peleg, On The Relations between SINR Diagrams and Voronoi Diagrams, AdHoc-NOW 2015.

  191. C. Avin, Z. Lotker, Y. Nahum and D. Peleg, Core Size and Densification in Preferential Attachment Networks, ICALP 2015.

  192. L. Barenboim and D. Peleg, Nearly Optimal Local Broadcasting in the SINR Model with Feedback, SIROCCO 2015,

  193. A. Bar-Noy, D. Peleg, G. Rabanca and I. Vigan, Improved Approximation Algorithms for Weighted 2-path Partitions, ESA 2015.

  194. C. Avin, Z. Lotker, D. Peleg and I. Turkel, Social Network Analysis of Program Committees and Paper Acceptance Fairness, ASONAM 2015.

  195. E. Kantor, Z. Lotker, M. Parter and D. Peleg, The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication, FOCS 2015.

  196. E. Kantor, Z. Lotker, M. Parter and D. Peleg, Nonuniform SINR+Voronoi Diagrams are Effectively Uniform, DISC 2015.

  197. M. Parter, D. Peleg and S. Solomon, Local-on-Average Distributed Tasks, SODA 2016, 220-239.

  198. D. Peleg and S. Solomon, Dynamic (1+PG1hdGg+CiAgICA8bXRleHQ+JiN4M0I1OzwvbXRleHQ+CjwvbWF0aD4=)-Approximate Matchings: A Density-Sensitive Approach, SODA 2016, 712-729.

  199. G. Pandurangan, D. Peleg and M. Scquizzato, Message Lower Bounds via Efficient Network Synchronization, SIROCCO 2016,

  200. C. Avin, Z. Lotker, D. Peleg, Y.-A. Pignolet and I. Turkel, Elites in Social Networks: An Axiomatic Approach, NetSci-X 2017.

  201. C. Avin, Z. Lotker, Y. Nachum and D. Peleg, Modeling and Analysis of Glass Ceiling and Power Inequality in Bi-populated Societies, NetSci-X 2017, 61-72.

  202. C. Avin, H. Daltrophe, Z. Lotker and D. Peleg, Assortative Mixing Equilibria in Social Network Games, GameNets 2017

  203. M. Sinay, N. Agmon, O. Maksimov, S. Kraus and D. Peleg, Maintaining Communication in Multi-Robot Tree Exploration, IJCAI 2017, 4515-4522.

  204. C. Avin, Z. Lotker, Y. Nachum and D. Peleg, Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks, KDD 2017.

  205. Z. Lotker and D. Peleg, The E ect of Population Control Policies on Societal Fragmentation, ASONAM 2017.

  206. C. Avin, A. Cohen, P. Fraigniaud, Z. Lotker and D. Peleg, Preferential Attachment as a Unique Equilibrium, WWW 2018, 559-568.

  207. C. Avin, A. Cohen, Z. Lotker and D. Peleg, Fault-Tolerant Hotelling Games, GameNets 2018.

  208. A. Bar-Noy, K. Choudhary, D. Peleg and D. Rawitz, Realizability of Graph Specifications: Characterizations and Algorithms, SIROCCO 2018.

  209. S. Attali, M. Parter, D. Peleg and S. Solomon, Wireless Expanders, SPAA 2018.

 

Manuscripts

  1. C. Avin, Z. Lotker, Y. Nachum and D. Peleg, Random Preferential Attachment Hypergraphs, manuscript, 2018.