David Peleg - RankMe

491 papers A* 89A 38B 68C 8Misc 5Journal 242Unranked 38

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Degree Realization by Bipartite Cactus Graphs. J. Graph Algorithms Appl. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz
2026	J	`jnl`	Degree Realization by Bipartite Multigraphs. Discret. Math. Theor. Comput. Sci. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2026	J	`jnl`	Recursive Energy Efficient Agreement. CoRR Shachar Meir, David Peleg
2025	J	`jnl`	Approximate realizations for outerplanaric degree sequences. J. Comput. Syst. Sci. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz
2025	A	`conf`	Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings. DISC John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg
2025	A*	`conf`	Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings. PODC John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg
2025	—	`conf`	Degree Realization by Bipartite Cactus Graphs. CIAC (1) Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz
2025	J	`jnl`	Degree Realization by Bipartite Cactus Graphs. CoRR Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz
2025	J	`jnl`	Degree Realization by Bipartite Multigraphs. CoRR Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2025	B	`conf`	Distributed Download from an External Data Source in Asynchronous Faulty Settings. OPODIS John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg
2025	J	`jnl`	Distributed Download from an External Data Source in Asynchronous Faulty Settings. CoRR John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg
2025	A	`conf`	Distributed Download from an External Data Source in Byzantine Majority Settings. DISC John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg
2025	J	`jnl`	On Bipartite Graph Realizations of a Single Degree Sequence. SIAM J. Discret. Math. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2025	J	`jnl`	On the role of the equal partition in degree realization by a bipartite graph. Theor. Comput. Sci. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2025	J	`jnl`	Optimized Degree Realization: Minimum Dominating Set & Maximum Matching. CoRR Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz
2025	J	`jnl`	Preface to special issue MFCS 2023. Inf. Comput. Jérôme Leroux, David Peleg
2025	B	`conf`	Time-Optimal and Energy-Efficient Deterministic Consensus. OPODIS Shachar Meir, Hugo Mirault, David Peleg, Peter Robinson
2024	C	`conf`	Approximate Realizations for Outerplanaric Degree Sequences. IWOCA Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz
2024	J	`jnl`	Approximate Realizations for Outerplanaric Degree Sequences. CoRR Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz
2024	A	`conf`	Byzantine Resilient Distributed Computing on External Data. DISC John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, Aishwarya Thiruvengadam
2024	J	`jnl`	Distributed Download from an External Data Source in Faulty Majority Settings. CoRR John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg
2024	J	`jnl`	Graph realization of distance sets. Theor. Comput. Sci. Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz
2024	B	`conf`	On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). MFCS Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz
2024	B	`conf`	Sparse Graphic Degree Sequences Have Planar Realizations. MFCS Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz
2024	J	`jnl`	Weighted microscopic image reconstruction. Discret. Appl. Math. Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz
2023	B	`ed.`	48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, Bordeaux, France, August 28 - September 1, 2023 MFCS Jérôme Leroux, Sylvain Lombardy, David Peleg
2023	A*	`conf`	Brief Announcement: Local Problems in the SUPPORTED Model. PODC Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
2023	J	`jnl`	Byzantine Resilient Computing with the Cloud. CoRR John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, Aishwarya Thiruvengadam
2023	J	`jnl`	Composed Degree-Distance Realizations of Graphs. Algorithmica Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz
2023	B	`conf`	Degree Realization by Bipartite Multigraphs. SIROCCO Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2023	J	`jnl`	Forcibly bipartite and acyclic (uni-)graphic sequences. Discret. Math. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2023	J	`jnl`	Graph realizations: Maximum degree in vertex neighborhoods. Discret. Math. Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2023	B	`conf`	Local Recurrent Problems in the SUPPORTED Model. OPODIS Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
2023	J	`jnl`	The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. ACM Trans. Algorithms Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2023	J	`jnl`	The power of small coalitions under two-tier majority on regular graphs. Discret. Appl. Math. Pavel Chebotarev, David Peleg
2022	A	`conf`	An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. DISC Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg
2022	J	`jnl`	An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. CoRR Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg
2022	J	`jnl`	Distributed Graph Realizations. IEEE Trans. Parallel Distributed Syst. John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav
2022	B	`conf`	Graph Realization of Distance Sets. MFCS Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz
2022	J	`jnl`	Hotelling games in fault-prone settings. Theor. Comput. Sci. Chen Avin, Avi Cohen, Zvi Lotker, David Peleg
2022	—	`conf`	On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper). SWAT Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2022	B	`conf`	On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. MFCS Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2022	J	`jnl`	On vertex-weighted realizations of acyclic and general graphs. Theor. Comput. Sci. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2022	J	`jnl`	Recurrent Problems in the LOCAL model. CoRR Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
2022	J	`jnl`	The Power of Small Coalitions under Two-Tier Majority on Regular Graphs. CoRR Pavel Chebotarev, David Peleg
2022	J	`jnl`	The generalized microscopic image reconstruction problem. Discret. Appl. Math. Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz
2022	B	`conf`	Vertex-Weighted Graphs: Realizable and Unrealizable Domains. WALCOM Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2021	A*	`conf`	2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg
2021	B	`conf`	Budgeted Dominating Sets in Uncertain Graphs. MFCS Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan
2021	J	`jnl`	Budgeted Dominating Sets in Uncertain Graphs. CoRR Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan
2021	C	`conf`	Composed Degree-Distance Realizations of Graphs. IWOCA Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz
2021	J	`jnl`	EATCS Distinguished Dissertation Award 2021 - Call for Nominations. Bull. EATCS David Peleg
2021	J	`jnl`	EATCS Distinguished Dissertation Award for 2020. Bull. EATCS David Peleg
2021	J	`jnl`	Nonuniform SINR+Voronoi diagrams are effectively uniform. Theor. Comput. Sci. Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2021	C	`conf`	On Vertex-Weighted Graph Realizations. CIAC Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
2021	C	`conf`	Relaxed and Approximate Graph Realizations. IWOCA Amotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz
2021	B	`conf`	Selected Neighbor Degree Forest Realization. ISAAC Amotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel
2021	A	`conf`	Singularly Near Optimal Leader Election in Asynchronous Networks. DISC Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg
2021	J	`jnl`	Singularly Near Optimal Leader Election in Asynchronous Networks. CoRR Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg
2021	B	`conf`	Weighted Microscopic Image Reconstruction. SOFSEM Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz
2020	A	`conf`	Distributed Graph Realizations †. IPDPS John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav
2020	J	`jnl`	Distributed Graph Realizations. CoRR John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav
2020	J	`jnl`	EATCS Distinguished Dissertation Award 2020 - Call for Nominations. Bull. EATCS Susanne Albers, Nikhil Bansal, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, David Peleg, Vladimiro Sassone, Alexandra Silva
2020	J	`jnl`	Efficiently Realizing Interval Sequences. SIAM J. Discret. Math. Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2020	J	`jnl`	Fault Tolerant Approximate BFS Structures with Additive Stretch. Algorithmica Merav Parter, David Peleg
2020	—	`conf`	Graph Realizations: Maximum Degree in Vertex Neighborhoods. SWAT Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2020	J	`jnl`	Message lower bounds via efficient network synchronization. Theor. Comput. Sci. Gopal Pandurangan, David Peleg, Michele Scquizzato
2020	A	`conf`	Minimum Neighboring Degree Realization in Graphs and Trees. ESA Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz
2020	J	`jnl`	Mixed fault tolerance in server assignment: Combining reinforcement and backup. Theor. Comput. Sci. Tal Navon, David Peleg
2020	A	`conf`	Singularly Optimal Randomized Leader Election. DISC Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg
2020	J	`jnl`	Singularly Optimal Randomized Leader Election. CoRR Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg
2020	J	`jnl`	Vertex-weighted realizations of graphs. Theor. Comput. Sci. Amotz Bar-Noy, David Peleg, Dror Rawitz
2019	J	`jnl`	Distributed distance computation and routing with small messages. Distributed Comput. Christoph Lenzen, Boaz Patt-Shamir, David Peleg
2019	J	`jnl`	EATCS Distinguished Dissertation Award 2019 - Call for Nominations. Bull. EATCS David Peleg, Susanne Albers, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, Vladimiro Sassone
2019	B	`conf`	Efficiently Realizing Interval Sequences. ISAAC Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2019	J	`jnl`	Efficiently Realizing Interval Sequences. CoRR Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2019	B	`conf`	Graph Profile Realizations and Applications to Social Networks. WALCOM Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2019	J	`jnl`	Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods. CoRR Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2019	J	`jnl`	Hotelling Games with Multiple Line Faults. CoRR Avi Cohen, David Peleg
2019	—	`conf`	Hotelling Games with Random Tolerance Intervals. WINE Avi Cohen, David Peleg
2019	J	`jnl`	Hotelling Games with Random Tolerance Intervals. CoRR Avi Cohen, David Peleg
2019	Misc	`conf`	Majority vote and monopolies in social networks. ICDCN Chen Avin, Zvi Lotker, Assaf Mizrachi, David Peleg
2019	B	`conf`	Random preferential attachment hypergraph. ASONAM Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg
2019	B	`conf`	The Generalized Microscopic Image Reconstruction Problem. ISAAC Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz
2018	J	`jnl`	EATCS Distinguished Dissertation Award 2018 - Call for Nominations. Bull. EATCS David Peleg
2018	J	`jnl`	Fault-Tolerant Approximate BFS Structures. ACM Trans. Algorithms Merav Parter, David Peleg
2018	J	`jnl`	Fault-Tolerant Hotelling Games. CoRR Chen Avin, Avi Cohen, Zvi Lotker, David Peleg
2018	J	`jnl`	Improved approximation algorithms for weighted 2-path partitions. Discret. Appl. Math. Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan
2018	B	`conf`	Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup. SIROCCO Tal Navon, David Peleg
2018	A*	`conf`	Preferential Attachment as a Unique Equilibrium. WWW Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg
2018	B	`conf`	Realizability of Graph Specifications: Characterizations and Algorithms. SIROCCO Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2018	J	`jnl`	The topology of wireless communication on a line. Theor. Comput. Sci. Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2018	B	`conf`	Wireless Expanders. SPAA Shirel Attali, Merav Parter, David Peleg, Shay Solomon
2018	J	`jnl`	Wireless Expanders. CoRR Shirel Attali, Merav Parter, David Peleg, Shay Solomon
2017	—	`conf`	Assortative Mixing Equilibria in Social Network Games. GAMENETS Chen Avin, Hadassa Daltrophe, Zvi Lotker, David Peleg
2017	J	`jnl`	Assortative Mixing Equilibria in Social Network Games. CoRR Chen Avin, Hadassa Daltrophe, Zvi Lotker, David Peleg
2017	J	`jnl`	Distributed computing on core-periphery networks: Axiom-based design. J. Parallel Distributed Comput. Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg
2017	A*	`conf`	Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks. KDD Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg
2017	A*	`conf`	Maintaining Communication in Multi-Robot Tree Coverage. IJCAI Mor Sinay, Noa Agmon, Oleg Maksimov, Sarit Kraus, David Peleg
2017	J	`jnl`	SINR diagram with interference cancellation. Ad Hoc Networks Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2017	J	`jnl`	Secluded Connectivity Problems. Algorithmica Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg
2017	B	`conf`	The Effect of Population Control Policies on Societal Fragmentation. ASONAM Zvi Lotker, David Peleg
2017	J	`jnl`	The Effect of Population Control Policies on Societal Fragmentation. CoRR Zvi Lotker, David Peleg
2016	J	`jnl`	Discovery Through Gossip. Random Struct. Algorithms Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun
2016	A*	`conf`	Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach. SODA David Peleg, Shay Solomon
2016	J	`jnl`	Efficient k-shot broadcasting in radio networks. Discret. Appl. Math. Erez Kantor, David Peleg
2016	J	`jnl`	Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. ACM Trans. Algorithms Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg
2016	A*	`conf`	Local-on-Average Distributed Tasks. SODA Merav Parter, David Peleg, Shay Solomon
2016	B	`conf`	Message Lower Bounds via Efficient Network Synchronization. SIROCCO Gopal Pandurangan, David Peleg, Michele Scquizzato
2016	J	`jnl`	Notions of Connectivity in Overlay Networks. CoRR Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg, Yuval Emek
2016	J	`jnl`	On social networks of program committees - Structure and effect on paper acceptance fairness. Soc. Netw. Anal. Min. Chen Avin, Zvi Lotker, David Peleg, Itzik Turkel
2016	J	`jnl`	On the effect of the deployment setting on broadcasting in Euclidean radio networks. Distributed Comput. Yuval Emek, Erez Kantor, David Peleg
2016	J	`jnl`	Sparse Fault-Tolerant BFS Structures. ACM Trans. Algorithms Merav Parter, David Peleg
2016	J	`jnl`	The Domination Game: Proving the 3/5 Conjecture on Isolate-Free Forests. CoRR Neta Marcus, David Peleg
2015	J	`jnl`	40th international colloquium on automata, languages and programming. Inf. Comput. Fedor V. Fomin, Marta Z. Kwiatkowska, David Peleg
2015	—	`conf`	Core Size and Densification in Preferential Attachment Networks. ICALP (2) Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg
2015	B	`conf`	Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. SPAA Merav Parter, David Peleg
2015	J	`jnl`	Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. CoRR Merav Parter, David Peleg
2015	J	`jnl`	Fault tolerant additive and (μ, α)-spanners. Theor. Comput. Sci. Gilad Braunschvig, Shiri Chechik, David Peleg, Adam Sealfon
2015	A	`conf`	Homophily and the Glass Ceiling Effect in Social Networks. ITCS Chen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne-Anne Pignolet
2015	A	`conf`	Improved Approximation Algorithms for Weighted 2-Path Partitions. ESA Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan
2015	B	`conf`	Nearly Optimal Local Broadcasting in the SINR Model with Feedback. SIROCCO Leonid Barenboim, David Peleg
2015	A	`conf`	Nonuniform SINR+Voroni Diagrams Are Effectively Uniform. DISC Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2015	J	`jnl`	On the Complexity of Universal Leader Election. J. ACM Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2015	—	`conf`	On the Relations Between SINR Diagrams and Voronoi Diagrams. ADHOC-NOW Merav Parter, David Peleg
2015	J	`jnl`	Random Preferential Attachment Hypergraphs. CoRR Chen Avin, Zvi Lotker, David Peleg
2015	B	`conf`	Social Network Analysis of Program Committees and Paper Acceptance Fairness. ASONAM Chen Avin, Zvi Lotker, David Peleg, Itzik Turkel
2015	J	`jnl`	Sublinear bounds for randomized leader election. Theor. Comput. Sci. Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2015	A*	`conf`	The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. FOCS Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2015	J	`jnl`	The Topology of Wireless Communication. J. ACM Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2015	J	`jnl`	The fault-tolerant capacitated K-center problem. Theor. Comput. Sci. Shiri Chechik, David Peleg
2015	J	`jnl`	Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. CoRR Liah Kor, Amos Korman, David Peleg
2015	J	`jnl`	Truth tellers and liars with fewer questions. Discret. Math. Gilad Braunschvig, Alon Brutzkus, David Peleg, Adam Sealfon
2014	J	`jnl`	Core-Periphery in Networks: An Axiomatic Approach. CoRR Chen Avin, Zvi Lotker, David Peleg, Yvonne-Anne Pignolet, Itzik Turkel
2014	A	`conf`	Distributed 3/2-Approximation of the Diameter. DISC Stephan Holzer, David Peleg, Liam Roditty, Roger Wattenhofer
2014	—	`conf`	Distributed Computing on Core-Periphery Networks: Axiom-Based Design. ICALP (2) Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg
2014	J	`jnl`	Distributed Computing on Core-Periphery Networks: Axiom-based Design. CoRR Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg
2014	A*	`conf`	Fault Tolerant Approximate BFS Structures. SODA Merav Parter, David Peleg
2014	J	`jnl`	Fault Tolerant Approximate BFS Structures. CoRR Merav Parter, David Peleg
2014	J	`jnl`	Gathering Despite Mischief. ACM Trans. Algorithms Yoann Dieudonné, Andrzej Pelc, David Peleg
2014	Misc	`conf`	How Even Tiny Influence Can Have a Big Impact! FUN Barbara Keller, David Peleg, Roger Wattenhofer
2014	—	`conf`	Immunity against Local Influence. Language, Culture, Computation (1) David Peleg
2014	J	`jnl`	Randomized distributed decision. Distributed Comput. Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg
2014	J	`jnl`	Robust fault tolerant uncapacitated facility location. Theor. Comput. Sci. Shiri Chechik, David Peleg
2014	J	`jnl`	Testing the irreducibility of nonsquare Perron-Frobenius systems. Inf. Process. Lett. Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2013	—	`ed.`	Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I ICALP (1) Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg
2013	—	`ed.`	Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II ICALP (2) Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg
2013	A*	`conf`	Efficient distributed source detection with limited bandwidth. PODC Christoph Lenzen, David Peleg
2013	A*	`conf`	Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. SODA Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2013	J	`jnl`	Generalized Perron-Frobenius Theorem for Nonsquare Matrices. CoRR Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2013	J	`jnl`	On approximating the Discret. Appl. Math. David Peleg, Ignasi Sau, Mordechai Shalom
2013	A*	`conf`	On the complexity of universal leader election. PODC Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2013	J	`jnl`	Prize for innovation in distributed computing: awarded to Roger Wattenhofer. SIGACT News David Peleg
2013	B	`conf`	Randomized Distributed Decision (Invited Lecture Abstract). FCT David Peleg
2013	J	`jnl`	Relaxed Spanners for Directed Disk Graphs. Algorithmica David Peleg, Liam Roditty
2013	J	`jnl`	SINR Diagram with Interference Cancellation. CoRR Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2013	A	`conf`	Secluded Connectivity Problems. ESA Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg
2013	J	`jnl`	Sparse Fault-Tolerant BFS Trees CoRR Merav Parter, David Peleg
2013	A	`conf`	Sparse Fault-Tolerant BFS Trees. ESA Merav Parter, David Peleg
2013	J	`jnl`	Special issue on DISC 2011. Distributed Comput. David Peleg
2013	Misc	`conf`	Sublinear Bounds for Randomized Leader Election. ICDCN Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2013	J	`jnl`	Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. Theory Comput. Syst. Liah Kor, Amos Korman, David Peleg
2013	J	`jnl`	Towards a complexity theory for local distributed computing. J. ACM Pierre Fraigniaud, Amos Korman, David Peleg
2012	B	`conf`	Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance. WG David Peleg
2012	J	`jnl`	Discovery through Gossip CoRR Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun
2012	B	`conf`	Discovery through gossip. SPAA Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun
2012	—	`conf`	Distributed Algorithms for Network Diameter and Girth. ICALP (2) David Peleg, Liam Roditty, Elad Tal
2012	J	`jnl`	Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer
2012	B	`conf`	Fault Tolerant Additive Spanners. WG Gilad Braunschvig, Shiri Chechik, David Peleg
2012	A*	`conf`	Gathering despite mischief. SODA Yoann Dieudonné, Andrzej Pelc, David Peleg
2012	—	`conf`	Multipath Spanners via Fault-Tolerant Spanners. MedAlg Shiri Chechik, Quentin Godfroy, David Peleg
2012	B	`conf`	Notions of Connectivity in Overlay Networks. SIROCCO Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg
2012	J	`jnl`	On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
2012	J	`jnl`	Randomized Distributed Decision CoRR Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg
2012	A	`conf`	Randomized Distributed Decision. DISC Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg
2012	J	`jnl`	SINR Diagrams: Convexity and Its Applications in Wireless Networks. J. ACM Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
2012	A*	`conf`	SINR diagram with interference cancellation. SODA Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2012	J	`jnl`	Secluded Connectivity Problems CoRR Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg
2012	J	`jnl`	Sparse reliable graph backbones. Inf. Comput. Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg
2012	J	`jnl`	Sublinear Bounds for Randomized Leader Election CoRR Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan
2012	B	`conf`	The Fault Tolerant Capacitated k-Center Problem. SIROCCO Shiri Chechik, David Peleg
2012	J	`jnl`	f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
2011	J	`jnl`	A note on exact distance labeling. Inf. Process. Lett. Oren Weimann, David Peleg
2011	A	`ed.`	Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings DISC David Peleg
2011	A*	`conf`	Distributed power control in the SINR model. INFOCOM Zvi Lotker, Merav Parter, David Peleg, Yvonne-Anne Pignolet
2011	A*	`conf`	Distributed verification and hardness of distributed approximation. STOC Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer
2011	A*	`conf`	Local Distributed Decision. FOCS Pierre Fraigniaud, Amos Korman, David Peleg
2011	B	`conf`	On Approximating the SOFSEM David Peleg, Ignasi Sau, Mordechai Shalom
2011	B	`conf`	SINR Maps: Properties and Applications. SIROCCO David Peleg
2011	J	`jnl`	The Topology of Wireless Communication CoRR Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2011	A*	`conf`	The topology of wireless communication. STOC Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2011	A	`conf`	Tight Bounds For Distributed MST Verification. STACS Liah Kor, Amos Korman, David Peleg
2010	J	`jnl`	A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Trans. Algorithms Yuval Emek, David Peleg, Liam Roditty
2010	J	`jnl`	Constructing Labeling Schemes through Universal Matrices. Algorithmica Amos Korman, David Peleg, Yoav Rodeh
2010	J	`jnl`	Distributed Verification and Hardness of Distributed Approximation CoRR Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer
2010	J	`jnl`	Equal-area locus-based convex polygon decomposition. Theor. Comput. Sci. David Adjiashvili, David Peleg
2010	J	`jnl`	Fault Tolerant Spanners for General Graphs. SIAM J. Comput. Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
2010	A*	`conf`	Forbidden-set distance labels for graphs of bounded doubling dimension. PODC Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg
2010	J	`jnl`	Local Distributed Decision CoRR Pierre Fraigniaud, Amos Korman, David Peleg
2010	J	`jnl`	Localized spanner construction for ad hoc networks with variable transmission range. ACM Trans. Sens. Networks David Peleg, Liam Roditty
2010	J	`jnl`	Proof labeling schemes. Distributed Comput. Amos Korman, Shay Kutten, David Peleg
2010	B	`conf`	Realtime Classification for Encrypted Traffic. SEA Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty
2010	A	`conf`	Relaxed Spanners for Directed Disk Graphs. STACS David Peleg, Liam Roditty
2010	A	`conf`	Robust Fault Tolerant Uncapacitated Facility Location. STACS Shiri Chechik, David Peleg
2010	B	`ed.`	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 SOFSEM Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe
2010	—	`conf`	Sparse Reliable Graph Backbones. ICALP (2) Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg
2010	J	`jnl`	Structure and algorithms in the SINR wireless model. SIGACT News Zvi Lotker, David Peleg
2010	—	`ch.`	Time-Efficient Broadcast in Radio Networks. Graphs and Algorithms in Communication Networks David Peleg, Tomasz Radzik
2009	J	`jnl`	A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs. SIAM J. Discret. Math. Yuval Emek, David Peleg
2009	J	`jnl`	Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems. J. Discrete Algorithms Erez Kantor, David Peleg
2009	C	`conf`	As Good as It Gets: Competitive Fault Tolerance in Network Structures. SSS David Peleg
2009	J	`jnl`	Broadcasting in UDG radio networks with unknown topology. Distributed Comput. Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
2009	J	`jnl`	Computing the fault tolerance of multi-agent deployment. Artif. Intell. Yingqian Zhang, Efrat Manisterski, Sarit Kraus, V. S. Subrahmanian, David Peleg
2009	J	`jnl`	Conflict-free coloring of unit disks. Discret. Appl. Math. Nissan Lev-Tov, David Peleg
2009	J	`jnl`	Distributed algorithms for partitioning a swarm of autonomous mobile robots. Theor. Comput. Sci. Asaf Efrima, David Peleg
2009	A	`conf`	Efficient k-Shot Broadcasting in Radio Networks. DISC Erez Kantor, David Peleg
2009	A*	`conf`	Fault-tolerant spanners for general graphs. STOC Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
2009	J	`jnl`	Labeling Schemes for Tree Representation. Algorithmica Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2009	A	`conf`	Local Computation of Nearly Additive Spanners. DISC Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot
2009	B	`conf`	Low-Port Tree Representations. WG Shiri Chechik, David Peleg
2009	J	`jnl`	Relaxed spanners for directed disk graphs CoRR David Peleg, Liam Roditty
2009	J	`jnl`	Robust Fault Tolerant uncapacitated facility location CoRR Shiri Chechik, David Peleg
2009	A*	`conf`	SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
2008	A*	`conf`	A near-linear time algorithm for computing replacement paths in planar directed graphs. SODA Yuval Emek, David Peleg, Liam Roditty
2008	J	`jnl`	Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs. SIAM J. Comput. Yuval Emek, David Peleg
2008	J	`jnl`	Compact separator decompositions in dynamic trees and applications to labeling schemes. Distributed Comput. Amos Korman, David Peleg
2008	J	`jnl`	Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. SIAM J. Comput. Reuven Cohen, David Peleg
2008	B	`conf`	Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
2008	J	`jnl`	Dynamic routing schemes for graphs with low local density. ACM Trans. Algorithms Amos Korman, David Peleg
2008	B	`conf`	Equal-Area Locus-Based Convex Polygon Decomposition. SIROCCO David Adjiashvili, David Peleg
2008	J	`jnl`	Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2008	J	`jnl`	Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. Reuven Cohen, David Peleg
2008	—	`conf`	Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. ADHOC-NOW David Peleg, Liam Roditty
2008	A*	`conf`	On the effect of the deployment setting on broadcasting in Euclidean radio networks. PODC Yuval Emek, Erez Kantor, David Peleg
2008	A*	`conf`	On the locality of distributed sparse spanner construction. PODC Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot
2008	J	`jnl`	SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks CoRR Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
2008	J	`jnl`	Time efficient k-shot broadcasting in known topology radio networks. Distributed Comput. Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su
2008	Misc	`conf`	Towards Networked Computers: What Can Be Learned from Distributed Computing?. HiPC David Peleg
2007	J	`jnl`	Approximation algorithm for hotlink assignment in the greedy model. Theor. Comput. Sci. Rachel Matichin, David Peleg
2007	J	`jnl`	Approximation algorithms for the Label-Cover J. Discrete Algorithms David Peleg
2007	J	`jnl`	Asynchronous resource discovery in peer-to-peer networks. Comput. Networks Shay Kutten, David Peleg
2007	J	`jnl`	Average stretch analysis of compact routing schemes. Discret. Appl. Math. Tamar Eilam, Cyril Gavoille, David Peleg
2007	A*	`conf`	Broadcasting in udg radio networks with unknown topology. PODC Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
2007	A	`conf`	Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. DISC Amos Korman, David Peleg
2007	A	`conf`	Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. DISC Bilel Derbel, Cyril Gavoille, David Peleg
2007	B	`conf`	Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots. SIROCCO Asaf Efrima, David Peleg
2007	—	`conf`	Distributed Models and Algorithms for Mobile Robot Systems. SOFSEM (1) Asaf Efrima, David Peleg
2007	A	`conf`	Energy and Time Efficient Broadcasting in Known Topology Radio Networks. DISC Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su
2007	J	`jnl`	Faster communication in known topology radio networks. Distributed Comput. Leszek Gasieniec, David Peleg, Qin Xin
2007	J	`jnl`	Feasibility and complexity of broadcasting with random transmission failures. Theor. Comput. Sci. Andrzej Pelc, David Peleg
2007	J	`jnl`	Labeling schemes for weighted dynamic trees. Inf. Comput. Amos Korman, David Peleg
2007	J	`jnl`	Preface. Theor. Comput. Sci. Andrzej Pelc, David Peleg, Michel Raynal
2007	J	`jnl`	Reducing human interactions in Web directory searches. ACM Trans. Inf. Syst. Ornan Ori Gerstel, Shay Kutten, Eduardo Sany Laber, Rachel Matichin, David Peleg, Artur Alves Pessoa, Críston P. de Souza
2007	J	`jnl`	The Hardness of Approximating Spanner Problems. Theory Comput. Syst. Michael Elkin, David Peleg
2007	A	`conf`	Time-Efficient Broadcasting in Radio Networks. DISC David Peleg
2007	Misc	`conf`	Time-Efficient Broadcasting in Radio Networks: A Review. ICDCIT David Peleg
2006	A*	`conf`	A tight upper bound on the probabilistic embedding of series-parallel graphs. SODA Yuval Emek, David Peleg
2006	C	`conf`	Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems. CIAC Erez Kantor, David Peleg
2006	J	`jnl`	Average probe complexity in quorum systems. J. Comput. Syst. Sci. Yehuda Hassin, David Peleg
2006	B	`conf`	Constructing Labeling Schemes Through Universal Matrices. ISAAC Amos Korman, David Peleg, Yoav Rodeh
2006	A	`conf`	Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. STACS Reuven Cohen, David Peleg
2006	J	`jnl`	Distributed MST for constant diameter graphs. Distributed Comput. Zvi Lotker, Boaz Patt-Shamir, David Peleg
2006	—	`conf`	Dynamic Routing Schemes for General Graphs. ICALP (1) Amos Korman, David Peleg
2006	J	`jnl`	Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots. SIAM J. Comput. Noa Agmon, David Peleg
2006	B	`conf`	Local Algorithms for Autonomous Robot Systems. SIROCCO Reuven Cohen, David Peleg
2006	—	`conf`	Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks. CAAN David Peleg
2005	A	`conf`	Adaptive Collaboration in Peer-to-Peer Systems. ICDCS Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle
2005	J	`jnl`	Approximating Theor. Comput. Sci. Michael Elkin, David Peleg
2005	J	`jnl`	Broadcasting with locally bounded Byzantine faults. Inf. Process. Lett. Andrzej Pelc, David Peleg
2005	J	`jnl`	Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. SIAM J. Comput. Reuven Cohen, David Peleg
2005	J	`jnl`	Distance labeling schemes for well-separated graph classes. Discret. Appl. Math. Michal Katz, Nir A. Katz, David Peleg
2005	B	`conf`	Distributed Algorithms for Systems of Autonomous Mobile Robots. OPODIS David Peleg
2005	—	`conf`	Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges. IWDC David Peleg
2005	—	`conf`	Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita
2005	A*	`conf`	Faster communication in known topology radio networks. PODC Leszek Gasieniec, David Peleg, Qin Xin
2005	A*	`conf`	Feasibility and complexity of broadcasting with random transmission failures. PODC Andrzej Pelc, David Peleg
2005	J	`jnl`	Graph exploration by a finite automaton. Theor. Comput. Sci. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2005	A*	`conf`	Improved recommendation systems. SODA Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle
2005	J	`jnl`	Informative labeling schemes for graphs. Theor. Comput. Sci. David Peleg
2005	A*	`conf`	Label-Guided Graph Exploration by a Finite Automaton. ICALP Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2005	—	`conf`	Labeling Schemes for Tree Representation. IWDC Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2005	J	`jnl`	Minimum-Weight Spanning Tree Construction in SIAM J. Comput. Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, David Peleg
2005	J	`jnl`	Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Networks Nissan Lev-Tov, David Peleg
2005	J	`jnl`	Preface: Structural Information and Communication Complexity. Theor. Comput. Sci. David Peleg, Jop F. Sibeyn
2005	A*	`conf`	Proof labeling schemes. PODC Amos Korman, Shay Kutten, David Peleg
2005	J	`jnl`	Virtual path layouts optimizing total hop count on ATM tree networks. J. Discrete Algorithms David Peleg, Uri Pincas
2004	J	`jnl`	(1+epsilon, beta)-Spanner Constructions for General Graphs. SIAM J. Comput. Michael Elkin, David Peleg
2004	A*	`conf`	Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. SODA Yuval Emek, David Peleg
2004	B	`conf`	Approximation Algorithm for Hotlink Assignment in the Greedy Model. SIROCCO Rachel Matichin, David Peleg
2004	A*	`conf`	Collaboration of untrusting peers with changing interests. EC Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle
2004	A	`conf`	Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. ESA Reuven Cohen, David Peleg
2004	J	`jnl`	Distance labeling in graphs. J. Algorithms Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
2004	A	`conf`	Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
2004	A*	`conf`	Fault-tolerant gathering algorithms for autonomous mobile robots. SODA Noa Agmon, David Peleg
2004	B	`conf`	Graph Exploration by a Finite Automaton. MFCS Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2004	J	`jnl`	Labeling Schemes for Dynamic Tree Networks. Theory Comput. Syst. Amos Korman, David Peleg, Yoav Rodeh
2004	J	`jnl`	Labeling Schemes for Flow and Connectivity. SIAM J. Comput. Michal Katz, Nir A. Katz, Amos Korman, David Peleg
2004	B	`conf`	Robot Convergence via Center-of-Gravity Algorithms. SIROCCO Reuven Cohen, David Peleg
2003	B	`conf`	Approximation Algorithm for Hotlink Assignments in Web Directories. WADS Rachel Matichin, David Peleg
2003	J	`jnl`	Compact and localized distributed data structures. Distributed Comput. Cyril Gavoille, David Peleg
2003	J	`jnl`	Compact routing schemes with low stretch factor. J. Algorithms Tamar Eilam, Cyril Gavoille, David Peleg
2003	J	`jnl`	Deterministic Resource Discovery in Distributed Networks. Theory Comput. Syst. Shay Kutten, David Peleg, Uzi Vishkin
2003	J	`jnl`	Directed virtual path layouts in ATM networks. Theor. Comput. Sci. Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
2003	B	`conf`	Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract). ISAAC Ornan Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg
2003	A*	`conf`	Labeling Schemes for Weighted Dynamic Trees. ICALP Amos Korman, David Peleg
2003	C	`conf`	Localized Network Representations. CIAC David Peleg
2003	B	`conf`	MST construction in O(log log n) communication rounds. SPAA Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg
2003	C	`conf`	Spanning Trees with Low Maximum/Average Stretch. CIAC David Peleg
2003	J	`jnl`	The Power of Small Coalitions in Graphs. Discret. Appl. Math. Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
2002	B	`conf`	Asynchronous Resource Discovery in Peer to Peer Networks. SRDS Shay Kutten, David Peleg
2002	—	`conf`	Exact Algorithms and Approximation Schemes for Base Station Placement Problems. SWAT Nissan Lev-Tov, David Peleg
2002	J	`jnl`	Faster exact solutions for some NP-hard problems. Theor. Comput. Sci. Limor Drori, David Peleg
2002	J	`jnl`	How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems. SIAM J. Discret. Math. David Peleg, Avishai Wool
2002	A	`conf`	Labeling Schemes for Dynamic Tree Networks. STACS Amos Korman, David Peleg, Yoav Rodeh
2002	A*	`conf`	Labeling schemes for flow and connectivity. SODA Michal Katz, Nir A. Katz, Amos Korman, David Peleg
2002	J	`jnl`	Local majorities, coalitions and monopolies in graphs: a review. Theor. Comput. Sci. David Peleg
2002	B	`conf`	Low Stretch Spanning Trees. MFCS David Peleg
2002	J	`jnl`	Station Layouts in the Presence of Location Constraints. J. Interconnect. Networks Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg
2001	A*	`conf`	(1+epsilon, beta)-spanner constructions for general graphs. STOC Michael Elkin, David Peleg
2001	A	`conf`	Approximate Distance Labeling Schemes. ESA Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg
2001	B	`conf`	Approximating k-Spanner Problems for k>2. IPCO Michael Elkin, David Peleg
2001	J	`jnl`	Assigning labels in an unknown anonymous network with a leader. Distributed Comput. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
2001	A*	`conf`	Average probe complexity in quorum systems. PODC Yehuda Hassin, David Peleg
2001	B	`conf`	Deterministic resource discovery in distributed networks. SPAA Shay Kutten, David Peleg, Uzi Vishkin
2001	A*	`conf`	Distance labeling in graphs. SODA Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz
2001	A*	`conf`	Distributed MST for constant diameter graphs. PODC Zvi Lotker, Boaz Patt-Shamir, David Peleg
2001	J	`jnl`	Distributed Probabilistic Polling and Applications to Proportionate Agreement. Inf. Comput. Yehuda Hassin, David Peleg
2001	J	`jnl`	Generalized submodular cover problems and applications. Theor. Comput. Sci. Judit Bar-Ilan, Guy Kortsarz, David Peleg
2001	J	`jnl`	Low Complexity Variants of the Arrow Distributed Directory. J. Comput. Syst. Sci. David Peleg, Eilon Reshef
2001	B	`conf`	Small k-Dominating Sets in Planar Graphs with Applications. WG Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena
2001	J	`jnl`	Sparse communication networks and efficient routing in the plane. Distributed Comput. Yehuda Hassin, David Peleg
2001	A	`conf`	The Average Hop Count Measure for Virtual Path Layouts. DISC David Peleg, Uri Pincas
2001	B	`conf`	The Client-Server 2-Spanner Problem with Applications to Network Design. SIROCCO Michael Elkin, David Peleg
2001	J	`jnl`	The Compactness of Interval Routing for Almost All Graphs. SIAM J. Comput. Cyril Gavoille, David Peleg
2001	J	`jnl`	The Dense Algorithmica Uriel Feige, Guy Kortsarz, David Peleg
2001	J	`jnl`	The Wakeup Problem in Synchronous Broadcast Systems. SIAM J. Discret. Math. Leszek Gasieniec, Andrzej Pelc, David Peleg
2000	J	`jnl`	A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction. SIAM J. Comput. David Peleg, Vitaly Rubinovich
2000	—	`conf`	Approximation Algorithms for the Label-Cover SWAT David Peleg
2000	A*	`conf`	Assigning labels in unknown anonymous networks (extended abstract). PODC Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
2000	A*	`conf`	Deterministic distributed resource discovery (brief announcement). PODC Shay Kutten, David Peleg
2000	A	`conf`	Distance Labeling Schemes for Well-Separated Graph Classes. STACS Michal Katz, Nir A. Katz, David Peleg
2000	A	`conf`	Distributed Algorithms for English Auctions. DISC Yedidia Atzmony, David Peleg
2000	B	`conf`	Extremal bounds for probabilistic polling in graphs. SIROCCO Yehuda Hassin, David Peleg
2000	J	`jnl`	Feedback vertex set in hypercubes. Inf. Process. Lett. Riccardo Focardi, Flaminia L. Luccio, David Peleg
2000	B	`conf`	Informative Labeling Schemes for Graphs. MFCS David Peleg
2000	J	`jnl`	Proximity-preserving labeling schemes. J. Graph Theory David Peleg
2000	A*	`conf`	Sparse communication networks and efficient routing in the plane (extended abstract). PODC Yehuda Hassin, David Peleg
2000	A*	`conf`	Strong Inapproximability of the Basic ICALP Michael Elkin, David Peleg
2000	A	`conf`	The Hardness of Approximating Spanner Problems. STACS Michael Elkin, David Peleg
2000	A*	`conf`	The wakeup problem in synchronous broadcast systems (extended abstract). PODC Leszek Gasieniec, Andrzej Pelc, David Peleg
2000	J	`jnl`	Tight Fault Locality. SIAM J. Comput. Shay Kutten, David Peleg
1999	A*	`conf`	A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. FOCS David Peleg, Vitaly Rubinovich
1999	A*	`conf`	A Variant of the Arrow Distributed Directory with Low Average Complexity. ICALP David Peleg, Eilon Reshef
1999	J	`jnl`	Approximating the Weight of Shallow Steiner Trees. Discret. Appl. Math. Guy Kortsarz, David Peleg
1999	J	`jnl`	Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks. SIAM J. Comput. Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg
1999	A*	`conf`	Distributed Probabilistic Polling and Applications to Proportionate Agreement. ICALP Yehuda Hassin, David Peleg
1999	J	`jnl`	Edge-disjoint spanners of complete graphs and complete digraphs. Discret. Math. Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
1999	A	`conf`	Faster Exact Solutions for Some NP-Hard Problems. ESA Limor Drori, David Peleg
1999	J	`jnl`	Fault-Local Distributed Mending. J. Algorithms Shay Kutten, David Peleg
1999	B	`conf`	Proximity-Preserving Labeling Schemes and Their Applications. WG David Peleg
1999	B	`conf`	Station Layouts in the Presence of Location Constraints. ISAAC Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg
1999	J	`jnl`	The Compactness of Interval Routing. SIAM J. Discret. Math. Cyril Gavoille, David Peleg
1998	J	`jnl`	A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM J. Comput. Juan A. Garay, Shay Kutten, David Peleg
1998	—	`conf`	An approximation algorithm for minimum-cost network design. Robust Communication Networks: Interconnection and Survivability Yishay Mansour, David Peleg
1998	J	`jnl`	Approximate Maxima Finding of Continuous Functions under Restricted Budget. Theor. Comput. Sci. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
1998	A*	`conf`	Compact Routing Schemes with Low Stretch Factor (Extended Abstract). PODC Tamar Eilam, Cyril Gavoille, David Peleg
1998	A*	`conf`	Deterministic Polylog Approximation for Minimum Communication Spanning Trees. ICALP David Peleg, Eilon Reshef
1998	A	`conf`	Directed Virtual Path Layouts in ATM Networks. DISC Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
1998	A*	`conf`	Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees. ICALP David Peleg
1998	J	`jnl`	Fast Distributed Construction of Small J. Algorithms Shay Kutten, David Peleg
1998	J	`jnl`	Generating Low-Degree 2-Spanners. SIAM J. Comput. Guy Kortsarz, David Peleg
1998	J	`jnl`	Near-Linear Time Construction of Sparse Neighborhood Covers. SIAM J. Comput. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
1998	J	`jnl`	Optimal Broadcast with Partial Knowledge. SIAM J. Comput. Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
1998	B	`ed.`	SIROCCO'98, 5th International Colloquium on Structural Information & Communication Complexity, Amalfi, Italy, June 22-24, 1998 SIROCCO Luisa Gargano, David Peleg
1998	J	`jnl`	Size Bounds for Dynamic Monopolies. Discret. Appl. Math. David Peleg
1998	A	`conf`	The Compactness of Interval Routing for Almost All Graphs. DISC Cyril Gavoille, David Peleg
1998	B	`conf`	Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper). SIROCCO Pilar de la Torre, Lata Narayanan, David Peleg
1997	B	`conf`	Approximating Minimum Communication Spanning Trees. SIROCCO David Peleg
1997	A*	`conf`	Approximating Shallow-Light Trees (Extended Abstract). SODA Guy Kortsarz, David Peleg
1997	J	`jnl`	Crumbling Walls: A Class of Practical and Efficient Quorum Systems. Distributed Comput. David Peleg, Avishai Wool
1997	J	`jnl`	Load Balancing in Quorum Systems. SIAM J. Discret. Math. Ron Holzman, Yosi Marcus, David Peleg
1997	J	`jnl`	Randomized Approximation of Bounded Multicovering Problems. Algorithmica David Peleg, Gideon Schechtman, Avishai Wool
1997	B	`conf`	Size Bounds for Dynamic Monopolies. SIROCCO David Peleg
1997	J	`jnl`	The Availability of Crumbling Wall Quorum Systems. Discret. Appl. Math. David Peleg, Avishai Wool
1996	B	`conf`	Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). WG Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
1996	J	`jnl`	Fast Distributed Network Decompositions and Covers. J. Parallel Distributed Comput. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
1996	—	`conf`	Generalized Submodular Cover Problems and Applications. ISTCS Judit Bar-Ilan, Guy Kortsarz, David Peleg
1996	A*	`conf`	How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract). PODC David Peleg, Avishai Wool
1996	B	`conf`	Majority Voting, Coalitions and Monopolies in Graphs. SIROCCO David Peleg
1996	J	`jnl`	Scheduling Jobs Using Common Resources. Inf. Comput. Judit Bar-Ilan, David Peleg
1996	A*	`conf`	The Complexity of Data Mining on the Web (Abstract). PODC Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
1996	B	`conf`	Tight Bounds on the Size of 2-Monopolies. SIROCCO Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
1995	J	`jnl`	A Graph-Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput. Noga Alon, Richard M. Karp, David Peleg, Douglas B. West
1995	J	`jnl`	A Note on Optimal Time Broadcast in Faulty Hypercubes. J. Parallel Distributed Comput. David Peleg
1995	J	`jnl`	Approximation Algorithms for Minimum-Time Broadcast. SIAM J. Discret. Math. Guy Kortsarz, David Peleg
1995	A*	`conf`	Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract). STOC Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg
1995	A*	`conf`	Crumbling Walls: A Class of Practical and Efficient Quorum Systems (Extended Abstract). PODC David Peleg, Avishai Wool
1995	A*	`conf`	Fast Distributed Construction of k-Dominating Sets and Applications. PODC Shay Kutten, David Peleg
1995	A*	`conf`	Fault-Local Distributed Mending (Extended Abstract). PODC Shay Kutten, David Peleg
1995	J	`jnl`	Greedy Packet Scheduling. SIAM J. Comput. Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
1995	B	`conf`	Load Balancing in Quorum Systems (Extended Abstract). WADS Ron Holzman, Yosi Marcus, David Peleg
1995	J	`jnl`	On the maximum density of 0-1 matrices with no forbidden rectangles. Discret. Math. David Peleg
1995	J	`jnl`	Online Tracking of Mobile Users. J. ACM Baruch Awerbuch, David Peleg
1995	—	`conf`	Optimal Broadcast with Partial Knowledge (Extended Abstract). WDAG Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg
1995	J	`jnl`	The Availability of Quorum Systems. Inf. Comput. David Peleg, Avishai Wool
1995	J	`jnl`	The Complexity of Reconfiguring Network Models Inf. Comput. Yosi Ben-Asher, Klaus-Jörn Lange, David Peleg, Assaf Schuster
1995	B	`conf`	The Power of Small Coalitions in Graphs. SIROCCO Jean-Claude Bermond, David Peleg
1995	A*	`conf`	Tight Fault Locality (Extended Abstract). FOCS Shay Kutten, David Peleg
1994	J	`jnl`	Computing with Noisy Information. SIAM J. Comput. Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal
1994	A*	`conf`	Generating Low-Degree 2-Spanners. SODA Guy Kortsarz, David Peleg
1994	J	`jnl`	Generating Sparse 2-Spanners. J. Algorithms Guy Kortsarz, David Peleg
1994	J	`jnl`	Low-Diameter Graph Decomposition Is in NC. Random Struct. Algorithms Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
1994	J	`jnl`	On buffer-economical store-and-forward deadlock prevention. IEEE Trans. Commun. Baruch Awerbuch, Shay Kutten, David Peleg
1994	A*	`ed.`	Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14-17, 1994 PODC James H. Anderson, David Peleg, Elizabeth Borowsky
1994	J	`jnl`	Traffic-light scheduling on the grid. Discret. Appl. Math. Guy Kortsarz, David Peleg
1993	A*	`conf`	A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) FOCS Juan A. Garay, Shay Kutten, David Peleg
1993	—	`conf`	Approximating Bounded 0-1 Integer Linear Programs. ISTCS David Peleg, Gideon Schechtman, Avishai Wool
1993	J	`jnl`	Distance-Dependent Distributed Directories Inf. Comput. David Peleg
1993	J	`jnl`	How to Allocate Network Centers. J. Algorithms Judit Bar-Ilan, Guy Kortsarz, David Peleg
1993	A*	`conf`	Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers FOCS Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
1993	A*	`conf`	On Choosing a Dense Subgraph (Extended Abstract) FOCS Guy Kortsarz, David Peleg
1993	—	`conf`	Sphere Packing and Local Majorities in Graphs. ISTCS Nathan Linial, David Peleg, Yuri Rabinovich, Michael E. Saks
1993	J	`jnl`	Time-Space Tradeoffs for Set Operations. Theor. Comput. Sci. Boaz Patt-Shamir, David Peleg
1992	A*	`conf`	Adapting to Asynchronous Dynamic Networks (Extended Abstract) STOC Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks
1992	—	`conf`	Approximation Algorithms for Minimum Time Broadcast. ISTCS Guy Kortsarz, David Peleg
1992	A*	`conf`	Competitive Distributed Job Scheduling (Extended Abstract) STOC Baruch Awerbuch, Shay Kutten, David Peleg
1992	—	`conf`	Distributed Resource Allocation Algorithms (Extended Abstract). WDAG Judit Bar-Ilan, David Peleg
1992	A*	`conf`	Fast Network Decomposition (Extended Abstract). PODC Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
1992	—	`conf`	Generating Sparse 2-spanners. SWAT Guy Kortsarz, David Peleg
1992	—	`conf`	Low-Diameter Graph Decomposition is in NC. SWAT Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
1992	J	`jnl`	Routing with Polynomial Communication-Space Trade-Off. SIAM J. Discret. Math. Baruch Awerbuch, David Peleg
1992	J	`jnl`	Single Round Simulation on Radio Networks. J. Algorithms Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
1992	—	`conf`	The Complexity of Reconfiguring Network Models. ISTCS Yosi Ben-Asher, David Peleg, Assaf Schuster
1992	—	`conf`	Traffic-Light Scheduling on the Grid (Extended Abstract). WDAG Guy Kortsarz, David Peleg
1991	—	`conf`	A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract). On-Line Algorithms Noga Alon, Richard M. Karp, David Peleg, Douglas B. West
1991	J	`jnl`	A Lower Bound for Radio Broadcast. J. Comput. Syst. Sci. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
1991	B	`conf`	Approximation Algorithms for Selecting Network Centers (Preliminary Vesion). WADS Judit Bar-Ilan, David Peleg
1991	A*	`conf`	Broadcast with Partial Knowledge (Preliminary Version). PODC Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
1991	A*	`conf`	Compact Deterministic Distributed Dictionaries (Extended Abstract). PODC Karni Gilon, David Peleg
1991	A*	`conf`	Concurrent Online Tracking of Mobile Users. SIGCOMM Baruch Awerbuch, David Peleg
1991	A*	`conf`	Efficient Deadlock-Free Routing. PODC Baruch Awerbuch, Shay Kutten, David Peleg
1991	J	`jnl`	Fault-Tolerant Critical Section Management in Asynchronous Environments Inf. Comput. Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg
1991	A*	`conf`	On Buffer-Economical Store-and-Forward Deadlock Prevention. INFOCOM Baruch Awerbuch, Shay Kutten, David Peleg
1991	J	`jnl`	Square Meshes are not always Optimal. IEEE Trans. Computers Amotz Bar-Noy, David Peleg
1991	A*	`conf`	The POwer of Reconfiguration. ICALP Yosi Ben-Asher, David Peleg, Rajiv Ramaswami, Assaf Schuster
1991	J	`jnl`	The Power of Reconfiguration. J. Parallel Distributed Comput. Yosi Ben-Asher, David Peleg, Rajiv Ramaswami, Assaf Schuster
1991	J	`jnl`	Tight Bounds on Minimum Broadcast Networks. SIAM J. Discret. Math. Michelangelo Grigni, David Peleg
1990	J	`jnl`	A Time-Randomness Trade-Off for Oblivious Routing. SIAM J. Comput. David Peleg, Eli Upfal
1990	J	`jnl`	A Trade-Off between Information and Communication in Broadcast Protocols J. ACM Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish
1990	A*	`conf`	Computing with Unreliable Information (Preliminary Version) STOC Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
1990	A*	`conf`	Cost-Sensitive Analysis of Communication Protocols. PODC Baruch Awerbuch, Alan E. Baratz, David Peleg
1990	—	`conf`	Distributed Data Structures: A Complexity-Oriented View. WDAG David Peleg
1990	—	`conf`	Greedy Packet Scheduling. WDAG Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
1990	J	`jnl`	Improved Routing Strategies with Succinct Tables. J. Algorithms Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
1990	A*	`conf`	Network Synchronization with Polylogarithmic Overhead FOCS Baruch Awerbuch, David Peleg
1990	—	`conf`	Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
1990	J	`jnl`	Randomized Broadcast in Networks. Random Struct. Algorithms Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
1990	J	`jnl`	Renaming in an Asynchronous Environment J. ACM Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk
1990	A*	`conf`	Sparse Partitions (Extended Abstract) FOCS Baruch Awerbuch, David Peleg
1990	J	`jnl`	Time-Optimal Leader Election in General Networks. J. Parallel Distributed Comput. David Peleg
1989	J	`jnl`	A trade-off between space and efficiency for routing tables. J. ACM David Peleg, Eli Upfal
1989	J	`jnl`	An Optimal Synchronizer for the Hypercube. SIAM J. Comput. David Peleg, Jeffrey D. Ullman
1989	A*	`conf`	Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) STOC Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
1989	J	`jnl`	Constructng disjoint paths on expander graphs. Comb. David Peleg, Eli Upfal
1989	—	`conf`	Fault-Tolerant Critical Section Management in Asynchronous Networks. WDAG Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg
1989	J	`jnl`	Graph spanners. J. Graph Theory David Peleg, Alejandro A. Schäffer
1989	A*	`conf`	On the Complexity of Radio Communication (Extended Abstract) STOC Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
1989	J	`jnl`	Packet Distribution on a Ring. J. Parallel Distributed Comput. David Peleg, Allen Van Gelder
1989	J	`jnl`	The Token Distribution Problem. SIAM J. Comput. David Peleg, Eli Upfal
1989	J	`jnl`	Time bounds on fault-tolerant broadcasting. Networks David Peleg, Alejandro A. Schäffer
1988	A*	`conf`	A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) STOC Danny Krizanc, David Peleg, Eli Upfal
1988	—	`conf`	A Tradeoff between Information and Communication in Broadcast Protocols. AWOC Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish
1988	A*	`conf`	A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract) STOC David Peleg, Eli Upfal
1988	J	`jnl`	Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
1987	A*	`conf`	Achievable Cases in an Asynchronous Environment (Extended Abstract) FOCS Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk
1987	A*	`conf`	An Optimal Synchronizer for the Hypercube. PODC David Peleg, Jeffrey D. Ullman
1987	J	`jnl`	Communication in Concurrent Dynamic Logic. J. Comput. Syst. Sci. David Peleg
1987	J	`jnl`	Concurrent Program Schemes and Their Logics. Theor. Comput. Sci. David Peleg
1987	J	`jnl`	Concurrent dynamic logic. J. ACM David Peleg
1987	A*	`conf`	Constructing Disjoint Paths on Expander Graphs (Extended Abstract) STOC David Peleg, Eli Upfal
1987	J	`jnl`	On Fault Tolerant Routings in General Networks Inf. Comput. David Peleg, Barbara Simons
1987	J	`jnl`	The Generalized Packet Routing Problem. Theor. Comput. Sci. David Peleg, Eli Upfal
1986	A*	`conf`	Fault Tolerance in Networks of Bounded Degree (Preliminary Version) STOC Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
1986	A*	`conf`	On Fault Tolerant Routings in General Networks. PODC David Peleg, Barbara Simons
1986	A*	`conf`	The Token Distribution Problem (Preliminary Version) FOCS David Peleg, Eli Upfal
1985	A*	`conf`	Concurrent Dynamic Logic (Extended Abstract) STOC David Peleg
1985	J	`jnl`	More on Looping vs. Repeating in Dynamic Logic. Inf. Process. Lett. David Harel, David Peleg
1985	J	`jnl`	Process Logic with Regular Formulas. Theor. Comput. Sci. David Harel, David Peleg
1984	J	`jnl`	A generalized closure and complement phenomenon. Discret. Math. David Peleg
1984	J	`jnl`	On Static Logics, Dynamic Logics, and Complexity Classes Inf. Control. David Harel, David Peleg
1983	J	`jnl`	A note of omega-regular languages. Bull. EATCS Yaacov Choueka, David Peleg