David Peleg

David Peleg 's AcademicInfluence.com Rankings

David Peleg

Computer Science

#2412

World Rank

#2519

Historical Rank

Database

#931

World Rank

#979

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is David Peleg Influential?

(Suggest an Edit or Addition)

According to Wikipedia, David Peleg is an Israeli computer scientist. He is a professor at the Weizmann Institute of Science, holding the Norman D. Cohen Professorial Chair of Computer Sciences, and the present dean of the Faculty of Mathematics and Computer Science in Weizmann Institute. His main research interests are algorithms, computer networks, and distributed computing. Many of his papers deal with a combination of all three.

(See a Problem?)

David Peleg 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Distributed Computing: A Locality-Sensitive Approach (1987) (1477)
The Dense k -Subgraph Problem (2001) (549)
An optimal synchronizer for the hypercube (1987) (428)
A trade-off between space and efficiency for routing tables (1989) (364)
Distance labeling in graphs (2001) (350)
A Lower Bound for Radio Broadcast (1991) (345)
Renaming in an asynchronous environment (1990) (329)
Distributed verification and hardness of distributed approximation (2010) (317)
Sparse partitions (1990) (297)
Computing with Noisy Information (1994) (294)
A Graph-Theoretic Game and Its Application to the k-Server Problem (1995) (290)
Randomized Broadcast in Networks (1990) (271)
Fault-tolerant gathering algorithms for autonomous mobile robots (2004) (268)
A sub-linear time distributed algorithm for minimum-weight spanning trees (1993) (247)
Concurrent online tracking of mobile users (1991) (235)
Fast Distributed Construction of Small k-Dominating Sets and Applications (1998) (221)
Local majorities, coalitions and monopolies in graphs: a review (2002) (204)
The Power of Reconfiguration (1991) (201)
Proof labeling schemes (2005) (186)
Routing with Polynomial Communication-Space Trade-Off (1992) (180)
Graph exploration by a finite automaton (2005) (179)
How to Allocate Network Centers (1993) (176)
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems (2004) (174)
Fault tolerance in networks of bounded degree (1986) (169)
A tradeoff between space and efficiency for routing tables (1988) (167)
Online tracking of mobile users (1995) (159)
Improved Routing Strategies with Succinct Tables (1990) (151)
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction (2000) (149)
(1+epsilon, beta)-Spanner Constructions for General Graphs (2004) (148)
Generating Sparse 2-Spanners (1992) (146)
The Availability of Quorum Systems (1995) (140)
On choosing a dense subgraph (1993) (136)
Cost-sensitive analysis of communication protocols (1990) (135)
Faster communication in known topology radio networks (2005) (134)
Compact and localized distributed data structures (2003) (134)
Compact distributed data structures for adaptive routing (1989) (132)
Proximity-preserving labeling schemes (2000) (130)
Broadcasting with locally bounded Byzantine faults (2005) (130)
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds (2005) (126)
Distributed Probabilistic Polling and Applications to Proportionate Agreement (1999) (126)
Concurrent dynamic logic (1985) (126)
(1 + εΒ)-spanner constructions for general graphs (2001) (125)
Size Bounds for Dynamic Monopolies (1998) (124)
Graph spanners (1989) (124)
Network synchronization with polylogarithmic overhead (1990) (124)
Labeling schemes for flow and connectivity (2002) (123)
Fault-Local Distributed Mending (1994) (116)
The token distribution problem (1989) (113)
Compact routing schemes with low stretch factor (2003) (112)
A trade-off between information and communication in broadcast protocols (1990) (112)
Crumbling walls: a class of practical and efficient quorum systems (1995) (110)
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements (2006) (108)
Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review (1996) (107)
Proximity-Preserving Labeling Schemes and Their Applications (1999) (103)
Time-Optimal Leader Election in General Networks (1990) (103)
Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges (2005) (101)
The Wakeup Problem in Synchronous Broadcast Systems (2000) (101)
Near-Linear Time Construction of Sparse Neighborhood Covers (1999) (100)
Local spreading algorithms for autonomous robot systems (2008) (100)
A near-tight lower bound on the time complexity of distributed MST construction (1999) (99)
Towards a complexity theory for local distributed computing (2013) (98)
Label-guided graph exploration by a finite automaton (2005) (96)
Fast distributed construction of k-dominating sets and applications (1995) (95)
Realtime Classification for Encrypted Traffic (2010) (93)
Informative labeling schemes for graphs (2000) (89)
Approximating the Weight of Shallow Steiner Trees (1999) (88)
Achievable cases in an asynchronous environment (1987) (86)
Polynomial time approximation schemes for base station coverage with minimum total radii (2005) (85)
Efficient distributed source detection with limited bandwidth (2013) (85)
Tight Bounds on Minimum Broadcast Networks (1991) (83)
Distributed Algorithms for Network Diameter and Girth (2012) (83)
Distributed MST for constant diameter graphs (2001) (82)
Robot Convergence via Center-of-Gravity Algorithms (2004) (78)
Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems (2000) (77)
MST construction in O(log log n) communication rounds (2003) (77)
Sphere packing and local majorities in graphs (1993) (76)
Generalized submodular cover problems and applications (2001) (75)
Feasibility and complexity of broadcasting with random transmission failures (2005) (74)
Square meshes are not always optimal (1989) (74)
Computing with unreliable information (1990) (71)
f-Sensitivity Distance Oracles and Routing Schemes (2010) (70)
Gathering Despite Mischief (2012) (70)
Approximation Algorithms for Minimum Time Broadcast (1992) (70)
Fault-tolerant spanners for general graphs (2009) (69)
Constructing disjoint paths on expander graphs (1987) (67)
The Power of Small Coalitions in Graphs (2003) (66)
Sublinear bounds for randomized leader election (2012) (64)
Fast Distributed Network Decompositions and Covers (1996) (64)
Sparse Partitions (Extended Abstract) (1990) (63)
Concurrent dynamic logic (1987) (62)
Homophily and the Glass Ceiling Effect in Social Networks (2015) (62)
Improved recommendation systems (2005) (60)
Feedback vertex set in hypercubes (2000) (60)
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs (2004) (59)
An approximation algorithm for minimum-cost network design (1994) (58)
Deterministic Polylog Approximation for Minimum Communication Spanning Trees (1998) (58)
Near-linear cost sequential and distributed constructions of sparse neighborhood covers (1993) (58)
SINR diagrams: towards algorithmically usable SINR models of wireless networks (2008) (57)
Communication in Concurrent Dynamic Logic (1987) (54)
Tight fault locality (1995) (54)
Approximating shallow-light trees (1997) (54)
Local Distributed Decision (2010) (54)
Fault-local distributed mending (extended abstract) (1995) (54)
Labeling Schemes for Dynamic Tree Networks (2002) (54)
Distributed algorithms for partitioning a swarm of autonomous mobile robots (2007) (53)
Adapting to asynchronous dynamic networks (extended abstract) (1992) (53)
On the locality of distributed sparse spanner construction (2008) (52)
Time-Efficient Broadcasting in Radio Networks: A Review (2007) (52)
Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach (2016) (52)
Distributed Models and Algorithms for Mobile Robot Systems (2007) (51)
Competitive distributed job scheduling (extended abstract) (1992) (49)
A time-randomness tradeoff for oblivious routing (1988) (47)
On the complexity of universal leader election (2013) (47)
The Hardness of Approximating Spanner Problems (1999) (47)
Bubbles: adaptive routing scheme for high-speed dynamic networks (1995) (45)
On the complexity of radio communication (1989) (44)
Adapting to Asynchronous Dynamic Networks (1992) (44)
Distance labeling schemes for well-separated graph classes (2000) (42)
Broadcasting in UDG radio networks with unknown topology (2007) (42)
Sparse Fault-Tolerant BFS Trees (2013) (42)
Sparse communication networks and efficient routing in the plane (2001) (42)
The Complexity of Reconfiguring Network Models (1992) (41)
Generating low-degree 2-spanners (1994) (41)
Randomized distributed decision (2012) (41)
The Generalized Packet Routing Problem (1987) (39)
Single Round Simulation on Radio Networks (1992) (39)
Distributed Data Structures: A Complexity-Oriented View (1991) (39)
Approximating k-Spanner Problems for k>2 (2001) (39)
Labeling schemes for weighted dynamic trees (2003) (38)
Fault-Tolerant Approximate BFS Structures (2014) (38)
On Static Logics, Dynamic Logics, and Complexity Classes (1984) (38)
Load Balancing in Quorum Systems (1997) (38)
Deterministic Resource Discovery in Distributed Networks (2001) (38)
On the Complexity of Universal Leader Election (2015) (37)
Strong Inapproximability of the Basic k-Spanner Problem (2000) (37)
A near-linear-time algorithm for computing replacement paths in planar directed graphs (2008) (36)
Degree-Constrained Subgraph Problems: Hardness and Approximation Results (2009) (36)
Compact routing schemes with low stretch factor (extended abstract) (1998) (35)
SINR Diagrams: Convexity and Its Applications in Wireless Networks (2012) (35)
A Tradeoff between Information and Communication in Broadcast Protocols (1988) (35)
Structure and algorithms in the SINR wireless model (2010) (35)
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks (2004) (34)
A Variant of the Arrow Distributed Directory with Low Average Complexity (1999) (33)
Approximation Algorithms for Minimum-Time Broadcast (1995) (32)
Low-Diameter Graph Decomposition Is in NC (1992) (31)
Process Logic with Regular Formulas (1985) (31)
Faster exact solutions for some NP-hard problems (1999) (31)
Distance-Dependent Distributed Directories (1993) (30)
The Compactness of Interval Routing (1999) (30)
Approximation Algorithms for Selecting Network Centers (Preliminary Vesion) (1991) (29)
Asynchronous resource discovery in peer to peer networks (2002) (29)
On Choosing a Dense Subgraph (Extended Abstract) (1993) (29)
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems (2002) (29)
Discovery Through Gossip (2012) (29)
Tight Bounds For Distributed MST Verification (2011) (29)
Graphs and Algorithms in Communication Networks (2010) (28)
On fault tolerant routings in general networks (1986) (28)
Fault tolerant additive and (μ, α)-spanners (2015) (28)
Collaboration of untrusting peers with changing interests (2004) (28)
Approximating bounded 0-1 integer linear programs (1993) (28)
On buffer-economical store-and-forward deadlock prevention (1991) (27)
Low Stretch Spanning Trees (2002) (27)
Time bounds on fault-tolerant broadcasting (1989) (27)
A generalized closure and complement phenomenon (1984) (27)
Local Algorithms for Autonomous Robot Systems (2006) (27)
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification (2013) (26)
Assigning Labels in Unknown Anonymous Networks (2000) (26)
Conflict-free coloring of unit disks (2009) (26)
Fault Tolerant Spanners for General Graphs (2010) (26)
The wakeup problem in synchronous broadcast systems (extended abstract) (2000) (25)
On the approximability of some degree-constrained subgraph problems (2012) (25)
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension (2010) (24)
The Client-Server 2-Spanner Problem with Applications to Network Design (1999) (24)
Fast network decomposition (1992) (24)
Local-on-Average Distributed Tasks (2016) (24)
Tight Bounds on the Size of 2-Monopolies (1996) (24)
Randomized approximation of bounded multicovering problems (1997) (24)
On the effect of the deployment setting on broadcasting in Euclidean radio networks (2008) (24)
Distributed distance computation and routing with small messages (2019) (23)
Exact Algorithms and Approximation Schemes for Base Station Placement Problems (2002) (23)
Greedy Packet Scheduling (1990) (23)
Small k-Dominating Sets in Planar Graphs with Applications (2001) (23)
Directed virtual path layouts in ATM networks (2003) (23)
Distributed Resource Allocation Algorithms (Extended Abstract) (1992) (22)
Time efficient k-shot broadcasting in known topology radio networks (2008) (22)
The Power of Recon guration (1998) (22)
Secluded Connectivity Problems (2012) (22)
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time (2007) (22)
Constructing Labeling Schemes through Universal Matrices (2006) (21)
Reducing human interactions in Web directory searches (2007) (21)
Low Stretch Spanning Trees for Planar Graphs (2001) (21)
Approximating k-spanner problems for kge2 (2005) (20)
Localized spanner construction for ad hoc networks with variable transmission range (2008) (20)
Local Computation of Nearly Additive Spanners (2009) (20)
Distributed power control in the SINR model (2011) (20)
Sparse communication networks and efficient routing in the plane (extended abstract) (2000) (20)
Distributed 3/2-Approximation of the Diameter (2014) (20)
Crumbling Walls: A Class of High Availability Quorum Systems (1994) (19)
Assigning labels in an unknown anonymous network with a leader (2001) (18)
Computing the fault tolerance of multi-agent deployment (2009) (18)
Robust fault tolerant uncapacitated facility location (2009) (18)
Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems (2009) (18)
Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract) (2003) (18)
Approximation algorithm for hotlink assignment in the greedy model (2004) (18)
The Compactness of Interval Routing for Almost All Graphs (1998) (17)
Labeling Schemes for Tree Representation (2005) (17)
Sparse Fault-Tolerant BFS Structures (2016) (17)
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract) (1996) (16)
A note on exact distance labeling (2011) (16)
Nearly Optimal Local Broadcasting in the SINR Model with Feedback (2015) (16)
Core-Periphery in Networks: An Axiomatic Approach (2014) (15)
The Topology of Wireless Communication (2011) (15)
Fault Tolerant Additive Spanners (2012) (14)
Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems (2006) (14)
SINR diagram with interference cancellation (2012) (14)
Energy and Time Efficient Broadcasting in Known Topology Radio Networks (2007) (14)
Dynamic Routing Schemes for General Graphs (2006) (14)
Assigning labels in unknown anonymous networks (extended abstract) (2000) (14)
Efficient deadlock-free routing (1991) (13)
A Note on Optimal Time Broadcast in Faulty Hypercubes (1995) (13)
A Time-Randomness Trade-Off for Oblivious Routing (1990) (13)
Core Size and Densification in Preferential Attachment Networks (2015) (13)
Approximation Algorithm for Hotlink Assignments in Web Directories (2003) (13)
The Availability of Crumbling Wall Quorum Systems (1997) (13)
The Token Distribution Problem (Preliminary Version) (1986) (12)
Dynamic routing schemes for graphs with low local density (2008) (12)
Distributed computing on core-periphery networks: Axiom-based design (2014) (12)
The Fault Tolerant Capacitated k-Center Problem (2012) (12)
Efficient k-shot broadcasting in radio networks (2009) (12)
Sparse reliable graph backbones (2010) (12)
Low Complexity Variants of the Arrow Distributed Directory (2001) (12)
Elites in social networks: An axiomatic approach to power balance and Price’s square root law (2018) (12)
Message Lower Bounds via Efficient Network Synchronization (2016) (11)
Realizability of Graph Specifications: Characterizations and Algorithms (2018) (11)
Brief Announcement : Distributed 3 / 2-Approximation of the Diameter Preliminary version of a brief announcement to appear at DISC ’ 14 (2014) (11)
The topology of wireless communication (2011) (11)
Average probe complexity in quorum systems (2001) (11)
Adaptive Collaboration in Peer-to-Peer Systems (2005) (10)
How Even Tiny Influence Can Have a Big Impact! (2014) (10)
Graph Immunity Against Local Influence (1996) (10)
Extremal bounds for probabilistic polling in graphs (2000) (9)
Upper Bounds on Broadcasting Time in UDG Radio Networks with Unknown Topology (2006) (9)
Fault Tolerance in Networks of Bounded Degree (Preliminary Version) (1986) (9)
Graph Profile Realizations and Applications to Social Networks (2018) (9)
Equal-area locus-based convex polygon decomposition (2008) (9)
Traffic-light scheduling on the grid (1994) (9)
MST construction inO(log logn) communication rounds (2003) (9)
As Good as It Gets: Competitive Fault Tolerance in Network Structures (2009) (9)
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication (2015) (9)
More on Looping vs. Repeating in Dynamic Logic (1985) (9)
A tight upper bound on the probabilistic embedding of series-parallel graphs (2006) (9)
Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees (1998) (8)
Mixed preferential attachment model: Homophily and minorities in social networks (2020) (8)
Optimal Broadcast with Partial Knowledge (1999) (8)
Preferential Attachment as a Unique Equilibrium (2018) (8)
Concurrent Program Schemes and Their Logics (1987) (8)
The Complexity of Recon guring Network ModelsY (1992) (8)
Compact Deterministic Distributed Dictionaries (1993) (8)
Majority vote and monopolies in social networks (2019) (8)
Distributed Graph Realizations † (2020) (8)
Compact separator decompositions in dynamic trees and applications to labeling schemes (2007) (8)
Immunity against Local Influence (2014) (8)
Deterministic distributed resource discovery (brief announcement) (2000) (8)
Fault-Tolerant Critical Section Management in Asynchronous Environments (1991) (8)
Notions of Connectivity in Overlay Networks (2012) (7)
Polylogarithmic Approximation for Minimum Communication Spanning Trees (1997) (7)
Station Layouts in the Presence of Location Constraints (1999) (7)
Concurrent Dynamic Logic (Extended Abstract) (1985) (7)
Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) (1989) (7)
On the maximum density of 0-1 matrices with no forbidden rectangles (1995) (7)
The Domination Game: Proving the 3/5 Conjecture on Isolate-Free Forests (2016) (6)
Random Preferential Attachment Hypergraph (2019) (6)
Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks (2017) (6)
Load Balancing in Quorum Systems (Extended Abstract) (1995) (6)
Broadcast with partial knowledge (preliminary version) (1991) (6)
Approximating Minimum Communication Spanning Trees (1997) (6)
Maintaining Communication in Multi-Robot Tree Coverage (2017) (6)
Generating Sparse 2spanners (2010) (6)
Improved Approximation for Min-Sum Vertex Cover (2006) (6)
Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff (2015) (6)
The fault-tolerant capacitated K-center problem (2015) (6)
Edge-disjoint spanners of complete graphs and complete digraphs (1999) (6)
On the Complexity of Radio Communication (Extended Abstract) (1989) (5)
Edinburgh Research Explorer Proof Systems for Retracts in Simply Typed Lambda Calculus (2013) (5)
Random Preferential Attachment Hypergraphs (2015) (5)
Improved Approximation Algorithms for Weighted 2-Path Partitions (2018) (5)
A note of omega-regular languages (1983) (5)
Routing with Polynomial Communication-space Tradeoo Baruch Awerbuch (1993) (5)
Fast Network Decomposition (Extended Abstract). (1992) (5)
Rigid and competitive fault tolerance for logical information structures in networks (2010) (4)
Time-Efficient Broadcast in Radio Networks (2010) (4)
Relaxed Spanners for Directed Disk Graphs (2009) (4)
Packet Distribution on a Ring (1989) (4)
On approximating the d-girth of a graph (2011) (4)
Forbidden-set distance labels for graphs of bounded doubling dimension (2010) (4)
Approximating Shallow-Light Trees (Extended Abstract) (1997) (4)
Computing with Unreliable Information (Preliminary Version) (1990) (4)
Labeling schemes for ow and connectivityMichal (2007) (4)
Efficiently Realizing Interval Sequences (2019) (4)
Faster Solutions for Exact Hitting and Exact SAT (1999) (4)
Social network analysis of program committees and paper acceptance fairness (2015) (4)
Elites in Social Networks: An Axiomatic Approach (2017) (4)
40th International Colloquium on Automata, Languages and Programming (2015) (4)
Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper) (1998) (4)
Labeling Schemes for Weighted Dynamic Trees ( Extended Abstract ) (2007) (4)
Nonuniform SINR+Voroni Diagrams Are Effectively Uniform (2015) (3)
Scheduling Jobs Using Common Resources (1996) (3)
Graph Realizations: Maximum Degree in Vertex Neighborhoods (2020) (3)
Distributed Algorithms for English Auctions (2000) (3)
Average stretch analysis of compact routing schemes (2007) (3)
Multipath Spanners via Fault-Tolerant Spanners (2012) (3)
Time-Space Tradeoffs for Set Operations (1993) (3)
Compact deterministic distributed dictionaries (extended abstract) (1991) (3)
Time-Efficient Broadcasting in Radio Networks (2007) (3)
Vertex-weighted realizations of graphs (2020) (3)
Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications (2013) (3)
Achievable Cases in an Asynchronous Environment (Extended Abstract) (1987) (3)
Tight Fault Locality (Extended Abstract) (1995) (3)
Assortative Mixing Equilibria in Social Network Games (2017) (2)
Hotelling Games with Multiple Line Faults (2019) (2)
On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph (2022) (2)
Hotelling Games with Random Tolerance Intervals (2019) (2)
Composed Degree-Distance Realizations of Graphs (2022) (2)
Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup (2018) (2)
Modeling and Analysis of Glass Ceiling and Power Inequality in Bi-populated Societies (2017) (2)
Minimum Neighboring Degree Realization in Graphs and Trees (2020) (2)
On the Relations Between SINR Diagrams and Voronoi Diagrams (2015) (2)
On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper) (2022) (2)
Sphere Packing and Local (1993) (2)
A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) (1988) (2)
The Average Hop Count Measure for Virtual Path Layouts (2001) (2)
Fault-Tolerant Hotelling Games (2018) (2)
Relaxed and Approximate Graph Realizations (2021) (2)
Singularly Optimal Randomized Leader Election (2020) (2)
Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings (2011) (2)
Fault-Tolerant Critical Section Management in Asynchronous Networks (1989) (2)
Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks (2006) (1)
Distributed Graph Realizations (2022) (1)
Near-Linear Cost Sequential and Distributed Constructions of SparseNeighborhood CoversBaruch Awerbuch (1993) (1)
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14-17, 1994 (1994) (1)
Energy-optimal online algorithms for broadcasting in wireless networks (2005) (1)
Information centre allocation (1994) (1)
Weighted Microscopic Image Reconstruction (2021) (1)
Collaboration of Untrusting Peers with Changing Interests (Extended Abstract) (2004) (1)
On social networks of program committees (2016) (1)
Generalized Perron-Frobenius Theorem for Nonsquare Matrices (2013) (1)
Cost-Sensitive Analysis of Communication Protocols (Extended Abstract) (1990) (1)
The topology of wireless communication on a line (2017) (1)
SINR Maps: Properties and Applications (2011) (1)
Fault Tolerant Approximate BFS Trees (2014) (1)
Adaptive Collaboration in Peer-to-Peer Systems (Extended Abstract) (2005) (1)
A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract) (1991) (1)
Virtual path layouts optimizing total hop count on ATM tree networks (2005) (1)
The Generalized Microscopic Image Reconstruction Problem (2022) (1)
Tight bounds for rumor spreading in graphs of a given conductance ∗ (2019) (1)
The complexity of data mining on the Web (1996) (1)
Majority Voting, Coalitions and Monopolies in Graphs (1996) (1)
8. Maximal Independent Sets (MIS) (2000) (1)
Singularly Near Optimal Leader Election in Asynchronous Networks (2021) (1)
Approximating Bounded 0-1 Integer Linear Programs (Extended Abstract) (1993) (1)
A rule format for unit elements (2009) (1)
Approximate Maxima Finding of Continuous Functions under Restricted Budget (1998) (1)
2021 Edsger W. Dijkstra Prize in Distributed Computing (2021) (0)
Optimal Broadcast with Partial Knowledge (Extended Abstract) (1995) (0)
26. Hierarchical Cluster-Based Routing (2000) (0)
On social networks of program committees (2016) (0)
Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
Approximate Distance Labeling Schemes (Extended Abstract) (2001) (0)
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification (2013) (0)
7. Vertex Coloring (2000) (0)
10. Local Queries and Local Resource Finding (2000) (0)
27. Regional Directories: Resource Finding Revisited (2000) (0)
Majority of Majorities on Regular Graphs with Loops (2022) (0)
The Power of Small Coalitions under Two-Tier Majority on Regular Graphs (2022) (0)
Processor Renaming in Asyncia Ronous Environments (1998) (0)
Game Theory for Networks (2017) (0)
25. Local Coordination: Synchronizers and MIS Revisited (2000) (0)
Directed Virtual Path Layouts in ATM Networks * ( Extended Abstract ) (1998) (0)
Proceedings of the 25th international conference on Distributed computing (2011) (0)
Fault Tolerant Approximate BFS Structures with Additive Stretch (2020) (0)
Brief Announcements Brief Announcement: Distributed MST in Core-Periphery Networks (2013) (0)
24. How Local are Global Tasks? MST Revisited (2000) (0)
Energy Efficient Online Algorithms for Broadcasting in Wireless Networks (2005) (0)
19. Proximity-Preserving Labeling Systems (2000) (0)
Constructing Disjoint Paths on Expander Graphs (Extended Abstract) (1987) (0)
The Power of Small Coalitions in GraphsJ (2007) (0)
Traffic-Light Scheduling on the Grid (Extended Abstract) (1992) (0)
Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II (2013) (0)
Recurrent Problems in the LOCAL model (2022) (0)
Randomized Distributed Decision (Invited Lecture Abstract) (2013) (0)
Structural Information and Communication Complexity (2012) (0)
On Vertex-Weighted Graph Realizations (2021) (0)
Vertex-Weighted Graphs: Realizable and Unrealizable Domains (2022) (0)
Deterministic Resource Discovery in Distributed Networks Extended Abstract] (2001) (0)
22. Efficient Algorithms for Constructing Network Decompositions (2000) (0)
On vertex-weighted realizations of acyclic and general graphs (2022) (0)
Com S 611 Spring Semester 2007 Discrete Algorithms for Mobile and Wireless Networks 1. " Loci: Local Clustering Service for Large Scale Wireless Sensor Networks " 2 Loci Paper 2.1 Introduction 2.2 Clustering (2007) (0)
Wireless Expanders (2018) (0)
Dynamic Routing Schemes for General Graphs ( Extended Abstract ) (0)
Computing the Fault Tolerant Capability of Multiagent Deployment (2008) (0)
15. Skeletal Representations: Spanning Trees, Tree Covers and Spanners (2000) (0)
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods (2019) (0)
5. Tree Constructions (2000) (0)
20. A Basic Algorithm for Constructing Network Partitions (2000) (0)
17. Light-Weight Spanners (2000) (0)
21. Efficient Algorithms for Constructing Covers (2000) (0)
Towards networked computers: what can be learned from distributed computing? (2008) (0)
Forcibly bipartite and acyclic (uni-)graphic sequences (2023) (0)
EATCS Distinguished Dissertation Award for 2020 (2021) (0)
The Hardness of Minimum Capacity Network Design (0)
Informative Labeling Schemes for Graphs (Extended Abstract) (2000) (0)
23. Exploiting Topological Knowledge: Broadcast Revisited (2000) (0)
Embedding Techniques for Distributed Dictionaries (1993) (0)
Budgeted Dominating Sets in Uncertain Graphs (2021) (0)
Testing the irreducibility of nonsquare Perron-Frobenius systems (2014) (0)
Distributed Computing Manuscript No. Compact and Localized Distributed Data Structures (2002) (0)
11. Clustered Representations: Clusters, Covers and Partitions (2000) (0)
Discrete Algorithms Seminar (2009) (0)
Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract) (1996) (0)
Little or No Impact 3 Information Services for Mobile Users (2007) (0)
Special issue on DISC 2011 (2013) (0)
Prize for innovation in distributed computing: awarded to Roger Wattenhofer (2013) (0)
3. Broadcast and Convergecast (2000) (0)
Localized Network Representations (2003) (0)
2. The Distributed Network Model (2000) (0)
Improved Recommendation Systems ∗ Extended (2005) (0)
Structure and effect on paper acceptance fairness (2016) (0)
Low-Port Tree Representations (2009) (0)
The Effect of Population Control Policies on Societal Fragmentation (2017) (0)
Improved Recommendation Systems ∗ Extended Abstract (0)
Selected Neighbor Degree Forest Realization (2021) (0)
9. Message Routing (2000) (0)
Distributed distance computation and routing with small messages (2018) (0)
Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
28. Additional Applications in Other Settings (2000) (0)
Square Meshes are (1991) (0)
Publishing House "Academic Publications": Founding Publisher Prof. Drumi Bainov Editorial Board (2015) (0)
f-Sensitivity Distance Oracles and Routing Schemes (2011) (0)
16. Sparse Spanners for Unweighted Graphs (2000) (0)
Distributed MST for Constant Diameter Graphs Extended (2001) (0)
Randomized distributed decision (2014) (0)
Secluded Connectivity Problems (2016) (0)
Approximation Algorithms for Minimum Energy Bounded Hop Strong Connectivity Range Assignment in Ad hoc Networks (2004) (0)
EÆ ient Algorithms for Low-EnergyBounded-Hop Broad ast in Ad-Ho Wireless Networks ( Extended Abstra t ) (2003) (0)
18. Spanners with Low Average Stretch (2000) (0)
Graph Realization of Distance Sets (2022) (0)
On the effect of the deployment setting on broadcasting in Euclidean radio networks (2016) (0)
13. Sparse Partitions (2000) (0)
Preface: Structural Information and Communication Complexity (2005) (0)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
4. Downcasts and Upcasts (2000) (0)
Relaxed Spanners for Directed Disk Graphs (2011) (0)
Labeling Schemes for Flow-Related Functions (2000) (0)
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm (2022) (0)
Preface (2007) (0)
Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance (2012) (0)
Special issue on DISC 2011 (2013) (0)
Hotelling games in fault-prone settings (2022) (0)
EATCS Distinguished Dissertation Award 2018 - Call for Nominations (2018) (0)
Spanning Trees with Low Maximum/Average Stretch (2003) (0)
14. Related Graph Representations (2000) (0)
Truth tellers and liars with fewer questions (2015) (0)
Processor Renaming in Asynchronous Environments. (1986) (0)
Distributed Algorithms for Systems of Autonomous Mobile Robots (2005) (0)

This paper list is powered by the following services:

Other Resources About David Peleg

What Schools Are Affiliated With David Peleg ?

David Peleg is affiliated with the following schools:

Weizmann Institute of Science