| 2026 | IPCO | Degree Realization with Minimum Dominating Set. | Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz |
| 2026 | IWOCA | Degree Realization with Maximum Matching. | Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz |
| 2026 | SIROCCO | Minimum Deviation Distance Realization. | Amotz Bar-Noy, David Peleg, Mor Perry, Yingli Ran, Dror Rawitz |
| 2025 | CIAC | Degree Realization by Bipartite Cactus Graphs. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Yingli Ran, Dror Rawitz |
| 2025 | OPODIS | Distributed Download from an External Data Source in Asynchronous Faulty Settings. | John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg |
| 2025 | OPODIS | Time-Optimal and Energy-Efficient Deterministic Consensus. | Shachar Meir, Hugo Mirault, David Peleg, Peter Robinson |
| 2025 | PODC | Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings. | John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg |
| 2024 | IWOCA | Approximate Realizations for Outerplanaric Degree Sequences. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Yingli Ran, Dror Rawitz |
| 2024 | MFCS | On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Yingli Ran, Dror Rawitz |
| 2024 | MFCS | Sparse Graphic Degree Sequences Have Planar Realizations. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Yingli Ran, Dror Rawitz |
| 2023 | OPODIS | Local Recurrent Problems in the SUPPORTED Model. | Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran |
| 2023 | PODC | Brief Announcement: Local Problems in the SUPPORTED Model. | Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran |
| 2023 | SIROCCO | Degree Realization by Bipartite Multigraphs. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Dror Rawitz |
| 2022 | MFCS | On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Dror Rawitz |
| 2022 | MFCS | Graph Realization of Distance Sets. | Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz |
| 2022 | WALCOM | Vertex-Weighted Graphs: Realizable and Unrealizable Domains. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Dror Rawitz |
| 2021 | CIAC | On Vertex-Weighted Graph Realizations. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Dror Rawitz |
| 2021 | ISAAC | Selected Neighbor Degree Forest Realization. | Amotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel |
| 2021 | IWOCA | Relaxed and Approximate Graph Realizations. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Mor Perry, Dror Rawitz |
| 2021 | IWOCA | Composed Degree-Distance Realizations of Graphs. | Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz |
| 2021 | MFCS | Budgeted Dominating Sets in Uncertain Graphs. | Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan |
| 2021 | PODC | 2021 Edsger W. Dijkstra Prize in Distributed Computing. | Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg |
| 2021 | SOFSEM | Weighted Microscopic Image Reconstruction. | Amotz Bar-Noy, Toni Bhnlein, Zvi Lotker, David Peleg, Dror Rawitz |
| 2020 | ESA | Minimum Neighboring Degree Realization in Graphs and Trees. | Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz |
| 2019 | ICDCN | Majority vote and monopolies in social networks. | Chen Avin, Zvi Lotker, Assaf Mizrachi, David Peleg |
| 2019 | ISAAC | The Generalized Microscopic Image Reconstruction Problem. | Amotz Bar-Noy, Toni Bhnlein, Zvi Lotker, David Peleg, Dror Rawitz |
| 2019 | ISAAC | Efficiently Realizing Interval Sequences. | Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz |
| 2019 | WALCOM | Graph Profile Realizations and Applications to Social Networks. | Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz |
| 2018 | WWW | Preferential Attachment as a Unique Equilibrium. | Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg |
| 2018 | SPAA | Wireless Expanders. | Shirel Attali, Merav Parter, David Peleg, Shay Solomon |
| 2018 | SIROCCO | Realizability of Graph Specifications: Characterizations and Algorithms. | Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz |
| 2018 | SIROCCO | Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup. | Tal Navon, David Peleg |
| 2017 | IJCAI | Maintaining Communication in Multi-Robot Tree Coverage. | Mor Sinay, Noa Agmon, Oleg Maksimov, Sarit Kraus, David Peleg |
| 2017 | KDD | Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks. | Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg |
| 2016 | SODA | Local-on-Average Distributed Tasks. | Merav Parter, David Peleg, Shay Solomon |
| 2016 | SODA | Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach. | David Peleg, Shay Solomon |
| 2016 | SIROCCO | Message Lower Bounds via Efficient Network Synchronization. | Gopal Pandurangan, David Peleg, Michele Scquizzato |
| 2015 | ESA | Improved Approximation Algorithms for Weighted 2-Path Partitions. | Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan |
| 2015 | FOCS | The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. | Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
| 2015 | ICALP | Core Size and Densification in Preferential Attachment Networks. | Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg |
| 2015 | SPAA | Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. | Merav Parter, David Peleg |
| 2015 | SIROCCO | Nearly Optimal Local Broadcasting in the SINR Model with Feedback. | Leonid Barenboim, David Peleg |
| 2014 | FUN | How Even Tiny Influence Can Have a Big Impact! | Barbara Keller, David Peleg, Roger Wattenhofer |
| 2014 | ICALP | Distributed Computing on Core-Periphery Networks: Axiom-Based Design. | Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg |
| 2014 | SODA | Fault Tolerant Approximate BFS Structures. | Merav Parter, David Peleg |
| 2013 | ESA | Secluded Connectivity Problems. | Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg |
| 2013 | ESA | Sparse Fault-Tolerant BFS Trees. | Merav Parter, David Peleg |
| 2013 | FCT | Randomized Distributed Decision (Invited Lecture Abstract). | David Peleg |
| 2013 | ICDCN | Sublinear Bounds for Randomized Leader Election. | Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan |
| 2013 | PODC | On the complexity of universal leader election. | Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan |
| 2013 | PODC | Efficient distributed source detection with limited bandwidth. | Christoph Lenzen, David Peleg |
| 2013 | SODA | Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. | Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
| 2012 | ICALP | Distributed Algorithms for Network Diameter and Girth. | David Peleg, Liam Roditty, Elad Tal |
| 2012 | SODA | SINR diagram with interference cancellation. | Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
| 2012 | SODA | Gathering despite mischief. | Yoann Dieudonn, Andrzej Pelc, David Peleg |
| 2012 | SPAA | Discovery through gossip. | Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun |
| 2012 | SIROCCO | The Fault Tolerant Capacitated k-Center Problem. | Shiri Chechik, David Peleg |
| 2012 | SIROCCO | Notions of Connectivity in Overlay Networks. | Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg |
| 2012 | WG | Fault Tolerant Additive Spanners. | Gilad Braunschvig, Shiri Chechik, David Peleg |
| 2012 | WG | Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance. | David Peleg |
| 2011 | FOCS | Local Distributed Decision. | Pierre Fraigniaud, Amos Korman, David Peleg |
| 2011 | INFOCOM | Distributed power control in the SINR model. | Zvi Lotker, Merav Parter, David Peleg, Yvonne-Anne Pignolet |
| 2011 | STOC | The topology of wireless communication. | Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
| 2011 | STOC | Distributed verification and hardness of distributed approximation. | Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer |
| 2011 | STACS | Tight Bounds For Distributed MST Verification. | Liah Kor, Amos Korman, David Peleg |
| 2011 | SIROCCO | SINR Maps: Properties and Applications. | David Peleg |
| 2011 | SOFSEM | On Approximating the | David Peleg, Ignasi Sau, Mordechai Shalom |
| 2010 | ESA | Untitled record | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
| 2010 | ICALP | Sparse Reliable Graph Backbones. | Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg |
| 2010 | PODC | Forbidden-set distance labels for graphs of bounded doubling dimension. | Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg |
| 2010 | STACS | Robust Fault Tolerant Uncapacitated Facility Location. | Shiri Chechik, David Peleg |
| 2010 | STACS | Relaxed Spanners for Directed Disk Graphs. | David Peleg, Liam Roditty |
| 2009 | PODC | SINR diagrams: towards algorithmically usable SINR models of wireless networks. | Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty |
| 2009 | STOC | Fault-tolerant spanners for general graphs. | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
| 2009 | SSS | As Good as It Gets: Competitive Fault Tolerance in Network Structures. | David Peleg |
| 2009 | WG | Low-Port Tree Representations. | Shiri Chechik, David Peleg |
| 2008 | HiPC | Towards Networked Computers: What Can Be Learned from Distributed Computing?. | David Peleg |
| 2008 | PODC | On the locality of distributed sparse spanner construction. | Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot |
| 2008 | PODC | On the effect of the deployment setting on broadcasting in Euclidean radio networks. | Yuval Emek, Erez Kantor, David Peleg |
| 2008 | SODA | A near-linear time algorithm for computing replacement paths in planar directed graphs. | Yuval Emek, David Peleg, Liam Roditty |
| 2008 | SIROCCO | Equal-Area Locus-Based Convex Polygon Decomposition. | David Adjiashvili, David Peleg |
| 2008 | WAOA | Degree-Constrained Subgraph Problems: Hardness and Approximation Results. | Omid Amini, David Peleg, Stphane Prennes, Ignasi Sau, Saket Saurabh |
| 2007 | ICDCIT | Time-Efficient Broadcasting in Radio Networks: A Review. | David Peleg |
| 2007 | PODC | Broadcasting in udg radio networks with unknown topology. | Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su |
| 2007 | SIROCCO | Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots. | Asaf Efrima, David Peleg |
| 2007 | SOFSEM | Distributed Models and Algorithms for Mobile Robot Systems. | Asaf Efrima, David Peleg |
| 2006 | CIAC | Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems. | Erez Kantor, David Peleg |
| 2006 | ICALP | Dynamic Routing Schemes for General Graphs. | Amos Korman, David Peleg |
| 2006 | ISAAC | Constructing Labeling Schemes Through Universal Matrices. | Amos Korman, David Peleg, Yoav Rodeh |
| 2006 | SODA | A tight upper bound on the probabilistic embedding of series-parallel graphs. | Yuval Emek, David Peleg |
| 2006 | STACS | Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. | Reuven Cohen, David Peleg |
| 2006 | SIROCCO | Local Algorithms for Autonomous Robot Systems. | Reuven Cohen, David Peleg |
| 2005 | ICALP | Label-Guided Graph Exploration by a Finite Automaton. | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
| 2005 | ICDCS | Adaptive Collaboration in Peer-to-Peer Systems. | Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle |
| 2005 | OPODIS | Distributed Algorithms for Systems of Autonomous Mobile Robots. | David Peleg |
| 2005 | PODC | Faster communication in known topology radio networks. | Leszek Gasieniec, David Peleg, Qin Xin |
| 2005 | PODC | Proof labeling schemes. | Amos Korman, Shay Kutten, David Peleg |
| 2005 | PODC | Feasibility and complexity of broadcasting with random transmission failures. | Andrzej Pelc, David Peleg |
| 2005 | SODA | Improved recommendation systems. | Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle |
| 2004 | ESA | Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. | Reuven Cohen, David Peleg |
| 2004 | MFCS | Graph Exploration by a Finite Automaton. | Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg |
| 2004 | SODA | Fault-tolerant gathering algorithms for autonomous mobile robots. | Noa Agmon, David Peleg |
| 2004 | SODA | Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. | Yuval Emek, David Peleg |
| 2004 | STACS | Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. | Christoph Ambhl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri |
| 2004 | SIROCCO | Robot Convergence via Center-of-Gravity Algorithms. | Reuven Cohen, David Peleg |
| 2004 | SIROCCO | Approximation Algorithm for Hotlink Assignment in the Greedy Model. | Rachel Matichin, David Peleg |
| 2003 | CIAC | Localized Network Representations. | David Peleg |
| 2003 | CIAC | Spanning Trees with Low Maximum/Average Stretch. | David Peleg |
| 2003 | ICALP | Labeling Schemes for Weighted Dynamic Trees. | Amos Korman, David Peleg |
| 2003 | ISAAC | Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract). | Ornan Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg |
| 2003 | SPAA | MST construction in O(log log n) communication rounds. | Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg |
| 2003 | WADS | Approximation Algorithm for Hotlink Assignments in Web Directories. | Rachel Matichin, David Peleg |
| 2002 | MFCS | Low Stretch Spanning Trees. | David Peleg |
| 2002 | SODA | Labeling schemes for flow and connectivity. | Michal Katz, Nir A. Katz, Amos Korman, David Peleg |
| 2002 | STACS | Labeling Schemes for Dynamic Tree Networks. | Amos Korman, David Peleg, Yoav Rodeh |
| 2002 | SRDS | Asynchronous Resource Discovery in Peer to Peer Networks. | Shay Kutten, David Peleg |
| 2001 | ESA | Approximate Distance Labeling Schemes. | Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg |
| 2001 | IPCO | Approximating k-Spanner Problems for k>2. | Michael Elkin, David Peleg |
| 2001 | PODC | Average probe complexity in quorum systems. | Yehuda Hassin, David Peleg |
| 2001 | PODC | Distributed MST for constant diameter graphs. | Zvi Lotker, Boaz Patt-Shamir, David Peleg |
| 2001 | SODA | Distance labeling in graphs. | Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz |
| 2001 | STOC | (1+epsilon, beta)-spanner constructions for general graphs. | Michael Elkin, David Peleg |
| 2001 | SPAA | Deterministic resource discovery in distributed networks. | Shay Kutten, David Peleg, Uzi Vishkin |
| 2001 | SIROCCO | The Client-Server 2-Spanner Problem with Applications to Network Design. | Michael Elkin, David Peleg |
| 2001 | WG | Small k-Dominating Sets in Planar Graphs with Applications. | Cyril Gavoille, David Peleg, Andr Raspaud, ric Sopena |
| 2000 | ICALP | Strong Inapproximability of the Basic | Michael Elkin, David Peleg |
| 2000 | MFCS | Informative Labeling Schemes for Graphs. | David Peleg |
| 2000 | PODC | Assigning labels in unknown anonymous networks (extended abstract). | Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes |
| 2000 | PODC | The wakeup problem in synchronous broadcast systems (extended abstract). | Leszek Gasieniec, Andrzej Pelc, David Peleg |
| 2000 | PODC | Sparse communication networks and efficient routing in the plane (extended abstract). | Yehuda Hassin, David Peleg |
| 2000 | PODC | Deterministic distributed resource discovery (brief announcement). | Shay Kutten, David Peleg |
| 2000 | STACS | The Hardness of Approximating Spanner Problems. | Michael Elkin, David Peleg |
| 2000 | STACS | Distance Labeling Schemes for Well-Separated Graph Classes. | Michal Katz, Nir A. Katz, David Peleg |
| 2000 | SIROCCO | Extremal bounds for probabilistic polling in graphs. | Yehuda Hassin, David Peleg |
| 1999 | ESA | Faster Exact Solutions for Some NP-Hard Problems. | Limor Drori, David Peleg |
| 1999 | FOCS | A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. | David Peleg, Vitaly Rubinovich |
| 1999 | ICALP | Distributed Probabilistic Polling and Applications to Proportionate Agreement. | Yehuda Hassin, David Peleg |
| 1999 | ICALP | A Variant of the Arrow Distributed Directory with Low Average Complexity. | David Peleg, Eilon Reshef |
| 1999 | ISAAC | Station Layouts in the Presence of Location Constraints. | Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg |
| 1999 | WG | Proximity-Preserving Labeling Schemes and Their Applications. | David Peleg |
| 1998 | ICALP | Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees. | David Peleg |
| 1998 | ICALP | Deterministic Polylog Approximation for Minimum Communication Spanning Trees. | David Peleg, Eilon Reshef |
| 1998 | PODC | Compact Routing Schemes with Low Stretch Factor (Extended Abstract). | Tamar Eilam, Cyril Gavoille, David Peleg |
| 1998 | SIROCCO | Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper). | Pilar de la Torre, Lata Narayanan, David Peleg |
| 1997 | SODA | Approximating Shallow-Light Trees (Extended Abstract). | Guy Kortsarz, David Peleg |
| 1997 | SIROCCO | Approximating Minimum Communication Spanning Trees. | David Peleg |
| 1997 | SIROCCO | Size Bounds for Dynamic Monopolies. | David Peleg |
| 1996 | PODC | The Complexity of Data Mining on the Web (Abstract). | Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg |
| 1996 | PODC | How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract). | David Peleg, Avishai Wool |
| 1996 | SIROCCO | Tight Bounds on the Size of 2-Monopolies. | Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes |
| 1996 | SIROCCO | Majority Voting, Coalitions and Monopolies in Graphs. | David Peleg |
| 1996 | WG | Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). | Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg |
| 1995 | FOCS | Tight Fault Locality (Extended Abstract). | Shay Kutten, David Peleg |
| 1995 | PODC | Fault-Local Distributed Mending (Extended Abstract). | Shay Kutten, David Peleg |
| 1995 | PODC | Fast Distributed Construction of k-Dominating Sets and Applications. | Shay Kutten, David Peleg |
| 1995 | PODC | Crumbling Walls: A Class of Practical and Efficient Quorum Systems (Extended Abstract). | David Peleg, Avishai Wool |
| 1995 | STOC | Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract). | Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg |
| 1995 | SIROCCO | The Power of Small Coalitions in Graphs. | Jean-Claude Bermond, David Peleg |
| 1995 | WADS | Load Balancing in Quorum Systems (Extended Abstract). | Ron Holzman, Yosi Marcus, David Peleg |
| 1994 | SODA | Generating Low-Degree 2-Spanners. | Guy Kortsarz, David Peleg |
| 1993 | FOCS | Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers | Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg |
| 1993 | FOCS | A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) | Juan A. Garay, Shay Kutten, David Peleg |
| 1993 | FOCS | On Choosing a Dense Subgraph (Extended Abstract) | Guy Kortsarz, David Peleg |
| 1992 | PODC | Fast Network Decomposition (Extended Abstract). | Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg |
| 1992 | STOC | Competitive Distributed Job Scheduling (Extended Abstract) | Baruch Awerbuch, Shay Kutten, David Peleg |
| 1992 | STOC | Adapting to Asynchronous Dynamic Networks (Extended Abstract) | Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks |
| 1991 | ICALP | The POwer of Reconfiguration. | Yosi Ben-Asher, David Peleg, Rajiv Ramaswami, Assaf Schuster |
| 1991 | INFOCOM | On Buffer-Economical Store-and-Forward Deadlock Prevention. | Baruch Awerbuch, Shay Kutten, David Peleg |
| 1991 | PODC | Broadcast with Partial Knowledge (Preliminary Version). | Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg |
| 1991 | PODC | Efficient Deadlock-Free Routing. | Baruch Awerbuch, Shay Kutten, David Peleg |
| 1991 | PODC | Compact Deterministic Distributed Dictionaries (Extended Abstract). | Karni Gilon, David Peleg |
| 1991 | SIGCOMM | Concurrent Online Tracking of Mobile Users. | Baruch Awerbuch, David Peleg |
| 1991 | WADS | Approximation Algorithms for Selecting Network Centers (Preliminary Vesion). | Judit Bar-Ilan, David Peleg |
| 1990 | FOCS | Sparse Partitions (Extended Abstract) | Baruch Awerbuch, David Peleg |
| 1990 | FOCS | Network Synchronization with Polylogarithmic Overhead | Baruch Awerbuch, David Peleg |
| 1990 | PODC | Cost-Sensitive Analysis of Communication Protocols. | Baruch Awerbuch, Alan E. Baratz, David Peleg |
| 1990 | STOC | Computing with Unreliable Information (Preliminary Version) | Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal |
| 1989 | STOC | On the Complexity of Radio Communication (Extended Abstract) | Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg |
| 1989 | STOC | Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) | Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg |
| 1988 | STOC | A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) | Danny Krizanc, David Peleg, Eli Upfal |
| 1988 | STOC | A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract) | David Peleg, Eli Upfal |
| 1987 | FOCS | Achievable Cases in an Asynchronous Environment (Extended Abstract) | Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rdiger Reischuk |
| 1987 | PODC | An Optimal Synchronizer for the Hypercube. | David Peleg, Jeffrey D. Ullman |
| 1987 | STOC | Constructing Disjoint Paths on Expander Graphs (Extended Abstract) | David Peleg, Eli Upfal |
| 1986 | FOCS | The Token Distribution Problem (Preliminary Version) | David Peleg, Eli Upfal |
| 1986 | PODC | On Fault Tolerant Routings in General Networks. | David Peleg, Barbara Simons |
| 1986 | STOC | Fault Tolerance in Networks of Bounded Degree (Preliminary Version) | Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal |
| 1985 | STOC | Concurrent Dynamic Logic (Extended Abstract) | David Peleg |