default search action
David Peleg
Danny Peleg
Person information
- affiliation: Weizmann Institute of Science, Israel
- award (2008): Dijkstra Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j193]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate realizations for outerplanaric degree sequences. J. Comput. Syst. Sci. 148: 103588 (2025) - 2024
- [j192]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted microscopic image reconstruction. Discret. Appl. Math. 345: 17-33 (2024) - [j191]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Graph realization of distance sets. Theor. Comput. Sci. 1019: 114810 (2024) - [c237]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. IWOCA 2024: 98-110 - [c236]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). MFCS 2024: 1:1-1:16 - [c235]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Sparse Graphic Degree Sequences Have Planar Realizations. MFCS 2024: 18:1-18:17 - [c234]John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, Aishwarya Thiruvengadam:
Byzantine Resilient Distributed Computing on External Data. DISC 2024: 3:1-3:23 - [i38]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. CoRR abs/2405.03278 (2024) - 2023
- [j190]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Composed Degree-Distance Realizations of Graphs. Algorithmica 85(3): 665-687 (2023) - [j189]Pavel Chebotarev, David Peleg
:
The power of small coalitions under two-tier majority on regular graphs. Discret. Appl. Math. 340: 239-258 (2023) - [j188]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Forcibly bipartite and acyclic (uni-)graphic sequences. Discret. Math. 346(7): 113460 (2023) - [j187]Amotz Bar-Noy, Keerti Choudhary
Graph realizations: Maximum degree in vertex neighborhoods. Discret. Math. 346(9): 113483 (2023) - [j186]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. ACM Trans. Algorithms 19(1): 1:1-1:45 (2023) - [c233]Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
Local Recurrent Problems in the SUPPORTED Model. OPODIS 2023: 22:1-22:19 - [c232]Akanksha Agrawal
Brief Announcement: Local Problems in the SUPPORTED Model. PODC 2023: 172-175 - [c231]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Degree Realization by Bipartite Multigraphs. SIROCCO 2023: 3-17 - [e7]Jérôme Leroux
48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France. LIPIcs 272, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-292-1 [contents] - [i37]John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran
Byzantine Resilient Computing with the Cloud. CoRR abs/2309.16359 (2023) - 2022
- [j185]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The generalized microscopic image reconstruction problem. Discret. Appl. Math. 321: 402-416 (2022) - [j184]Amotz Bar-Noy, Toni Böhnlein, David Peleg
On vertex-weighted realizations of acyclic and general graphs. Theor. Comput. Sci. 922: 81-95 (2022) - [j183]Chen Avin, Avi Cohen
Hotelling games in fault-prone settings. Theor. Comput. Sci. 922: 96-107 (2022) - [j182]John Augustine
Distributed Graph Realizations. IEEE Trans. Parallel Distributed Syst. 33(6): 1321-1337 (2022) - [c230]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Graph Realization of Distance Sets. MFCS 2022: 13:1-13:14 - [c229]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. MFCS 2022: 14:1-14:15 - [c228]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper). SWAT 2022: 1:1-1:17 - [c227]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Vertex-Weighted Graphs: Realizable and Unrealizable Domains. WALCOM 2022: 315-327 - [c226]Fabien Dufoulon
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. DISC 2022: 19:1-19:24 - [i36]Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg:
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. CoRR abs/2210.01173 (2022) - [i35]Pavel Chebotarev, David Peleg:
The Power of Small Coalitions under Two-Tier Majority on Regular Graphs. CoRR abs/2210.03410 (2022) - [i34]Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
Recurrent Problems in the LOCAL model. CoRR abs/2212.14542 (2022) - 2021
- [j181]David Peleg:
EATCS Distinguished Dissertation Award for 2020. Bull. EATCS 134 (2021) - [j180]David Peleg:
EATCS Distinguished Dissertation Award 2021 - Call for Nominations. Bull. EATCS 135 (2021) - [j179]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Nonuniform SINR+Voronoi diagrams are effectively uniform. Theor. Comput. Sci. 878-879: 53-66 (2021) - [c225]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Vertex-Weighted Graph Realizations. CIAC 2021: 90-102 - [c224]Amotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel:
Selected Neighbor Degree Forest Realization. ISAAC 2021: 27:1-27:15 - [c223]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz:
Relaxed and Approximate Graph Realizations. IWOCA 2021: 3-19 - [c222]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Composed Degree-Distance Realizations of Graphs. IWOCA 2021: 63-77 - [c221]Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan:
Budgeted Dominating Sets in Uncertain Graphs. MFCS 2021: 32:1-32:22 - [c220]Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg:
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2021: 1 - [c219]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted Microscopic Image Reconstruction. SOFSEM 2021: 373-386 - [c218]Shay Kutten
Singularly Near Optimal Leader Election in Asynchronous Networks. DISC 2021: 27:1-27:18 - [i33]Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan:
Budgeted Dominating Sets in Uncertain Graphs. CoRR abs/2107.03020 (2021) - [i32]Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg:
Singularly Near Optimal Leader Election in Asynchronous Networks. CoRR abs/2108.02197 (2021) - 2020
- [j178]Merav Parter, David Peleg:
Fault Tolerant Approximate BFS Structures with Additive Stretch. Algorithmica 82(12): 3458-3491 (2020) - [j177]Susanne Albers, Nikhil Bansal, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, David Peleg, Vladimiro Sassone, Alexandra Silva:
EATCS Distinguished Dissertation Award 2020 - Call for Nominations. Bull. EATCS 132 (2020) - [j176]Amotz Bar-Noy, Keerti Choudhary
Efficiently Realizing Interval Sequences. SIAM J. Discret. Math. 34(4): 2318-2337 (2020) - [j175]Amotz Bar-Noy, David Peleg, Dror Rawitz:
Vertex-weighted realizations of graphs. Theor. Comput. Sci. 807: 56-72 (2020) - [j174]Gopal Pandurangan
Message lower bounds via efficient network synchronization. Theor. Comput. Sci. 810: 82-95 (2020) - [j173]Tal Navon, David Peleg:
Mixed fault tolerance in server assignment: Combining reinforcement and backup. Theor. Comput. Sci. 836: 76-93 (2020) - [c217]Amotz Bar-Noy, Keerti Choudhary
Minimum Neighboring Degree Realization in Graphs and Trees. ESA 2020: 10:1-10:15 - [c216]John Augustine, Keerti Choudhary
Distributed Graph Realizations †. IPDPS 2020: 158-167 - [c215]Amotz Bar-Noy, Keerti Choudhary
Graph Realizations: Maximum Degree in Vertex Neighborhoods. SWAT 2020: 10:1-10:17 - [c214]Shay Kutten
Singularly Optimal Randomized Leader Election. DISC 2020: 22:1-22:18 - [i31]John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav:
Distributed Graph Realizations. CoRR abs/2002.05376 (2020) - [i30]Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg:
Singularly Optimal Randomized Leader Election. CoRR abs/2008.02782 (2020)
2010 – 2019
- 2019
- [j172]Christoph Lenzen, Boaz Patt-Shamir, David Peleg:
Distributed distance computation and routing with small messages. Distributed Comput. 32(2): 133-157 (2019) - [j171]David Peleg, Susanne Albers, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, Vladimiro Sassone:
EATCS Distinguished Dissertation Award 2019 - Call for Nominations. Bull. EATCS 129 (2019) - [c213]Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg:
Random preferential attachment hypergraph. ASONAM 2019: 398-405 - [c212]Chen Avin
Majority vote and monopolies in social networks. ICDCN 2019: 342-351 - [c211]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The Generalized Microscopic Image Reconstruction Problem. ISAAC 2019: 42:1-42:15 - [c210]Amotz Bar-Noy, Keerti Choudhary
Efficiently Realizing Interval Sequences. ISAAC 2019: 47:1-47:15 - [c209]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Profile Realizations and Applications to Social Networks. WALCOM 2019: 3-14 - [c208]Avi Cohen, David Peleg:
Hotelling Games with Random Tolerance Intervals. WINE 2019: 114-128 - [i29]Avi Cohen, David Peleg:
Hotelling Games with Multiple Line Faults. CoRR abs/1907.06602 (2019) - [i28]Avi Cohen, David Peleg:
Hotelling Games with Random Tolerance Intervals. CoRR abs/1909.11558 (2019) - [i27]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods. CoRR abs/1912.13286 (2019) - [i26]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. CoRR abs/1912.13287 (2019) - 2018
- [j170]Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan:
Improved approximation algorithms for weighted 2-path partitions. Discret. Appl. Math. 239: 15-37 (2018) - [j169]David Peleg:
EATCS Distinguished Dissertation Award 2018 - Call for Nominations. Bull. EATCS 126 (2018) - [j168]Merav Parter
Fault-Tolerant Approximate BFS Structures. ACM Trans. Algorithms 14(1): 10:1-10:15 (2018) - [j167]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The topology of wireless communication on a line. Theor. Comput. Sci. 711: 105-108 (2018) - [c207]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Realizability of Graph Specifications: Characterizations and Algorithms. SIROCCO 2018: 3-13 - [c206]Tal Navon, David Peleg:
Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup. SIROCCO 2018: 249-263 - [c205]Shirel Attali, Merav Parter, David Peleg, Shay Solomon:
Wireless Expanders. SPAA 2018: 13-22 - [c204]Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg:
Preferential Attachment as a Unique Equilibrium. WWW 2018: 559-568 - [i25]Chen Avin, Avi Cohen, Zvi Lotker, David Peleg:
Fault-Tolerant Hotelling Games. CoRR abs/1801.04669 (2018) - [i24]Shirel Attali, Merav Parter, David Peleg, Shay Solomon:
Wireless Expanders. CoRR abs/1802.07177 (2018) - 2017
- [j166]Chen Avin
SINR diagram with interference cancellation. Ad Hoc Networks 54: 1-16 (2017) - [j165]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. Algorithmica 79(3): 708-741 (2017) - [j164]Chen Avin
Distributed computing on core-periphery networks: Axiom-based design. J. Parallel Distributed Comput. 99: 51-67 (2017) - [c203]Zvi Lotker, David Peleg:
The Effect of Population Control Policies on Societal Fragmentation. ASONAM 2017: 9-16 - [c202]Chen Avin
Assortative Mixing Equilibria in Social Network Games. GAMENETS 2017: 29-39 - [c201]Mor Sinay, Noa Agmon, Oleg Maksimov, Sarit Kraus, David Peleg:
Maintaining Communication in Multi-Robot Tree Coverage. IJCAI 2017: 4515-4522 - [c200]Chen Avin
Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks. KDD 2017: 45-53 - [i23]Zvi Lotker, David Peleg:
The Effect of Population Control Policies on Societal Fragmentation. CoRR abs/1703.05974 (2017) - [i22]Chen Avin, Hadassa Daltrophe, Zvi Lotker, David Peleg:
Assortative Mixing Equilibria in Social Network Games. CoRR abs/1703.08776 (2017) - 2016
- [j163]Erez Kantor, David Peleg
Efficient k-shot broadcasting in radio networks. Discret. Appl. Math. 202: 79-94 (2016) - [j162]Yuval Emek, Erez Kantor, David Peleg:
On the effect of the deployment setting on broadcasting in Euclidean radio networks. Distributed Comput. 29(6): 409-434 (2016) - [j161]Bernhard Haeupler
Discovery Through Gossip. Random Struct. Algorithms 48(3): 565-587 (2016) - [j160]Chen Avin
On social networks of program committees - Structure and effect on paper acceptance fairness. Soc. Netw. Anal. Min. 6(1): 18:1-18:20 (2016) - [j159]Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg:
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. ACM Trans. Algorithms 12(2): 22:1-22:17 (2016) - [j158]Merav Parter, David Peleg:
Sparse Fault-Tolerant BFS Structures. ACM Trans. Algorithms 13(1): 11:1-11:24 (2016) - [c199]Gopal Pandurangan
Message Lower Bounds via Efficient Network Synchronization. SIROCCO 2016: 75-91 - [c198]Merav Parter, David Peleg, Shay Solomon:
Local-on-Average Distributed Tasks. SODA 2016: 220-239 - [c197]David Peleg, Shay Solomon:
Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach. SODA 2016: 712-729 - [i21]Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg, Yuval Emek:
Notions of Connectivity in Overlay Networks. CoRR abs/1601.01104 (2016) - [i20]Neta Marcus, David Peleg:
The Domination Game: Proving the 3/5 Conjecture on Isolate-Free Forests. CoRR abs/1603.01181 (2016) - 2015
- [j157]Gilad Braunschvig, Alon Brutzkus, David Peleg, Adam Sealfon:
Truth tellers and liars with fewer questions. Discret. Math. 338(8): 1310-1316 (2015) - [j156]Fedor V. Fomin
40th international colloquium on automata, languages and programming. Inf. Comput. 243: 1 (2015) - [j155]Shay Kutten, Gopal Pandurangan
On the Complexity of Universal Leader Election. J. ACM 62(1): 7:1-7:27 (2015) - [j154]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The Topology of Wireless Communication. J. ACM 62(5): 37:1-37:32 (2015) - [j153]Shay Kutten, Gopal Pandurangan
Sublinear bounds for randomized leader election. Theor. Comput. Sci. 561: 134-143 (2015) - [j152]Shiri Chechik, David Peleg:
The fault-tolerant capacitated K-center problem. Theor. Comput. Sci. 566: 12-25 (2015) - [j151]Gilad Braunschvig, Shiri Chechik, David Peleg, Adam Sealfon:
Fault tolerant additive and (μ, α)-spanners. Theor. Comput. Sci. 580: 94-100 (2015) - [c196]Merav Parter, David Peleg:
On the Relations Between SINR Diagrams and Voronoi Diagrams. ADHOC-NOW 2015: 225-237 - [c195]Chen Avin
Social Network Analysis of Program Committees and Paper Acceptance Fairness. ASONAM 2015: 488-495 - [c194]Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan:
Improved Approximation Algorithms for Weighted 2-Path Partitions. ESA 2015: 953-964 - [c193]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. FOCS 2015: 330-349 - [c192]Chen Avin
Core Size and Densification in Preferential Attachment Networks. ICALP (2) 2015: 492-503 - [c191]Chen Avin
Homophily and the Glass Ceiling Effect in Social Networks. ITCS 2015: 41-50 - [c190]Leonid Barenboim, David Peleg:
Nearly Optimal Local Broadcasting in the SINR Model with Feedback. SIROCCO 2015: 164-178 - [c189]Merav Parter, David Peleg:
Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. SPAA 2015: 264-273 - [c188]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Nonuniform SINR+Voroni Diagrams Are Effectively Uniform. DISC 2015: 588-601 - [i19]Chen Avin, Zvi Lotker, David Peleg:
Random Preferential Attachment Hypergraphs. CoRR abs/1502.02401 (2015) - [i18]Merav Parter, David Peleg:
Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. CoRR abs/1504.04169 (2015) - [i17]Liah Kor, Amos Korman, David Peleg:
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. CoRR abs/1512.04832 (2015) - 2014
- [j150]Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg:
Randomized distributed decision. Distributed Comput. 27(6): 419-434 (2014) - [j149]Chen Avin
Testing the irreducibility of nonsquare Perron-Frobenius systems. Inf. Process. Lett. 114(12): 728-733 (2014) - [j148]Yoann Dieudonné, Andrzej Pelc, David Peleg:
Gathering Despite Mischief. ACM Trans. Algorithms 11(1): 1:1-1:28 (2014) - [j147]Shiri Chechik, David Peleg:
Robust fault tolerant uncapacitated facility location. Theor. Comput. Sci. 543: 9-23 (2014) - [c187]David Peleg:
Immunity against Local Influence. Language, Culture, Computation (1) 2014: 168-179 - [c186]Barbara Keller, David Peleg, Roger Wattenhofer:
How Even Tiny Influence Can Have a Big Impact! FUN 2014: 252-263 - [c185]Chen Avin
Distributed Computing on Core-Periphery Networks: Axiom-Based Design. ICALP (2) 2014: 399-410 - [c184]Merav Parter, David Peleg:
Fault Tolerant Approximate BFS Structures. SODA 2014: 1073-1092 - [c183]Stephan Holzer, David Peleg, Liam Roditty, Roger Wattenhofer:
Distributed 3/2-Approximation of the Diameter. DISC 2014: 562-564 - [i16]Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg:
Distributed Computing on Core-Periphery Networks: Axiom-based Design. CoRR abs/1404.6561 (2014) - [i15]Merav Parter, David Peleg:
Fault Tolerant Approximate BFS Structures. CoRR abs/1406.6169 (2014) - [i14]Chen Avin, Zvi Lotker, David Peleg, Yvonne-Anne Pignolet, Itzik Turkel:
Core-Periphery in Networks: An Axiomatic Approach. CoRR abs/1411.2242 (2014) - 2013
- [j146]David Peleg, Liam Roditty:
Relaxed Spanners for Directed Disk Graphs. Algorithmica 65(1): 146-158 (2013) - [j145]David Peleg, Ignasi Sau
On approximating the d-girth of a graph. Discret. Appl. Math. 161(16-17): 2587-2596 (2013) - [j144]David Peleg:
Special issue on DISC 2011. Distributed Comput. 26(4): 193 (2013) - [j143]Pierre Fraigniaud, Amos Korman, David Peleg:
Towards a complexity theory for local distributed computing. J. ACM 60(5): 35:1-35:26 (2013) - [j142]Liah Kor, Amos Korman, David Peleg:
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. Theory Comput. Syst. 53(2): 318-340 (2013) - [j141]David Peleg:
Prize for innovation in distributed computing: awarded to Roger Wattenhofer. SIGACT News 44(2): 89-91 (2013) - [c182]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. ESA 2013: 301-312 - [c181]Merav Parter, David Peleg:
Sparse Fault-Tolerant BFS Trees. ESA 2013: 779-790 - [c180]David Peleg:
Randomized Distributed Decision (Invited Lecture Abstract). FCT 2013: 3 - [c179]Shay Kutten, Gopal Pandurangan
Sublinear Bounds for Randomized Leader Election. ICDCN 2013: 348-362 - [c178]Shay Kutten, Gopal Pandurangan
On the complexity of universal leader election. PODC 2013: 100-109 - [c177]Christoph Lenzen, David Peleg:
Efficient distributed source detection with limited bandwidth. PODC 2013: 375-382 - [c176]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. SODA 2013: 478-497 - [e6]Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg:
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Lecture Notes in Computer Science 7965, Springer 2013, ISBN 978-3-642-39205-4 [contents] - [e5]Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg:
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Lecture Notes in Computer Science 7966, Springer 2013, ISBN 978-3-642-39211-5 [contents] - [i13]Merav Parter, David Peleg:
Sparse Fault-Tolerant BFS Trees. CoRR abs/1302.5401 (2013) - [i12]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Generalized Perron-Frobenius Theorem for Nonsquare Matrices. CoRR abs/1308.5915 (2013) - [i11]Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
SINR Diagram with Interference Cancellation. CoRR abs/1309.3193 (2013) - 2012
- [j140]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica 63(4): 861-882 (2012) - [j139]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau
On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. 160(12): 1661-1679 (2012) - [j138]Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg:
Sparse reliable graph backbones. Inf. Comput. 210: 31-39 (2012) - [j137]Chen Avin
SINR Diagrams: Convexity and Its Applications in Wireless Networks. J. ACM 59(4): 18:1-18:34 (2012) - [j136]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan
Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. 41(5): 1235-1265 (2012) - [c175]David Peleg, Liam Roditty, Elad Tal:
Distributed Algorithms for Network Diameter and Girth. ICALP (2) 2012: 660-672 - [c174]Shiri Chechik, Quentin Godfroy, David Peleg:
Multipath Spanners via Fault-Tolerant Spanners. MedAlg 2012: 108-119 - [c173]Shiri Chechik, David Peleg:
The Fault Tolerant Capacitated k-Center Problem. SIROCCO 2012: 13-24 - [c172]Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg:
Notions of Connectivity in Overlay Networks. SIROCCO 2012: 25-35 - [c171]Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
SINR diagram with interference cancellation. SODA 2012: 502-515 - [c170]Yoann Dieudonné, Andrzej Pelc, David Peleg:
Gathering despite mischief. SODA 2012: 527-540 - [c169]Bernhard Haeupler
Discovery through gossip. SPAA 2012: 140-149 - [c168]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg:
Randomized Distributed Decision. DISC 2012: 371-385 - [c167]David Peleg:
Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance. WG 2012: 2 - [c166]Gilad Braunschvig, Shiri Chechik, David Peleg:
Fault Tolerant Additive Spanners. WG 2012: 206-214 - [i10]Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery through Gossip. CoRR abs/1202.2092 (2012) - [i9]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg:
Randomized Distributed Decision. CoRR abs/1207.0252 (2012) - [i8]Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
Sublinear Bounds for Randomized Leader Election. CoRR abs/1210.4822 (2012) - [i7]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. CoRR abs/1212.6176 (2012) - 2011
- [j135]Oren Weimann
A note on exact distance labeling. Inf. Process. Lett. 111(14): 671-673 (2011) - [c165]Pierre Fraigniaud, Amos Korman, David Peleg:
Local Distributed Decision. FOCS 2011: 708-717 - [c164]Zvi Lotker, Merav Parter, David Peleg, Yvonne-Anne Pignolet:
Distributed power control in the SINR model. INFOCOM 2011: 2525-2533 - [c163]David Peleg:
SINR Maps: Properties and Applications. SIROCCO 2011: 15-16 - [c162]David Peleg, Ignasi Sau
On Approximating the d-Girth of a Graph. SOFSEM 2011: 467-481 - [c161]Liah Kor, Amos Korman, David Peleg:
Tight Bounds For Distributed MST Verification. STACS 2011: 69-80 - [c160]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan
Distributed verification and hardness of distributed approximation. STOC 2011: 363-372 - [c159]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The topology of wireless communication. STOC 2011: 383-392 - [e4]David Peleg:
Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings. Lecture Notes in Computer Science 6950, Springer 2011, ISBN 978-3-642-24099-7 [contents] - [i6]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The Topology of Wireless Communication. CoRR abs/1103.4566 (2011) - 2010
- [j134]Amos Korman, David Peleg, Yoav Rodeh:
Constructing Labeling Schemes through Universal Matrices. Algorithmica 57(4): 641-652 (2010) - [j133]Amos Korman, Shay Kutten, David Peleg:
Proof labeling schemes. Distributed Comput. 22(4): 215-233 (2010) - [j132]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
Fault Tolerant Spanners for General Graphs. SIAM J. Comput. 39(7): 3403-3423 (2010) - [j131]Zvi Lotker, David Peleg:
Structure and algorithms in the SINR wireless model. SIGACT News 41(2): 74-84 (2010) - [j130]Yuval Emek, David Peleg, Liam Roditty:
A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Trans. Algorithms 6(4): 64:1-64:13 (2010) - [j129]David Adjiashvili, David Peleg:
Equal-area locus-based convex polygon decomposition. Theor. Comput. Sci. 411(14-15): 1648-1667 (2010) - [j128]David Peleg, Liam Roditty:
Localized spanner construction for ad hoc networks with variable transmission range. ACM Trans. Sens. Networks 7(3): 25:1-25:14 (2010) - [c158]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. ESA (1) 2010: 84-96 - [c157]Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg:
Sparse Reliable Graph Backbones. ICALP (2) 2010: 261-272 - [c156]Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg:
Forbidden-set distance labels for graphs of bounded doubling dimension. PODC 2010: 192-200 - [c155]Shiri Chechik, David Peleg:
Robust Fault Tolerant Uncapacitated Facility Location. STACS 2010: 191-202 - [c154]David Peleg, Liam Roditty:
Relaxed Spanners for Directed Disk Graphs. STACS 2010: 609-620 - [c153]Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty:
Realtime Classification for Encrypted Traffic. SEA 2010: 373-385 - [p1]David Peleg, Tomasz Radzik:
Time-Efficient Broadcast in Radio Networks. Graphs and Algorithms in Communication Networks 2010: 311-334 - [e3]Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe
SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings. Lecture Notes in Computer Science 5901, Springer 2010, ISBN 978-3-642-11265-2 [contents] - [i5]Pierre Fraigniaud, Amos Korman, David Peleg:
Local Distributed Decision. CoRR abs/1011.2152 (2010) - [i4]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer:
Distributed Verification and Hardness of Distributed Approximation. CoRR abs/1011.3049 (2010)
2000 – 2009
- 2009
- [j127]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) - [j126]Reuven Cohen
Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009) - [j125]Nissan Lev-Tov, David Peleg:
Conflict-free coloring of unit disks. Discret. Appl. Math. 157(7): 1521-1532 (2009) - [j124]Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su:
Broadcasting in UDG radio networks with unknown topology. Distributed Comput. 21(5): 331-351 (2009) - [j123]Erez Kantor, David Peleg:
Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems. J. Discrete Algorithms 7(3): 341-362 (2009) - [j122]Yuval Emek, David Peleg:
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs. SIAM J. Discret. Math. 23(4): 1827-1841 (2009) - [j121]Asaf Efrima, David Peleg:
Distributed algorithms for partitioning a swarm of autonomous mobile robots. Theor. Comput. Sci. 410(14): 1355-1368 (2009) - [c152]Chen Avin
SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC 2009: 200-209 - [c151]David Peleg:
As Good as It Gets: Competitive Fault Tolerance in Network Structures. SSS 2009: 35-46 - [c150]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
Fault-tolerant spanners for general graphs. STOC 2009: 435-444 - [c149]Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot:
Local Computation of Nearly Additive Spanners. DISC 2009: 176-190 - [c148]Erez Kantor, David Peleg:
Efficient k-Shot Broadcasting in Radio Networks. DISC 2009: 481-495 - [c147]Shiri Chechik, David Peleg:
Low-Port Tree Representations. WG 2009: 66-76 - [i3]David Peleg, Liam Roditty:
Relaxed spanners for directed disk graphs. CoRR abs/0912.2815 (2009) - [i2]Shiri Chechik, David Peleg:
Robust Fault Tolerant uncapacitated facility location. CoRR abs/0912.3188 (2009) - 2008
- [j120]Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su:
Time efficient k-shot broadcasting in known topology radio networks. Distributed Comput. 21(2): 117-127 (2008) - [j119]Amos Korman, David Peleg:
Compact separator decompositions in dynamic trees and applications to labeling schemes. Distributed Comput. 21(2): 141-161 (2008) - [j118]Reuven Cohen
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. SIAM J. Comput. 38(1): 276-302 (2008) - [j117]Yuval Emek, David Peleg:
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs. SIAM J. Comput. 38(5): 1761-1781 (2008) - [j116]Amos Korman, David Peleg:
Dynamic routing schemes for graphs with low local density. ACM Trans. Algorithms 4(4): 41:1-41:18 (2008) - [j115]Reuven Cohen
Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4(4): 42:1-42:18 (2008) - [j114]Reuven Cohen
Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 399(1-2): 71-82 (2008) - [c146]David Peleg, Liam Roditty:
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. ADHOC-NOW 2008: 135-147 - [c145]David Peleg:
Towards Networked Computers: What Can Be Learned from Distributed Computing?. HiPC 2008: 2 - [c144]Yuval Emek, Erez Kantor, David Peleg:
On the effect of the deployment setting on broadcasting in Euclidean radio networks. PODC 2008: 223-232 - [c143]Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot:
On the locality of distributed sparse spanner construction. PODC 2008: 273-282 - [c142]David Adjiashvili, David Peleg:
Equal-Area Locus-Based Convex Polygon Decomposition. SIROCCO 2008: 141-155 - [c141]Yuval Emek, David Peleg, Liam Roditty:
A near-linear time algorithm for computing replacement paths in planar directed graphs. SODA 2008: 428-435 - [c140]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42 - [i1]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) - 2007
- [j113]Shay Kutten, David Peleg:
Asynchronous resource discovery in peer-to-peer networks. Comput. Networks 51(1): 190-206 (2007) - [j112]Tamar Eilam, Cyril Gavoille, David Peleg:
Average stretch analysis of compact routing schemes. Discret. Appl. Math. 155(5): 598-610 (2007) - [j111]Leszek Gasieniec, David Peleg, Qin Xin:
Faster communication in known topology radio networks. Distributed Comput. 19(4): 289-300 (2007) - [j110]Amos Korman, David Peleg:
Labeling schemes for weighted dynamic trees. Inf. Comput. 205(12): 1721-1740 (2007) - [j109]David Peleg:
Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems. J. Discrete Algorithms 5(1): 55-64 (2007) - [j108]Michael Elkin, David Peleg:
The Hardness of Approximating Spanner Problems. Theory Comput. Syst. 41(4): 691-729 (2007) - [j107]Andrzej Pelc, David Peleg:
Feasibility and complexity of broadcasting with random transmission failures. Theor. Comput. Sci. 370(1-3): 279-292 (2007) - [j106]Rachel Matichin, David Peleg:
Approximation algorithm for hotlink assignment in the greedy model. Theor. Comput. Sci. 383(1): 102-110 (2007) - [j105]Andrzej Pelc, David Peleg, Michel Raynal:
Preface. Theor. Comput. Sci. 384(2-3): 137-138 (2007) - [j104]Ornan Ori Gerstel, Shay Kutten, Eduardo Sany Laber, Rachel Matichin, David Peleg, Artur Alves Pessoa
Reducing human interactions in Web directory searches. ACM Trans. Inf. Syst. 25(4): 20 (2007) - [c139]David Peleg:
Time-Efficient Broadcasting in Radio Networks: A Review. ICDCIT 2007: 1-18 - [c138]Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su:
Broadcasting in udg radio networks with unknown topology. PODC 2007: 195-204 - [c137]Asaf Efrima, David Peleg:
Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots. SIROCCO 2007: 180-194 - [c136]Asaf Efrima, David Peleg:
Distributed Models and Algorithms for Mobile Robot Systems. SOFSEM (1) 2007: 70-87 - [c135]David Peleg:
Time-Efficient Broadcasting in Radio Networks. DISC 2007: 3-4 - [c134]Bilel Derbel, Cyril Gavoille, David Peleg:
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. DISC 2007: 179-192 - [c133]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 - [c132]Amos Korman, David Peleg:
Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. DISC 2007: 313-327 - 2006
- [j103]Zvi Lotker, Boaz Patt-Shamir, David Peleg:
Distributed MST for constant diameter graphs. Distributed Comput. 18(6): 453-460 (2006) - [j102]Yehuda Hassin
Average probe complexity in quorum systems. J. Comput. Syst. Sci. 72(4): 592-616 (2006) - [j101]Noa Agmon, David Peleg:
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots. SIAM J. Comput. 36(1): 56-82 (2006) - [c131]David Peleg:
Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks. CAAN 2006: 1-4 - [c130]Erez Kantor, David Peleg:
Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems. CIAC 2006: 211-222 - [c129]Amos Korman, David Peleg:
Dynamic Routing Schemes for General Graphs. ICALP (1) 2006: 619-630 - [c128]Amos Korman, David Peleg, Yoav Rodeh:
Constructing Labeling Schemes Through Universal Matrices. ISAAC 2006: 409-418 - [c127]Reuven Cohen
Local Algorithms for Autonomous Robot Systems. SIROCCO 2006: 29-43 - [c126]Yuval Emek, David Peleg:
A tight upper bound on the probabilistic embedding of series-parallel graphs. SODA 2006: 1045-1053 - [c125]Reuven Cohen
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. STACS 2006: 549-560 - 2005
- [j100]Nissan Lev-Tov, David Peleg:
Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Networks 47(4): 489-501 (2005) - [j99]Michal Katz, Nir A. Katz, David Peleg:
Distance labeling schemes for well-separated graph classes. Discret. Appl. Math. 145(3): 384-402 (2005) - [j98]Andrzej Pelc, David Peleg:
Broadcasting with locally bounded Byzantine faults. Inf. Process. Lett. 93(3): 109-115 (2005) - [j97]David Peleg, Uri Pincas:
Virtual path layouts optimizing total hop count on ATM tree networks. J. Discrete Algorithms 3(1): 101-112 (2005) - [j96]Reuven Cohen
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. SIAM J. Comput. 34(6): 1516-1528 (2005) - [j95]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) - [j94]David Peleg, Jop F. Sibeyn:
Preface: Structural Information and Communication Complexity. Theor. Comput. Sci. 333(3): 329-330 (2005) - [j93]Michael Elkin, David Peleg:
Approximating k-spanner problems for kge2. Theor. Comput. Sci. 337(1-3): 249-277 (2005) - [j92]David Peleg:
Informative labeling schemes for graphs. Theor. Comput. Sci. 340(3): 577-593 (2005) - [j91]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) - [c124]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346 - [c123]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle:
Adaptive Collaboration in Peer-to-Peer Systems. ICDCS 2005: 71-80 - [c122]David Peleg:
Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges. IWDC 2005: 1-12 - [c121]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Labeling Schemes for Tree Representation. IWDC 2005: 13-24 - [c120]David Peleg:
Distributed Algorithms for Systems of Autonomous Mobile Robots. OPODIS 2005: 1 - [c119]Amos Korman, Shay Kutten, David Peleg:
Proof labeling schemes. PODC 2005: 9-18 - [c118]Leszek Gasieniec, David Peleg, Qin Xin:
Faster communication in known topology radio networks. PODC 2005: 129-137 - [c117]Andrzej Pelc, David Peleg:
Feasibility and complexity of broadcasting with random transmission failures. PODC 2005: 334-341 - [c116]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle:
Improved recommendation systems. SODA 2005: 1174-1183 - [c115]Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane
Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS 2005: 125-130 - 2004
- [j90]Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
Distance labeling in graphs. J. Algorithms 53(1): 85-112 (2004) - [j89]Amos Korman, David Peleg, Yoav Rodeh:
Labeling Schemes for Dynamic Tree Networks. Theory Comput. Syst. 37(1): 49-75 (2004) - [j88]Michael Elkin, David Peleg:
(1+epsilon, beta)-Spanner Constructions for General Graphs. SIAM J. Comput. 33(3): 608-631 (2004) - [j87]Michal Katz, Nir A. Katz, Amos Korman, David Peleg:
Labeling Schemes for Flow and Connectivity. SIAM J. Comput. 34(1): 23-40 (2004) - [c114]Reuven Cohen, David Peleg:
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. ESA 2004: 228-239 - [c113]Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg:
Graph Exploration by a Finite Automaton. MFCS 2004: 451-462 - [c112]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle:
Collaboration of untrusting peers with changing interests. EC 2004: 112-119 - [c111]Reuven Cohen, David Peleg:
Robot Convergence via Center-of-Gravity Algorithms. SIROCCO 2004: 79-88 - [c110]Rachel Matichin, David Peleg:
Approximation Algorithm for Hotlink Assignment in the Greedy Model. SIROCCO 2004: 233-244 - [c109]Yuval Emek, David Peleg:
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. SODA 2004: 261-270 - [c108]Noa Agmon, David Peleg:
Fault-tolerant gathering algorithms for autonomous mobile robots. SODA 2004: 1070-1078 - [c107]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 - 2003
- [j86]Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes:
The Power of Small Coalitions in Graphs. Discret. Appl. Math. 127(3): 399-414 (2003) - [j85]Cyril Gavoille, David Peleg:
Compact and localized distributed data structures. Distributed Comput. 16(2-3): 111-120 (2003) - [j84]Tamar Eilam, Cyril Gavoille, David Peleg:
Compact routing schemes with low stretch factor. J. Algorithms 46(2): 97-114 (2003) - [j83]Shay Kutten, David Peleg, Uzi Vishkin:
Deterministic Resource Discovery in Distributed Networks. Theory Comput. Syst. 36(5): 479-495 (2003) - [j82]Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes:
Directed virtual path layouts in ATM networks. Theor. Comput. Sci. 291(1): 3-28 (2003) - [c106]David Peleg:
Localized Network Representations. CIAC 2003: 1 - [c105]David Peleg:
Spanning Trees with Low Maximum/Average Stretch. CIAC 2003: 6 - [c104]Amos Korman, David Peleg:
Labeling Schemes for Weighted Dynamic Trees. ICALP 2003: 369-383 - [c103]Ornan Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg:
Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract). ISAAC 2003: 68-77 - [c102]Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg:
MST construction in O(log log n) communication rounds. SPAA 2003: 94-100 - [c101]Rachel Matichin, David Peleg:
Approximation Algorithm for Hotlink Assignments in Web Directories. WADS 2003: 271-280 - 2002
- [j81]Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg:
Station Layouts in the Presence of Location Constraints. J. Interconnect. Networks 3(1-2): 1-17 (2002) - [j80]David Peleg, Avishai Wool
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems. SIAM J. Discret. Math. 15(3): 416-433 (2002) - [j79]David Peleg:
Local majorities, coalitions and monopolies in graphs: a review. Theor. Comput. Sci. 282(2): 231-257 (2002) - [j78]Limor Drori, David Peleg:
Faster exact solutions for some NP-hard problems. Theor. Comput. Sci. 287(2): 473-499 (2002) - [c100]David Peleg:
Low Stretch Spanning Trees. MFCS 2002: 68-80 - [c99]Michal Katz, Nir A. Katz, Amos Korman, David Peleg:
Labeling schemes for flow and connectivity. SODA 2002: 927-936 - [c98]Shay Kutten, David Peleg:
Asynchronous Resource Discovery in Peer to Peer Networks. SRDS 2002: 224-231 - [c97]Amos Korman, David Peleg, Yoav Rodeh:
Labeling Schemes for Dynamic Tree Networks. STACS 2002: 76-87 - [c96]Nissan Lev-Tov, David Peleg:
Exact Algorithms and Approximation Schemes for Base Station Placement Problems. SWAT 2002: 90-99 - 2001
- [j77]Uriel Feige, Guy Kortsarz, David Peleg:
The Dense k-Subgraph Problem. Algorithmica 29(3): 410-421 (2001) - [j76]Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
Assigning labels in an unknown anonymous network with a leader. Distributed Comput. 14(3): 163-183 (2001) - [j75]Yehuda Hassin
Sparse communication networks and efficient routing in the plane. Distributed Comput. 14(4): 205-215 (2001) - [j74]Yehuda Hassin
Distributed Probabilistic Polling and Applications to Proportionate Agreement. Inf. Comput. 171(2): 248-268 (2001) - [j73]David Peleg, Eilon Reshef:
Low Complexity Variants of the Arrow Distributed Directory. J. Comput. Syst. Sci. 63(3): 474-485 (2001) - [j72]Cyril Gavoille, David Peleg:
The Compactness of Interval Routing for Almost All Graphs. SIAM J. Comput. 31(3): 706-721 (2001) - [j71]Leszek Gasieniec, Andrzej Pelc, David Peleg:
The Wakeup Problem in Synchronous Broadcast Systems. SIAM J. Discret. Math. 14(2): 207-222 (2001) - [j70]Judit Bar-Ilan, Guy Kortsarz, David Peleg:
Generalized submodular cover problems and applications. Theor. Comput. Sci. 250(1-2): 179-200 (2001) - [c95]Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg:
Approximate Distance Labeling Schemes. ESA 2001: 476-487 - [c94]Michael Elkin, David Peleg:
Approximating k-Spanner Problems for k>2. IPCO 2001: 90-104 - [c93]Zvi Lotker, Boaz Patt-Shamir, David Peleg:
Distributed MST for constant diameter graphs. PODC 2001: 63-71 - [c92]Yehuda Hassin
Average probe complexity in quorum systems. PODC 2001: 180-189 - [c91]Michael Elkin, David Peleg:
The Client-Server 2-Spanner Problem with Applications to Network Design. SIROCCO 2001: 117-132 - [c90]Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz
Distance labeling in graphs. SODA 2001: 210-219 - [c89]Shay Kutten, David Peleg, Uzi Vishkin:
Deterministic resource discovery in distributed networks. SPAA 2001: 77-83 - [c88]Michael Elkin, David Peleg:
(1+epsilon, beta)-spanner constructions for general graphs. STOC 2001: 173-182 - [c87]David Peleg, Uri Pincas:
The Average Hop Count Measure for Virtual Path Layouts. DISC 2001: 255-269 - [c86]Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena:
Small k-Dominating Sets in Planar Graphs with Applications. WG 2001: 201-216 - 2000
- [j69]Riccardo Focardi
Feedback vertex set in hypercubes. Inf. Process. Lett. 76(1-2): 1-5 (2000) - [j68]David Peleg:
Proximity-preserving labeling schemes. J. Graph Theory 33(3): 167-176 (2000) - [j67]Shay Kutten, David Peleg:
Tight Fault Locality. SIAM J. Comput. 30(1): 247-268 (2000) - [j66]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) - [c85]Michael Elkin, David Peleg:
Strong Inapproximability of the Basic k-Spanner Problem. ICALP 2000: 636-647 - [c84]David Peleg:
Informative Labeling Schemes for Graphs. MFCS 2000: 579-588 - [c83]Yehuda Hassin
Sparse communication networks and efficient routing in the plane (extended abstract). PODC 2000: 41-50 - [c82]Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
Assigning labels in unknown anonymous networks (extended abstract). PODC 2000: 101-111 - [c81]Leszek Gasieniec, Andrzej Pelc, David Peleg:
The wakeup problem in synchronous broadcast systems (extended abstract). PODC 2000: 113-121 - [c80]Shay Kutten, David Peleg:
Deterministic distributed resource discovery (brief announcement). PODC 2000: 336 - [c79]Yehuda Hassin, David Peleg:
Extremal bounds for probabilistic polling in graphs. SIROCCO 2000: 167-180 - [c78]Michael Elkin, David Peleg:
The Hardness of Approximating Spanner Problems. STACS 2000: 370-381 - [c77]Michal Katz, Nir A. Katz, David Peleg:
Distance Labeling Schemes for Well-Separated Graph Classes. STACS 2000: 516-528 - [c76]David Peleg:
Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems. SWAT 2000: 220-230 - [c75]Yedidia Atzmony, David Peleg:
Distributed Algorithms for English Auctions. DISC 2000: 74-88
1990 – 1999
- 1999
- [j65]Guy Kortsarz, David Peleg:
Approximating the Weight of Shallow Steiner Trees. Discret. Appl. Math. 93(2-3): 265-285 (1999) - [j64]Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau:
Edge-disjoint spanners of complete graphs and complete digraphs. Discret. Math. 203(1-3): 133-159 (1999) - [j63]Shay Kutten, David Peleg:
Fault-Local Distributed Mending. J. Algorithms 30(1): 144-165 (1999) - [j62]Shlomi Dolev
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks. SIAM J. Comput. 29(3): 804-833 (1999) - [j61]Cyril Gavoille, David Peleg:
The Compactness of Interval Routing. SIAM J. Discret. Math. 12(4): 459-473 (1999) - [c74]Limor Drori, David Peleg:
Faster Exact Solutions for Some NP-Hard Problems. ESA 1999: 450-461 - [c73]David Peleg, Vitaly Rubinovich
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. FOCS 1999: 253-261 - [c72]Yehuda Hassin
Distributed Probabilistic Polling and Applications to Proportionate Agreement. ICALP 1999: 402-411 - [c71]David Peleg, Eilon Reshef:
A Variant of the Arrow Distributed Directory with Low Average Complexity. ICALP 1999: 615-624 - [c70]Prosenjit Bose
Station Layouts in the Presence of Location Constraints. ISAAC 1999: 269-278 - [c69]David Peleg:
Proximity-Preserving Labeling Schemes and Their Applications. WG 1999: 30-41 - 1998
- [j60]David Peleg:
Size Bounds for Dynamic Monopolies. Discret. Appl. Math. 86(2-3): 263-273 (1998) - [j59]Shay Kutten, David Peleg:
Fast Distributed Construction of Small k-Dominating Sets and Applications. J. Algorithms 28(1): 40-66 (1998) - [j58]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) - [j57]Guy Kortsarz, David Peleg:
Generating Low-Degree 2-Spanners. SIAM J. Comput. 27(5): 1438-1456 (1998) - [j56]Baruch Awerbuch, Bonnie Berger, Lenore Cowen
Near-Linear Time Construction of Sparse Neighborhood Covers. SIAM J. Comput. 28(1): 263-277 (1998) - [j55]Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg:
Optimal Broadcast with Partial Knowledge. SIAM J. Comput. 28(2): 511-524 (1998) - [j54]Evangelos Kranakis
Approximate Maxima Finding of Continuous Functions under Restricted Budget. Theor. Comput. Sci. 203(1): 151-162 (1998) - [c68]Yishay Mansour, David Peleg:
An approximation algorithm for minimum-cost network design. Robust Communication Networks: Interconnection and Survivability 1998: 97-106 - [c67]David Peleg:
Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees. ICALP 1998: 164-175 - [c66]David Peleg, Eilon Reshef:
Deterministic Polylog Approximation for Minimum Communication Spanning Trees. ICALP 1998: 670-681 - [c65]Tamar Eilam, Cyril Gavoille, David Peleg:
Compact Routing Schemes with Low Stretch Factor (Extended Abstract). PODC 1998: 11-20 - [c64]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 - [c63]Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes:
Directed Virtual Path Layouts in ATM Networks. DISC 1998: 75-88 - [c62]Cyril Gavoille, David Peleg:
The Compactness of Interval Routing for Almost All Graphs. DISC 1998: 161-174 - [e2]Luisa Gargano, David Peleg:
SIROCCO'98, 5th International Colloquium on Structural Information & Communication Complexity, Amalfi, Italy, June 22-24, 1998. Carleton Scientific 1998 [contents] - 1997
- [j53]David Peleg, Gideon Schechtman, Avishai Wool
Randomized Approximation of Bounded Multicovering Problems. Algorithmica 18(1): 44-66 (1997) - [j52]David Peleg, Avishai Wool
The Availability of Crumbling Wall Quorum Systems. Discret. Appl. Math. 74(1): 69-83 (1997) - [j51]David Peleg, Avishai Wool
Crumbling Walls: A Class of Practical and Efficient Quorum Systems. Distributed Comput. 10(2): 87-97 (1997) - [j50]Ron Holzman, Yosi Marcus, David Peleg:
Load Balancing in Quorum Systems. SIAM J. Discret. Math. 10(2): 223-245 (1997) - [c61]David Peleg:
Approximating Minimum Communication Spanning Trees. SIROCCO 1997: 1-11 - [c60]David Peleg:
Size Bounds for Dynamic Monopolies. SIROCCO 1997: 151-161 - [c59]Guy Kortsarz, David Peleg:
Approximating Shallow-Light Trees (Extended Abstract). SODA 1997: 103-110 - 1996
- [j49]Judit Bar-Ilan
Scheduling Jobs Using Common Resources. Inf. Comput. 125(1): 52-61 (1996) - [j48]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Fast Distributed Network Decompositions and Covers. J. Parallel Distributed Comput. 39(2): 105-114 (1996) - [c58]Judit Bar-Ilan, Guy Kortsarz, David Peleg:
Generalized Submodular Cover Problems and Applications. ISTCS 1996: 110-118 - [c57]Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg:
The Complexity of Data Mining on the Web (Abstract). PODC 1996: 153 - [c56]David Peleg, Avishai Wool:
How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract). PODC 1996: 290-299 - [c55]David Peleg:
Majority Voting, Coalitions and Monopolies in Graphs. SIROCCO 1996: 152-169 - [c54]Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes:
Tight Bounds on the Size of 2-Monopolies. SIROCCO 1996: 170-179 - [c53]Evangelos Kranakis
Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). WG 1996: 268-278 - 1995
- [j47]David Peleg:
On the maximum density of 0-1 matrices with no forbidden rectangles. Discret. Math. 140(1-3): 269-274 (1995) - [j46]Yosi Ben-Asher, Klaus-Jörn Lange, David Peleg, Assaf Schuster:
The Complexity of Reconfiguring Network Models. Inf. Comput. 121(1): 41-58 (1995) - [j45]David Peleg, Avishai Wool
The Availability of Quorum Systems. Inf. Comput. 123(2): 210-223 (1995) - [j44]Baruch Awerbuch, David Peleg:
Online Tracking of Mobile Users. J. ACM 42(5): 1021-1058 (1995) - [j43]David Peleg:
A Note on Optimal Time Broadcast in Faulty Hypercubes. J. Parallel Distributed Comput. 26(1): 132-136 (1995) - [j42]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) - [j41]Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg:
Greedy Packet Scheduling. SIAM J. Comput. 24(1): 148-157 (1995) - [j40]Guy Kortsarz, David Peleg:
Approximation Algorithms for Minimum-Time Broadcast. SIAM J. Discret. Math. 8(3): 401-427 (1995) - [c52]Shay Kutten, David Peleg:
Tight Fault Locality (Extended Abstract). FOCS 1995: 704-713 - [c51]Shay Kutten, David Peleg:
Fault-Local Distributed Mending (Extended Abstract). PODC 1995: 20-27 - [c50]David Peleg, Avishai Wool:
Crumbling Walls: A Class of Practical and Efficient Quorum Systems (Extended Abstract). PODC 1995: 120-129 - [c49]Shay Kutten, David Peleg:
Fast Distributed Construction of k-Dominating Sets and Applications. PODC 1995: 238-249 - [c48]Jean-Claude Bermond, David Peleg:
The Power of Small Coalitions in Graphs. SIROCCO 1995: 173-184 - [c47]Shlomi Dolev
Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract). STOC 1995: 528-537 - [c46]Ron Holzman, Yosi Marcus, David Peleg:
Load Balancing in Quorum Systems (Extended Abstract). WADS 1995: 38-49 - [c45]Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg:
Optimal Broadcast with Partial Knowledge (Extended Abstract). WDAG 1995: 116-130 - 1994
- [j39]Guy Kortsarz, David Peleg:
Traffic-light scheduling on the grid. Discret. Appl. Math. 53(1-3): 211-234 (1994) - [j38]Guy Kortsarz, David Peleg:
Generating Sparse 2-Spanners. J. Algorithms 17(2): 222-236 (1994) - [j37]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Low-Diameter Graph Decomposition Is in NC. Random Struct. Algorithms 5(3): 441-452 (1994) - [j36]Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal
Computing with Noisy Information. SIAM J. Comput. 23(5): 1001-1018 (1994) - [j35]Baruch Awerbuch, Shay Kutten, David Peleg:
On buffer-economical store-and-forward deadlock prevention. IEEE Trans. Commun. 42(11): 2934-2937 (1994) - [c44]Guy Kortsarz, David Peleg:
Generating Low-Degree 2-Spanners. SODA 1994: 556-563 - [e1]James H. Anderson, David Peleg, Elizabeth Borowsky:
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14-17, 1994. ACM 1994, ISBN 0-89791-654-9 [contents] - 1993
- [j34]David Peleg:
Distance-Dependent Distributed Directories. Inf. Comput. 103(2): 270-298 (1993) - [j33]Judit Bar-Ilan
How to Allocate Network Centers. J. Algorithms 15(3): 385-415 (1993) - [j32]Boaz Patt-Shamir, David Peleg:
Time-Space Tradeoffs for Set Operations. Theor. Comput. Sci. 110(1): 99-129 (1993) - [c43]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers. FOCS 1993: 638-647 - [c42]Juan A. Garay, Shay Kutten, David Peleg:
A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract). FOCS 1993: 659-668 - [c41]Guy Kortsarz, David Peleg:
On Choosing a Dense Subgraph (Extended Abstract). FOCS 1993: 692-701 - [c40]David Peleg, Gideon Schechtman, Avishai Wool:
Approximating Bounded 0-1 Integer Linear Programs. ISTCS 1993: 69-77 - [c39]Nathan Linial, David Peleg, Yuri Rabinovich, Michael E. Saks:
Sphere Packing and Local Majorities in Graphs. ISTCS 1993: 141-149 - 1992
- [j31]Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg:
Single Round Simulation on Radio Networks. J. Algorithms 13(2): 188-210 (1992) - [j30]Baruch Awerbuch, David Peleg:
Routing with Polynomial Communication-Space Trade-Off. SIAM J. Discret. Math. 5(2): 151-162 (1992) - [c38]Guy Kortsarz, David Peleg:
Approximation Algorithms for Minimum Time Broadcast. ISTCS 1992: 67-78 - [c37]Yosi Ben-Asher, David Peleg, Assaf Schuster:
The Complexity of Reconfiguring Network Models. ISTCS 1992: 79-90 - [c36]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Fast Network Decomposition (Extended Abstract). PODC 1992: 169-177 - [c35]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks:
Adapting to Asynchronous Dynamic Networks (Extended Abstract). STOC 1992: 557-570 - [c34]Baruch Awerbuch, Shay Kutten, David Peleg:
Competitive Distributed Job Scheduling (Extended Abstract). STOC 1992: 571-580 - [c33]Guy Kortsarz, David Peleg:
Generating Sparse 2-spanners. SWAT 1992: 73-82 - [c32]Baruch Awerbuch, Bonnie Berger, Lenore Cowen
Low-Diameter Graph Decomposition is in NC. SWAT 1992: 83-93 - [c31]Guy Kortsarz, David Peleg:
Traffic-Light Scheduling on the Grid (Extended Abstract). WDAG 1992: 238-252 - [c30]Judit Bar-Ilan
Distributed Resource Allocation Algorithms (Extended Abstract). WDAG 1992: 277-291 - 1991
- [j29]Amotz Bar-Noy, Danny Dolev
Fault-Tolerant Critical Section Management in Asynchronous Environments. Inf. Comput. 95(1): 1-20 (1991) - [j28]Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg:
A Lower Bound for Radio Broadcast. J. Comput. Syst. Sci. 43(2): 290-298 (1991) - [j27]Yosi Ben-Asher, David Peleg, Rajiv Ramaswami, Assaf Schuster:
The Power of Reconfiguration. J. Parallel Distributed Comput. 13(2): 139-153 (1991) - [j26]Michelangelo Grigni, David Peleg:
Tight Bounds on Minimum Broadcast Networks. SIAM J. Discret. Math. 4(2): 207-222 (1991) - [j25]Amotz Bar-Noy, David Peleg:
Square Meshes are not always Optimal. IEEE Trans. Computers 40(2): 196-204 (1991) - [c29]Noga Alon, Richard M. Karp, David Peleg, Douglas B. West:
A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract). On-Line Algorithms 1991: 1-10 - [c28]Yosi Ben-Asher, David Peleg, Rajiv Ramaswami, Assaf Schuster:
The POwer of Reconfiguration. ICALP 1991: 139-150 - [c27]Baruch Awerbuch, Shay Kutten, David Peleg:
On Buffer-Economical Store-and-Forward Deadlock Prevention. INFOCOM 1991: 410-414 - [c26]Karni Gilon, David Peleg:
Compact Deterministic Distributed Dictionaries (Extended Abstract). PODC 1991: 81-94 - [c25]Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg:
Broadcast with Partial Knowledge (Preliminary Version). PODC 1991: 153-163 - [c24]Baruch Awerbuch, Shay Kutten, David Peleg:
Efficient Deadlock-Free Routing. PODC 1991: 177-188 - [c23]Baruch Awerbuch, David Peleg:
Concurrent Online Tracking of Mobile Users. SIGCOMM 1991: 221-233 - [c22]Judit Bar-Ilan, David Peleg:
Approximation Algorithms for Selecting Network Centers (Preliminary Vesion). WADS 1991: 343-354 - 1990
- [j24]Baruch Awerbuch, Oded Goldreich
A Trade-Off between Information and Communication in Broadcast Protocols. J. ACM 37(2): 238-256 (1990) - [j23]Hagit Attiya
Renaming in an Asynchronous Environment. J. ACM 37(3): 524-548 (1990) - [j22]Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg:
Improved Routing Strategies with Succinct Tables. J. Algorithms 11(3): 307-341 (1990) - [j21]David Peleg:
Time-Optimal Leader Election in General Networks. J. Parallel Distributed Comput. 8(1): 96-99 (1990) - [j20]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
Randomized Broadcast in Networks. Random Struct. Algorithms 1(4): 447-460 (1990) - [j19]David Peleg, Eli Upfal
A Time-Randomness Trade-Off for Oblivious Routing. SIAM J. Comput. 19(2): 256-266 (1990) - [c21]Baruch Awerbuch, David Peleg:
Sparse Partitions (Extended Abstract). FOCS 1990: 503-513 - [c20]Baruch Awerbuch, David Peleg:
Network Synchronization with Polylogarithmic Overhead. FOCS 1990: 514-522 - [c19]Baruch Awerbuch, Alan E. Baratz, David Peleg:
Cost-Sensitive Analysis of Communication Protocols. PODC 1990: 177-187 - [c18]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms 1990: 128-137 - [c17]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Computing with Unreliable Information (Preliminary Version). STOC 1990: 128-137 - [c16]David Peleg:
Distributed Data Structures: A Complexity-Oriented View. WDAG 1990: 71-89 - [c15]Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg:
Greedy Packet Scheduling. WDAG 1990: 169-184
1980 – 1989
- 1989
- [j18]David Peleg, Eli Upfal
Constructng disjoint paths on expander graphs. Comb. 9(3): 289-313 (1989) - [j17]David Peleg, Eli Upfal
A trade-off between space and efficiency for routing tables. J. ACM 36(3): 510-530 (1989) - [j16]David Peleg, Alejandro A. Schäffer:
Graph spanners. J. Graph Theory 13(1): 99-116 (1989) - [j15]David Peleg, Allen Van Gelder:
Packet Distribution on a Ring. J. Parallel Distributed Comput. 6(3): 558-567 (1989) - [j14]David Peleg, Alejandro A. Schäffer:
Time bounds on fault-tolerant broadcasting. Networks 19(7): 803-822 (1989) - [j13]David Peleg, Eli Upfal
The Token Distribution Problem. SIAM J. Comput. 18(2): 229-243 (1989) - [j12]David Peleg, Jeffrey D. Ullman:
An Optimal Synchronizer for the Hypercube. SIAM J. Comput. 18(4): 740-747 (1989) - [c14]Amotz Bar-Noy, Danny Peleg:
Square Meshes Are Not Always Optimal. SPAA 1989: 138-147 - [c13]Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg:
On the Complexity of Radio Communication (Extended Abstract). STOC 1989: 274-285 - [c12]Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg:
Compact Distributed Data Structures for Adaptive Routing (Extended Abstract). STOC 1989: 479-489 - [c11]Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg:
Fault-Tolerant Critical Section Management in Asynchronous Networks. WDAG 1989: 13-23 - 1988
- [j11]Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. 17(5): 975-988 (1988) - [c10]Baruch Awerbuch, Oded Goldreich
A Tradeoff between Information and Communication in Broadcast Protocols. AWOC 1988: 369-379 - [c9]David Peleg, Eli Upfal
A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract). STOC 1988: 43-52 - [c8]Danny Krizanc, David Peleg, Eli Upfal
A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract). STOC 1988: 93-102 - 1987
- [j10]David Peleg, Barbara Simons:
On Fault Tolerant Routings in General Networks. Inf. Comput. 74(1): 33-49 (1987) - [j9]David Peleg:
Concurrent dynamic logic. J. ACM 34(2): 450-479 (1987) - [j8]David Peleg:
Communication in Concurrent Dynamic Logic. J. Comput. Syst. Sci. 35(1): 23-58 (1987) - [j7]David Peleg, Eli Upfal
The Generalized Packet Routing Problem. Theor. Comput. Sci. 53: 281-293 (1987) - [j6]David Peleg:
Concurrent Program Schemes and Their Logics. Theor. Comput. Sci. 55(1): 1-45 (1987) - [c7]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 - [c6]David Peleg, Jeffrey D. Ullman:
An Optimal Synchronizer for the Hypercube. PODC 1987: 77-85 - [c5]David Peleg, Eli Upfal:
Constructing Disjoint Paths on Expander Graphs (Extended Abstract). STOC 1987: 264-273 - 1986
- [c4]David Peleg, Eli Upfal
The Token Distribution Problem (Preliminary Version). FOCS 1986: 418-427 - [c3]David Peleg, Barbara Simons:
On Fault Tolerant Routings in General Networks. PODC 1986: 98-107 - [c2]Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal:
Fault Tolerance in Networks of Bounded Degree (Preliminary Version). STOC 1986: 370-379 - 1985
- [j5]David Harel, David Peleg:
More on Looping vs. Repeating in Dynamic Logic. Inf. Process. Lett. 20(2): 87-90 (1985) - [j4]David Harel, David Peleg:
Process Logic with Regular Formulas. Theor. Comput. Sci. 38: 307-322 (1985) - [c1]David Peleg:
Concurrent Dynamic Logic (Extended Abstract). STOC 1985: 232-239 - 1984
- [j3]David Peleg:
A generalized closure and complement phenomenon. Discret. Math. 50: 285-293 (1984) - [j2]David Harel, David Peleg:
On Static Logics, Dynamic Logics, and Complexity Classes. Inf. Control. 60(1-3): 86-102 (1984) - 1983
- [j1]Yaacov Choueka, David Peleg:
A note of omega-regular languages. Bull. EATCS 21: 21-23 (1983)
Coauthor Index
[j192] [j186] [j185] [j183] [j179] [c219] [c213] [c212] [c211] [j167] [c204] [i25] [j166] [j164] [c203] [c202] [c200] [i23] [i22] [j160] [j154] [c195] [c193] [c192] [c191] [c188] [i19] [j149] [c185] [i16] [i14] [c176] [i12] [i11] [j137] [c171] [c164] [c159] [i6] [j131] [c152] [i1] [j103] [j95] [c102] [c93]
Stéphane Pérennes
aka: Stephane Perennes
aka: Stephane Perennes
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: