The following pages link to Alessandro Panconesi (Q293219):
Displayed 50 items.
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Rumor spreading in social networks (Q541666) (← links)
- Completeness in approximation classes (Q811119) (← links)
- Inclusion relationships among permutation problems (Q1106217) (← links)
- Quantifiers and approximation (Q1208413) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- On the hardness of allocating frequencies for hybrid networks (Q1274935) (← links)
- Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) (← links)
- Trainyard is NP-hard (Q1623273) (← links)
- An experimental analysis of simple, distributed vertex coloring algorithms (Q1763143) (← links)
- The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705) (← links)
- On the importance of having an identity or, is consensus really universal? (Q1953645) (← links)
- Tracks from hell -- when finding a proof may be easier than checking it (Q2196558) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Localized techniques for broadcasting in wireless sensor networks (Q2471711) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- (Q2766868) (← links)
- On the Distributed Complexity of Computing Maximal Matchings (Q2784500) (← links)
- Rumor Spreading in Random Evolving Graphs (Q2849323) (← links)
- Almost tight bounds for rumour spreading with conductance (Q2875167) (← links)
- A faster distributed algorithm for computing maximal matchings deterministically (Q2942765) (← links)
- Expansion properties of (secure) wireless networks (Q3189062) (← links)
- Tracks from hell - When finding a proof may be easier than checking it (Q3305722) (← links)
- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation (Q3527213) (← links)
- Low degree connectivity of ad-hoc networks via percolation (Q3578044) (← links)
- A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover (Q3631893) (← links)
- Rumor Spreading in Social Networks (Q3638107) (← links)
- On Active Attacks on Sensor Network Key Distribution Schemes (Q3654148) (← links)
- (Q3817607) (← links)
- (Q4250185) (← links)
- (Q4250215) (← links)
- (Q4259987) (← links)
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds (Q4337636) (← links)
- Nearly optimal distributed edge coloring in O(log log n) rounds (Q4344228) (← links)
- (Q4398359) (← links)
- Packing cycles in undirected graphs (Q4458879) (← links)
- (Q4471362) (← links)
- Fast Distributed Algorithms for Brooks–Vizing Colorings (Q4512574) (← links)
- (Q4525687) (← links)
- Rumor Spreading and Conductance (Q4561504) (← links)
- On the Distortion of Locality Sensitive Hashing (Q4634022) (← links)
- The Distortion of Locality Sensitive Hashing (Q4638109) (← links)
- (Q4796199) (← links)
- Packing cuts in undirected graphs (Q4812395) (← links)
- (Q4828989) (← links)
- On the Complexity of Distributed Network Decomposition (Q4876697) (← links)
- Distributed weighted vertex cover via maximal matchings (Q4962764) (← links)
- Communities, Random Walks, and Social Sybil Defense (Q4985360) (← links)
- How to Schedule a Cascade in an Arbitrary Graph (Q5112587) (← links)
- (Q5137352) (← links)