| Year |
Citation |
Score |
| 2020 |
Navon T, Peleg D. Mixed fault tolerance in server assignment: Combining reinforcement and backup Theoretical Computer Science. 836: 76-93. DOI: 10.1016/J.Tcs.2020.06.033 |
0.302 |
|
| 2020 |
Bar-Noy A, Peleg D, Rawitz D. Vertex-weighted realizations of graphs Theoretical Computer Science. 807: 56-72. DOI: 10.1016/J.Tcs.2019.12.020 |
0.402 |
|
| 2020 |
Pandurangan G, Peleg D, Scquizzato M. Message lower bounds via efficient network synchronization Theoretical Computer Science. 810: 82-95. DOI: 10.1016/J.Tcs.2018.11.017 |
0.443 |
|
| 2020 |
Avin C, Daltrophe H, Keller B, Lotker Z, Mathieu C, Peleg D, Pignolet Y. Mixed preferential attachment model: Homophily and minorities in social networks Physica a: Statistical Mechanics and Its Applications. 555: 124723. DOI: 10.1016/J.Physa.2020.124723 |
0.31 |
|
| 2020 |
Parter M, Peleg D. Fault Tolerant Approximate BFS Structures with Additive Stretch Algorithmica. 1-34. DOI: 10.1007/S00453-020-00734-2 |
0.406 |
|
| 2018 |
Avin C, Lotker Z, Peleg D, Pignolet YA, Turkel I. Elites in social networks: An axiomatic approach to power balance and Price's square root law. Plos One. 13: e0205820. PMID 30356289 DOI: 10.1371/Journal.Pone.0205820 |
0.355 |
|
| 2018 |
Kantor E, Lotker Z, Parter M, Peleg D. The topology of wireless communication on a line Theoretical Computer Science. 711: 105-108. DOI: 10.1016/J.Tcs.2017.10.002 |
0.618 |
|
| 2018 |
Lenzen C, Patt-Shamir B, Peleg D. Distributed distance computation and routing with small messages Distributed Computing. 32: 133-157. DOI: 10.1007/S00446-018-0326-6 |
0.445 |
|
| 2016 |
Parter M, Peleg D. Sparse Fault-Tolerant BFS Structures Acm Transactions On Algorithms. 13: 1-24. DOI: 10.1145/2976741 |
0.446 |
|
| 2016 |
Abraham I, Chechik S, Gavoille C, Peleg D. Forbidden-set distance labels for graphs of bounded doubling dimension Acm Transactions On Algorithms. 12. DOI: 10.1145/2818694 |
0.397 |
|
| 2016 |
Kantor E, Peleg D. Efficient k-shot broadcasting in radio networks Discrete Applied Mathematics. 202: 79-94. DOI: 10.1016/J.Dam.2015.08.021 |
0.653 |
|
| 2016 |
Avin C, Lotker Z, Peleg D, Turkel I. On social networks of program committees Social Network Analysis and Mining. 6. DOI: 10.1007/S13278-016-0328-Y |
0.316 |
|
| 2016 |
Peleg D, Solomon S. Dynamic (1 +∈)-Approximate matchings: A density-sensitive approach Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2: 712-729. |
0.328 |
|
| 2015 |
Kantor E, Lotker Z, Parter M, Peleg D. The topology of wireless communication Journal of the Acm. 62. DOI: 10.1145/2807693 |
0.639 |
|
| 2015 |
Kutten S, Pandurangan G, Peleg D, Robinson P, Trehan A. On the complexity of universal leader election Journal of the Acm. 62: 7. DOI: 10.1145/2699440 |
0.483 |
|
| 2015 |
Kantor E, Lotker Z, Parter M, Peleg D. The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 330-349. DOI: 10.1109/FOCS.2015.28 |
0.567 |
|
| 2015 |
Braunschvig G, Chechik S, Peleg D, Sealfon A. Fault tolerant additive and (μ, α)-spanners Theoretical Computer Science. 580: 94-100. DOI: 10.1016/J.Tcs.2015.02.036 |
0.412 |
|
| 2015 |
Chechik S, Peleg D. The fault-tolerant capacitated K-center problem Theoretical Computer Science. 566: 12-25. DOI: 10.1016/J.Tcs.2014.11.017 |
0.342 |
|
| 2015 |
Kutten S, Pandurangan G, Peleg D, Robinson P, Trehan A. Sublinear bounds for randomized leader election Theoretical Computer Science. 561: 134-143. DOI: 10.1016/J.Tcs.2014.02.009 |
0.49 |
|
| 2015 |
Braunschvig G, Brutzkus A, Peleg D, Sealfon A. Truth tellers and liars with fewer questions Discrete Mathematics. 338: 1310-1316. DOI: 10.1016/J.Disc.2015.01.017 |
0.338 |
|
| 2015 |
Kantor E, Lotker Z, Parter M, Peleg D. Nonuniform SINR+Voroni diagrams are effectively uniform Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9363: 558-601. DOI: 10.1007/978-3-662-48653-5_39 |
0.585 |
|
| 2015 |
Bar-Noy A, Peleg D, Rabanca G, Vigan I. Improved approximation algorithms for weighted 2-path partitions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9294: 953-964. DOI: 10.1007/978-3-662-48350-3_79 |
0.432 |
|
| 2015 |
Barenboim L, Peleg D. Nearly optimal local broadcasting in the SINR model with feedback Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9439: 164-178. DOI: 10.1007/978-3-319-25258-2_12 |
0.363 |
|
| 2014 |
Parter M, Peleg D. Fault tolerant approximate BFS structures Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1073-1092. DOI: 10.1145/3022730 |
0.398 |
|
| 2014 |
Dieudonné Y, Pelc A, Peleg D. Gathering despite mischief Acm Transactions On Algorithms. 11. DOI: 10.1145/2629656 |
0.34 |
|
| 2014 |
Chechik S, Peleg D. Robust fault tolerant uncapacitated facility location Theoretical Computer Science. 543: 9-23. DOI: 10.1016/J.Tcs.2014.05.013 |
0.357 |
|
| 2014 |
Avin C, Borokhovich M, Lotker Z, Peleg D. Distributed computing on core-periphery networks: Axiom-based design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8573: 399-410. DOI: 10.1016/J.Jpdc.2016.08.003 |
0.44 |
|
| 2013 |
Fraigniaud P, Korman A, Peleg D. Towards a complexity theory for local distributed computing Journal of the Acm. 60. DOI: 10.1145/2499228 |
0.311 |
|
| 2013 |
Avin C, Borokhovich M, Haddad Y, Kantor E, Lotker Z, Parter M, Peleg D. Testing the irreducibility of nonsquare Perron-Frobenius systems Information Processing Letters. DOI: 10.1016/J.Ipl.2014.05.004 |
0.585 |
|
| 2013 |
Peleg D, Sau I, Shalom M. On approximating the d-girth of a graph Discrete Applied Mathematics. 161: 2587-2596. DOI: 10.1016/J.Dam.2013.04.022 |
0.398 |
|
| 2013 |
Chechik S, Johnson MP, Parter M, Peleg D. Secluded connectivity problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8125: 301-312. DOI: 10.1007/S00453-016-0222-Z |
0.483 |
|
| 2013 |
Peleg D, Roditty L. Relaxed spanners for directed disk graphs Algorithmica. 65: 146-158. DOI: 10.1007/S00453-011-9580-8 |
0.403 |
|
| 2013 |
Kor L, Korman A, Peleg D. Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification Theory of Computing Systems. 53: 318-340. DOI: 10.1007/S00224-013-9479-7 |
0.467 |
|
| 2013 |
Parter M, Peleg D. Sparse fault-tolerant BFS trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8125: 779-790. DOI: 10.1007/978-3-642-40450-4_66 |
0.345 |
|
| 2012 |
Avin C, Emek Y, Kantor E, Lotker Z, Peleg D, Roditty L. SINR Diagrams: Convexity and its applications in wireless networks Journal of the Acm. 59. DOI: 10.1145/2339123.2339125 |
0.783 |
|
| 2012 |
Sarma AD, Holzer S, Kor L, Korman A, Nanongkai D, Pandurangan G, Peleg D, Wattenhofer R. Distributed verification and hardness of distributed approximation Siam Journal On Computing. 41: 1235-1265. DOI: 10.1137/11085178X |
0.37 |
|
| 2012 |
Chechik S, Emek Y, Patt-Shamir B, Peleg D. Sparse reliable graph backbones Information and Computation. 210: 31-39. DOI: 10.1016/J.Ic.2011.10.007 |
0.712 |
|
| 2012 |
Amini O, Peleg D, Pérennes S, Sau I, Saurabh S. On the approximability of some degree-constrained subgraph problems Discrete Applied Mathematics. 160: 1661-1679. DOI: 10.1016/J.Dam.2012.03.025 |
0.429 |
|
| 2012 |
Peleg D, Roditty L, Tal E. Distributed algorithms for network diameter and girth Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7392: 660-672. DOI: 10.1007/978-3-642-31585-5-58 |
0.394 |
|
| 2012 |
Emek Y, Fraigniaud P, Korman A, Kutten S, Peleg D. Notions of connectivity in overlay networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7355: 25-35. DOI: 10.1007/978-3-642-31104-8_3 |
0.654 |
|
| 2011 |
Lotker Z, Parter M, Peleg D, Pignolet YA. Distributed power control in the SINR model Proceedings - Ieee Infocom. 2525-2533. DOI: 10.1109/INFCOM.2011.5935077 |
0.311 |
|
| 2011 |
Weimann O, Peleg D. A note on exact distance labeling Information Processing Letters. 111: 671-673. DOI: 10.1016/J.Ipl.2011.04.006 |
0.363 |
|
| 2011 |
Chechik S, Langberg M, Peleg D, Roditty L. f-Sensitivity Distance Oracles and Routing Schemes Algorithmica (New York). 1-22. DOI: 10.1007/S00453-011-9543-0 |
0.359 |
|
| 2011 |
Peleg D. SINR maps: Properties and applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6796: 15-16. DOI: 10.1007/978-3-642-22212-2_2 |
0.337 |
|
| 2010 |
Emek Y, Roditty L, Peleg D. A near-linear-time algorithm for computing replacement paths in planar directed graphs Acm Transactions On Algorithms. 6. DOI: 10.1145/1824777.1824784 |
0.747 |
|
| 2010 |
Lotker Z, Peleg D. Structure and algorithms in the SINR wireless model Acm Sigact News. 41: 74-84. DOI: 10.1145/1814370.1814391 |
0.356 |
|
| 2010 |
Peleg D, Roditty L. Localized spanner construction for Ad Hoc networks with variable transmission range Acm Transactions On Sensor Networks. 7. DOI: 10.1145/1807048.1807054 |
0.442 |
|
| 2010 |
Chechik S, Langberg M, Peleg D, Roditty L. Fault tolerant spanners for general graphs Siam Journal On Computing. 39: 3403-3423. DOI: 10.1137/090758039 |
0.349 |
|
| 2010 |
Adjiashvili D, Peleg D. Equal-area locus-based convex polygon decomposition Theoretical Computer Science. 411: 1648-1667. DOI: 10.1016/J.Tcs.2010.01.012 |
0.357 |
|
| 2010 |
Korman A, Peleg D, Rodeh Y. Constructing labeling schemes through universal matrices Algorithmica (New York). 57: 641-652. DOI: 10.1007/S00453-008-9226-7 |
0.368 |
|
| 2010 |
Korman A, Kutten S, Peleg D. Proof labeling schemes Distributed Computing. 22: 215-233. DOI: 10.1007/S00446-010-0095-3 |
0.378 |
|
| 2010 |
Chechik S, Peleg D. Low-port tree representations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5911: 66-76. DOI: 10.1007/978-3-642-11409-0_6 |
0.325 |
|
| 2009 |
Avin C, Emek Y, Kantor E, Lotker Z, Peleg D, Roditty L. SINR diagrams: Towards algorithmically usable SINR models of wireless networks Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 200-209. DOI: 10.1145/1582716.1582750 |
0.721 |
|
| 2009 |
Emek Y, Peleg D. A tight upper bound on the probabilistic embedding of series-parallel graphs Siam Journal On Discrete Mathematics. 23: 1827-1841. DOI: 10.1137/090745441 |
0.736 |
|
| 2009 |
Efrima A, Peleg D. Distributed algorithms for partitioning a swarm of autonomous mobile robots Theoretical Computer Science. 410: 1355-1368. DOI: 10.1016/J.Tcs.2008.04.042 |
0.367 |
|
| 2009 |
Kantor E, Peleg D. Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems Journal of Discrete Algorithms. 7: 341-362. DOI: 10.1016/J.Jda.2008.11.006 |
0.628 |
|
| 2009 |
Lev-Tov N, Peleg D. Conflict-free coloring of unit disks Discrete Applied Mathematics. 157: 1521-1532. DOI: 10.1016/J.Dam.2008.09.005 |
0.779 |
|
| 2009 |
Zhang Y, Manisterski E, Kraus S, Subrahmanian VS, Peleg D. Computing the fault tolerance of multi-agent deployment Belgian/Netherlands Artificial Intelligence Conference. 385-386. DOI: 10.1016/J.Artint.2008.11.007 |
0.4 |
|
| 2009 |
Cohen R, Fraigniaud P, Ilcinkas D, Korman A, Peleg D. Labeling schemes for tree representation Algorithmica (New York). 53: 1-15. DOI: 10.1007/S00453-007-9089-3 |
0.398 |
|
| 2009 |
Emek Y, Ga̧sieniec L, Kantor E, Pelc A, Peleg D, Su C. Broadcasting in UDG radio networks with unknown topology Distributed Computing. 21: 331-351. DOI: 10.1007/S00446-008-0075-Z |
0.783 |
|
| 2009 |
Amini O, Peleg D, Pérennes S, Sau I, Saurabh S. Degree-constrained subgraph problems: Hardness and approximation results Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5426: 29-42. DOI: 10.1007/978-3-540-93980-1_3 |
0.358 |
|
| 2008 |
Cohen R, Fraigniaud P, Ilcinkas D, Korman A, Peleg D. Label-guided graph exploration by a finite automaton Acm Transactions On Algorithms. 4. DOI: 10.1145/1383369.1383373 |
0.36 |
|
| 2008 |
Korman A, Peleg D. Dynamic routing schemes for graphs with low local density Acm Transactions On Algorithms. 4. DOI: 10.1145/1383369.1383372 |
0.373 |
|
| 2008 |
Emek Y, Peleg D. Approximating minimum max-stretch spanning trees on unweighted graphs Siam Journal On Computing. 38: 1761-1781. DOI: 10.1137/060666202 |
0.714 |
|
| 2008 |
Cohen R, Peleg D. Local spreading algorithms for autonomous robot systems Theoretical Computer Science. 399: 71-82. DOI: 10.1016/J.Tcs.2008.02.007 |
0.386 |
|
| 2008 |
Emek Y, Kantor E, Peleg D. On the effect of the deployment setting on broadcasting in Euclidean radio networks Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 223-231. DOI: 10.1007/S00446-016-0273-Z |
0.786 |
|
| 2008 |
Korman A, Peleg D. Compact separator decompositions in dynamic trees and applications to labeling schemes Distributed Computing. 21: 141-161. DOI: 10.1007/S00446-008-0061-5 |
0.332 |
|
| 2008 |
Ga̧sieniec L, Kantor E, Kowalski DR, Peleg D, Su C. Time efficient k-shot broadcasting in known topology radio networks Distributed Computing. 21: 117-127. DOI: 10.1007/S00446-008-0058-0 |
0.667 |
|
| 2008 |
Emek Y, Peleg D, Roditty L. A near-linear time algorithm for computing replacement paths in planar directed graphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 428-435. |
0.732 |
|
| 2007 |
Gerstel O, Kutten S, Laber ES, Matichin R, Peleg D, Pessoa AA, Souza C. Reducing human interactions in Web directory searches Acm Transactions On Information Systems. 25. DOI: 10.1145/1281485.1281491 |
0.385 |
|
| 2007 |
Pelc A, Peleg D. Feasibility and complexity of broadcasting with random transmission failures Theoretical Computer Science. 370: 279-292. DOI: 10.1016/J.Tcs.2006.10.031 |
0.359 |
|
| 2007 |
Peleg D. Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems Journal of Discrete Algorithms. 5: 55-64. DOI: 10.1016/J.Jda.2006.03.008 |
0.459 |
|
| 2007 |
Korman A, Peleg D. Labeling schemes for weighted dynamic trees Information and Computation. 205: 1721-1740. DOI: 10.1016/J.Ic.2007.08.004 |
0.346 |
|
| 2007 |
Eilam T, Gavoille C, Peleg D. Average stretch analysis of compact routing schemes Discrete Applied Mathematics. 155: 598-610. DOI: 10.1016/J.Dam.2006.09.010 |
0.473 |
|
| 2007 |
Kutten S, Peleg D. Asynchronous resource discovery in peer-to-peer networks Computer Networks. 51: 190-206. DOI: 10.1016/J.Comnet.2006.02.005 |
0.481 |
|
| 2007 |
Ga̧sieniec L, Peleg D, Xin Q. Faster communication in known topology radio networks Distributed Computing. 19: 289-300. DOI: 10.1007/S00446-006-0011-Z |
0.477 |
|
| 2007 |
Elkin M, Peleg D. The hardness of approximating spanner problems Theory of Computing Systems. 41: 691-729. DOI: 10.1007/S00224-006-1266-2 |
0.344 |
|
| 2007 |
Matichin R, Peleg D. Approximation algorithm for hotlink assignment in the greedy model Theoretical Computer Science. 383: 102-110. DOI: 10.1007/978-3-540-27796-5_21 |
0.415 |
|
| 2007 |
Peleg D. Time-efficient broadcasting in radio networks: A review Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4882: 1-18. |
0.321 |
|
| 2007 |
Ga̧sieniec L, Kantor E, Kowalski DR, Peleg D, Chang S. Energy and time efficient broadcasting in known topology radio networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4731: 253-267. |
0.345 |
|
| 2007 |
Derbel B, Gavoille C, Peleg D. Deterministic distributed construction of linear stretch spanners in polylogarithmic time Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4731: 179-192. |
0.301 |
|
| 2006 |
Lotker Z, Patt-Shamir B, Pavlov E, Peleg D. Minimum-weight spanning tree construction in O(log log n) communication rounds Siam Journal On Computing. 35: 120-131. DOI: 10.1137/S0097539704441848 |
0.38 |
|
| 2006 |
Agmon N, Peleg D. Fault-tolerant gathering algorithms for autonomous mobile robots Siam Journal On Computing. 36: 56-82. DOI: 10.1137/050645221 |
0.31 |
|
| 2006 |
Lotker Z, Patt-Shamir B, Peleg D. Distributed MST for constant diameter graphs Distributed Computing. 18: 453-460. DOI: 10.1007/S00446-005-0127-6 |
0.45 |
|
| 2006 |
Kantor E, Peleg D. Approximate hierarchical facility location and applications to the shallow steiner tree and range assignment problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3998: 211-222. DOI: 10.1007/11758471_22 |
0.586 |
|
| 2005 |
Cohen R, Peleg D. Convergence properties of the gravitational algorithm in asynchronous robot systems Siam Journal On Computing. 34: 1516-1528. DOI: 10.1137/S0097539704446475 |
0.337 |
|
| 2005 |
Katz M, Katz NA, Korman A, Peleg D. Labeling schemes for flow and connectivity Siam Journal On Computing. 34: 23-40. DOI: 10.1137/S0097539703433912 |
0.36 |
|
| 2005 |
Peleg D. Informative labeling schemes for graphs Theoretical Computer Science. 340: 577-593. DOI: 10.1016/J.Tcs.2005.03.015 |
0.398 |
|
| 2005 |
Elkin M, Peleg D. Approximating k-spanner problems for k>2 Theoretical Computer Science. 337: 249-277. DOI: 10.1016/J.Tcs.2004.11.022 |
0.456 |
|
| 2005 |
Peleg D, Pincas U. Virtual path layouts optimizing total hop count on ATM tree networks Journal of Discrete Algorithms. 3: 101-112. DOI: 10.1016/J.Jda.2004.05.003 |
0.458 |
|
| 2005 |
Pelc A, Peleg D. Broadcasting with locally bounded Byzantine faults Information Processing Letters. 93: 109-115. DOI: 10.1016/J.Ipl.2004.10.007 |
0.354 |
|
| 2005 |
Katz M, Katz NA, Peleg D. Distance labeling schemes for well-separated graph classes Discrete Applied Mathematics. 145: 384-402. DOI: 10.1016/J.Dam.2004.03.005 |
0.402 |
|
| 2005 |
Lev-Tov N, Peleg D. Polynomial time approximation schemes for base station coverage with minimum total radii Computer Networks. 47: 489-501. DOI: 10.1016/J.Comnet.2004.08.012 |
0.785 |
|
| 2005 |
Peleg D. Distributed coordination algorithms for mobile robot swarms: New directions and challenges Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3741: 1-12. DOI: 10.1007/11603771_1 |
0.308 |
|
| 2004 |
Elkin M, Peleg D. $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs Siam Journal On Computing. 33: 608-631. DOI: 10.1137/S0097539701393384 |
0.369 |
|
| 2004 |
Kutten S, Ono H, Peleg D, Sadakane K, Yamashita M. Energy-optimal online algorithms for broadcasting in wireless networks 2nd Annual Conference On Wireless On-Demand Network Systems and Services, Wons 2005. 125-130. DOI: 10.1109/WONS.2005.14 |
0.313 |
|
| 2004 |
Gavoille C, Peleg D, Pérennes S, Raz R. Distance labeling in graphs Journal of Algorithms. 53: 85-112. DOI: 10.1016/J.Jalgor.2004.05.002 |
0.43 |
|
| 2004 |
Korman A, Peleg D, Rodeh Y. Labeling Schemes for Dynamic Tree Networks Theory of Computing Systems. 37: 49-75. DOI: 10.1007/S00224-003-1106-6 |
0.394 |
|
| 2004 |
Ambühl C, Clementi AEF, Di Ianni M, Lev-Tov N, Monti A, Peleg D, Rossi G, Silvestri R. Efficient algorithms for low-energy bounded-hop broadcast in Ad-Hoc wireless networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2996: 418-427. |
0.8 |
|
| 2003 |
Eilam T, Gavoille C, Peleg D. Compact routing schemes with low stretch factor Journal of Algorithms. 46: 97-114. DOI: 10.1016/S0196-6774(03)00002-6 |
0.42 |
|
| 2003 |
Bermond J, Bond J, Peleg D, Perennes S. The power of small coalitions in graphs Discrete Applied Mathematics. 127: 399-414. DOI: 10.1016/S0166-218X(02)00241-X |
0.344 |
|
| 2003 |
Gavoille C, Peleg D. Compact and localized distributed data structures Distributed Computing. 16: 111-120. DOI: 10.1007/S00446-002-0073-5 |
0.309 |
|
| 2003 |
Kutten S, Peleg D, Vishkin U. Deterministic Resource Discovery in Distributed Networks Theory of Computing Systems. 36: 479-495. DOI: 10.1007/S00224-003-1084-8 |
0.454 |
|
| 2002 |
Drori L, Peleg D. Faster exact solutions for some NP-hard problems Theoretical Computer Science. 287: 473-499. DOI: 10.1016/S0304-3975(01)00257-2 |
0.41 |
|
| 2002 |
Peleg D. Local majorities, coalitions and monopolies in graphs: a review Theoretical Computer Science. 282: 231-257. DOI: 10.1016/S0304-3975(01)00055-X |
0.395 |
|
| 2001 |
Gasieniec L, Pelc A, Peleg D. The Wakeup Problem in Synchronous Broadcast Systems Siam Journal On Discrete Mathematics. 14: 207-222. DOI: 10.1137/S0895480100376022 |
0.383 |
|
| 2001 |
Gavoille C, Peleg D. The Compactness of Interval Routing for Almost All Graphs Siam Journal On Computing. 31: 706-721. DOI: 10.1137/S0097539799351717 |
0.423 |
|
| 2001 |
Bar-Ilan J, Kortsarz G, Peleg D. Generalized submodular cover problems and applications Theoretical Computer Science. 250: 179-200. DOI: 10.1016/S0304-3975(99)00130-9 |
0.386 |
|
| 2001 |
Feige U, Peleg D, Kortsarz G. The Dense k -Subgraph Problem Algorithmica. 29: 410-421. DOI: 10.1007/S004530010050 |
0.445 |
|
| 2001 |
Hassin Y, Peleg D. Sparse communication networks and efficient routing in the plane Distributed Computing. 14: 205-215. DOI: 10.1007/S004460100054 |
0.407 |
|
| 2001 |
Fraigniaud P, Pelc A, Peleg D, Pérennes S. Assigning labels in an unknown anonymous network with a leader Distributed Computing. 14: 163-183. DOI: 10.1007/Pl00008935 |
0.413 |
|
| 2001 |
Peleg D, Reshef E. Low Complexity Variants of the Arrow Distributed Directory Journal of Computer and System Sciences. 63: 474-485. DOI: 10.1006/Jcss.2001.1787 |
0.407 |
|
| 2001 |
Hassin Y, Peleg D. Distributed Probabilistic Polling and Applications to Proportionate Agreement Information and Computation. 171: 248-268. DOI: 10.1006/Inco.2001.3088 |
0.399 |
|
| 2000 |
Kutten S, Peleg D. Tight Fault Locality Siam Journal On Computing. 30: 247-268. DOI: 10.1137/S0097539797319109 |
0.352 |
|
| 2000 |
Dolev S, Kranakis E, Krizanc D, Peleg D. Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks Siam Journal On Computing. 29: 804-833. DOI: 10.1137/S0097539797316610 |
0.38 |
|
| 2000 |
Peleg D, Rubinovich V. A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction Siam Journal On Computing. 30: 1427-1442. DOI: 10.1137/S0097539700369740 |
0.419 |
|
| 2000 |
Focardi R, Luccio FL, Peleg D. Feedback vertex set in hypercubes Information Processing Letters. 76: 1-5. DOI: 10.1016/S0020-0190(00)00127-7 |
0.406 |
|
| 2000 |
Peleg D. Proximity-Preserving Labeling Schemes Journal of Graph Theory. 33: 167-176. DOI: 10.1002/(Sici)1097-0118(200003)33:3<>1.0.Co;2-Y |
0.379 |
|
| 1999 |
Gavoille C, Peleg D. The Compactness of Interval Routing Siam Journal On Discrete Mathematics. 12: 459-473. DOI: 10.1137/S0895480197328631 |
0.422 |
|
| 1999 |
Kortsarz G, Peleg D. Approximating the weight of shallow Steiner trees Discrete Applied Mathematics. 93: 265-285. DOI: 10.1016/S0166-218X(99)00111-0 |
0.455 |
|
| 1999 |
Laforest C, Liestman AL, Peleg D, Shermer TC, Sotteau D. Edge-disjoint spanners of complete graphs and complete digraphs Discrete Mathematics. 203: 133-159. DOI: 10.1016/S0012-365X(99)00012-6 |
0.357 |
|
| 1999 |
Kutten S, Peleg D. Fault-Local Distributed Mending Journal of Algorithms. 30: 144-165. DOI: 10.1006/Jagm.1998.0972 |
0.35 |
|
| 1998 |
Awerbuch B, Cidon I, Kutten S, Mansour Y, Peleg D. Optimal Broadcast with Partial Knowledge Siam Journal On Computing. 28: 511-524. DOI: 10.1137/S0097539795279931 |
0.342 |
|
| 1998 |
Awerbuch B, Berger B, Cowen L, Peleg D. Near-Linear Time Construction of Sparse Neighborhood Covers Siam Journal On Computing. 28: 263-277. DOI: 10.1137/S0097539794271898 |
0.479 |
|
| 1998 |
Kortsarz G, Peleg D. Generating Low-Degree 2-Spanners Siam Journal On Computing. 27: 1438-1456. DOI: 10.1137/S0097539794268753 |
0.472 |
|
| 1998 |
Garay JA, Kutten S, Peleg D. A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees Siam Journal On Computing. 27: 302-316. DOI: 10.1137/S0097539794261118 |
0.491 |
|
| 1998 |
Peleg D. Size bounds for dynamic monopolies Discrete Applied Mathematics. 86: 263-273. DOI: 10.1016/S0166-218X(98)00043-2 |
0.342 |
|
| 1998 |
Kutten S, Peleg D. Fast Distributed Construction of Smallk-Dominating Sets and Applications Journal of Algorithms. 28: 40-66. DOI: 10.1006/Jagm.1998.0929 |
0.464 |
|
| 1997 |
Holzman R, Marcus Y, Peleg D. Load Balancing in Quorum Systems Siam Journal On Discrete Mathematics. 10: 223-245. DOI: 10.1137/S0895480193260303 |
0.326 |
|
| 1997 |
Peleg D, Schechtman G, Wool A. Randomized approximation of bounded multicovering problems Algorithmica. 18: 44-66. DOI: 10.1007/Bf02523687 |
0.421 |
|
| 1996 |
Awerbuch B, Berger B, Cowen L, Peleg D. Fast distributed network decompositions and covers Journal of Parallel and Distributed Computing. 39: 105-114. DOI: 10.1006/Jpdc.1996.0159 |
0.417 |
|
| 1996 |
Bar-Ilan J, Peleg D. Scheduling Jobs Using Common Resources Information and Computation. 125: 52-61. DOI: 10.1006/Inco.1996.0020 |
0.401 |
|
| 1995 |
Awerbuch B, Peleg D. Online Tracking of Mobile Users Journal of the Acm (Jacm). 42: 1021-1058. DOI: 10.1145/210118.210132 |
0.396 |
|
| 1995 |
Kortsarz G, Peleg D. Approximation Algorithms for Minimum-Time Broadcast Siam Journal On Discrete Mathematics. 8: 401-427. DOI: 10.1137/S0895480193245923 |
0.482 |
|
| 1995 |
Alon N, Karp RM, Peleg D, West D. A Graph-Theoretic Game and Its Application to the k-Server Problem Siam Journal On Computing. 24: 78-100. DOI: 10.1137/S0097539792224474 |
0.43 |
|
| 1995 |
Cidon I, Kutten S, Mansour Y, Peleg D. Greedy Packet Scheduling Siam Journal On Computing. 24: 148-157. DOI: 10.1137/S0097539791217695 |
0.447 |
|
| 1995 |
Peleg D. A Note on Optimal Time Broadcast in Faulty Hypercubes Journal of Parallel and Distributed Computing. 26: 132-135. DOI: 10.1006/Jpdc.1995.1054 |
0.351 |
|
| 1995 |
Benasher Y, Lange K, Peleg D, Schuster A. The Complexity of Reconfiguring Network Models Information and Computation. 121: 41-58. DOI: 10.1006/Inco.1995.1122 |
0.388 |
|
| 1994 |
Feige U, Raghavan P, Peleg D, Upfal E. Computing with Noisy Information Siam Journal On Computing. 23: 1001-1018. DOI: 10.1137/S0097539791195877 |
0.356 |
|
| 1994 |
Awerbuch B, Kutten S, Peleg D. On Buffer-Economical Store-and-Forward Deadlock Prevention Ieee Transactions On Communications. 42: 2934-2937. DOI: 10.1109/26.328973 |
0.363 |
|
| 1994 |
Bar‐Ilan J, Kortsarz G, Peleg D. Information centre allocation The Electronic Library. 12: 361-365. DOI: 10.1108/Eb045324 |
0.36 |
|
| 1994 |
Kortsarz G, Peleg D. Traffic-light scheduling on the grid Discrete Applied Mathematics. 53: 211-234. DOI: 10.1016/0166-218X(94)90186-4 |
0.376 |
|
| 1994 |
Kortsarz G, Peleg D. Generating Sparse 2-Spanners Journal of Algorithms. 17: 222-236. DOI: 10.1006/Jagm.1994.1032 |
0.421 |
|
| 1994 |
Awerbuch B, Berger B, Cowen L, Peleg D. Low-diameter graph decomposition is in NC Random Structures and Algorithms. 5: 441-452. DOI: 10.1002/Rsa.3240050305 |
0.457 |
|
| 1993 |
Patt-Shamir B, Peleg D. Time-space tradeoffs for set operations Theoretical Computer Science. 110: 99-129. DOI: 10.1016/0304-3975(93)90352-T |
0.379 |
|
| 1993 |
Barilan J, Kortsarz G, Peleg D. How to Allocate Network Centers Journal of Algorithms. 15: 385-415. DOI: 10.1006/Jagm.1993.1047 |
0.451 |
|
| 1993 |
Peleg D. Distance-Dependent Distributed Directories Information and Computation. 103: 270-298. DOI: 10.1006/Inco.1993.1020 |
0.421 |
|
| 1992 |
Awerbuch B, Peleg D. Routing with Polynomial Communication-Space Srade-ff Siam Journal On Discrete Mathematics. 5: 151-162. DOI: 10.1137/0405013 |
0.43 |
|
| 1992 |
Alon N, Bar-Noy A, Linial N, Peleg D. Single round simulation on radio networks Journal of Algorithms. 13: 188-210. DOI: 10.1016/0196-6774(92)90015-5 |
0.386 |
|
| 1991 |
Grigni M, Peleg D. Tight Bounds on Mimimum Broadcast Networks Siam Journal On Discrete Mathematics. 4: 207-222. DOI: 10.1137/0404021 |
0.391 |
|
| 1991 |
Bar-Noy A, Peleg D. Square Meshes are not always Optimal Ieee Transactions On Computers. 40: 196-204. DOI: 10.1109/12.73589 |
0.368 |
|
| 1991 |
Bar-Noy A, Dolev D, Koller D, Peleg D. Fault-tolerant critical section management in asynchronous environments Information and Computation. 95: 1-20. DOI: 10.1016/0890-5401(91)90014-S |
0.369 |
|
| 1991 |
Ben-Asher Y, Peleg D, Ramaswami R, Schuster A. The power of reconfiguration Journal of Parallel and Distributed Computing. 13: 139-153. DOI: 10.1016/0743-7315(91)90084-M |
0.399 |
|
| 1990 |
Attiya H, Bar-Noy A, Dolev D, Peleg D, Reischuk R. Renaming in an Asynchronous Environment Journal of the Acm (Jacm). 37: 524-548. DOI: 10.1145/79147.79158 |
0.397 |
|
| 1990 |
Awerbuch B, Goldreich O, Vainish R, Peleg D. A Trade-Off Between Information and Communication in Broadcast Protocols Journal of the Acm (Jacm). 37: 238-256. DOI: 10.1145/77600.77618 |
0.431 |
|
| 1990 |
Peleg D. Time-optimal leader election in general networks Journal of Parallel and Distributed Computing. 8: 96-99. DOI: 10.1016/0743-7315(90)90074-Y |
0.423 |
|
| 1990 |
Awerbuch B, Bar-Noy A, Linial N, Peleg D. Improved routing strategies with succinct tables Journal of Algorithms. 11: 307-341. DOI: 10.1016/0196-6774(90)90017-9 |
0.398 |
|
| 1990 |
Feige U, Peleg D, Raghavan P, Upfal E. Randomized broadcast in networks Random Structures and Algorithms. 1: 447-460. DOI: 10.1002/Rsa.3240010406 |
0.41 |
|
| 1989 |
Peleg D, Ullman JD. An Optimal Synchronizer for the Hypercube Siam Journal On Computing. 18: 740-747. DOI: 10.1137/0218050 |
0.381 |
|
| 1989 |
Peleg D, Upfal E. The Token Distribution Problem Siam Journal On Computing. 18: 229-243. DOI: 10.1137/0218015 |
0.45 |
|
| 1989 |
Peleg D, Van Gelder A. Packet distribution on a ring Journal of Parallel and Distributed Computing. 6: 558-567. DOI: 10.1016/0743-7315(89)90006-3 |
0.319 |
|
| 1989 |
Peleg D, Upfal E. Constructing disjoint paths on expander graphs Combinatorica. 9: 289-313. DOI: 10.1007/Bf02125897 |
0.461 |
|
| 1989 |
Peleg D, Schäffer AA. Time bounds on fault-tolerant broadcasting Networks. 19: 803-822. DOI: 10.1002/Net.3230190706 |
0.363 |
|
| 1988 |
Peleg D, Upfal E. A tradeoff between space and efficiency for routing tables Proceedings of the Annual Acm Symposium On Theory of Computing. 43-52. DOI: 10.1145/65950.65953 |
0.419 |
|
| 1988 |
Krizanc D, Peleg D, Upfal E. A time-randomness tradeoff for oblivious routing Proceedings of the Annual Acm Symposium On Theory of Computing. 93-102. DOI: 10.1137/0219017 |
0.415 |
|
| 1988 |
Dwork C, Peleg D, Pippenger N, Upfal E. Fault Tolerance in Networks of Bounded Degree Siam Journal On Computing. 17: 975-988. DOI: 10.1137/0217061 |
0.348 |
|
| 1987 |
Peleg D, Simons B. On fault tolerant routings in general networks Information and Computation. 74: 33-49. DOI: 10.1016/0890-5401(87)90010-1 |
0.379 |
|
| 1987 |
Peleg D, Upfal E. The generalized packet routing problem Theoretical Computer Science. 53: 281-293. DOI: 10.1016/0304-3975(87)90069-7 |
0.415 |
|
| 1985 |
Harel D, Peleg D. More on looping vs. repeating in dynamic logic Information Processing Letters. 20: 87-90. DOI: 10.1016/0020-0190(85)90069-9 |
0.324 |
|
| 1984 |
Peleg D. A generalized closure and complement phenomenon Discrete Mathematics. 50: 285-293. DOI: 10.1016/0012-365X(84)90055-4 |
0.312 |
|
| Show low-probability matches. |