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