The following pages link to David Peleg (Q244948):
Displaying 50 items.
- (Q172554) (redirect page) (← links)
- Feedback vertex set in hypercubes (Q294845) (← links)
- Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Testing the irreducibility of nonsquare Perron-Frobenius systems (Q402391) (← links)
- Sparse reliable graph backbones (Q418121) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Sublinear bounds for randomized leader election (Q477103) (← links)
- The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- The generalized packet routing problem (Q580964) (← links)
- Fast distributed network decompositions and covers (Q676658) (← links)
- The availability of crumbling wall quorum systems (Q678870) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Labeling schemes for dynamic tree networks (Q705063) (← links)
- Hotelling games with random tolerance intervals (Q776243) (← links)
- A generalized closure and complement phenomenon (Q795354) (← links)
- Weighted microscopic image reconstruction (Q831836) (← links)
- Broadcasting with locally bounded byzantine faults (Q835004) (← links)
- Computing the fault tolerance of multi-agent deployment (Q835818) (← links)
- Asynchronous resource discovery in peer-to-peer networks (Q856729) (← links)
- Feasibility and complexity of broadcasting with random transmission failures (Q868959) (← links)
- Average stretch analysis of compact routing schemes (Q875595) (← links)
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems (Q924541) (← links)
- Local spreading algorithms for autonomous robot systems (Q930905) (← links)
- Equal-area locus-based convex polygon decomposition (Q962170) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- Distributed algorithms for partitioning a swarm of autonomous mobile robots (Q1008735) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems (Q1026247) (← links)
- Conflict-free coloring of unit disks (Q1028125) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- On fault tolerant routings in general networks (Q1089309) (← links)
- Concurrent program schemes and their logics (Q1094866) (← links)
- Communication in concurrent dynamic logic (Q1095653) (← links)
- A lower bound for radio broadcast (Q1176103) (← links)
- Fault-tolerant critical section management in asynchronous environments (Q1183601) (← links)
- Time-space tradeoffs for set operations (Q1210542) (← links)
- Constructing disjoint paths on expander graphs (Q1262782) (← links)
- Size bounds for dynamic monopolies (Q1270828) (← links)
- Approximate maxima finding of continuous functions under restricted budget (Q1274326) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
- Traffic-light scheduling on the grid (Q1339892) (← links)
- Generalized submodular cover problems and applications (Q1589434) (← links)
- Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
- Low complexity variants of the arrow distributed directory (Q1604202) (← links)
- Nonuniform SINR+Voroni diagrams are effectively uniform (Q1664168) (← links)
