- Analysis and Experimental Evaluation of a simple Algorithm for Collaborative Filtering in Planted Partition Models
- Approximate Max kCut with Subgraph Guarantee Viggo Kann \Lambda Jens Lagergren y Alessandro Panconesi z
- Cuts and Disjoint Paths in the Valley-Free Path Model Thomas Erlebach
- Expansion Properties of (Secure) Wireless Networks Alessandro Panconesi Jaikumar Radhakrishnan y
- Packing Cycles in Undirected Graphs Alberto Caprara + Alessandro Panconesi y Romeo Rizzi o
- Hardness of Approximation Royal Institute of Technology, Stockholm
- Connectivity Properties of Secure Wireless Sensor Networks
- A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically
- Localized Techniques for Broadcasting in Wireless Sensor L. Orecchia
- Fast Distributed Algorithms for (Weakly) Connected Dominating Sets
- Concentration of Measure for the Analysis of Randomized Algorithms
- January 9, 2004 12:55 WSPC/INSTRUCTION FILE aml Journal of Bioinformatics and Computational Biology
- Experimental analysis of simple, distributed vertex coloring algorithms
- Fast Distributed Algorithms for BrooksVizing Colourings David A. Grable \Lambda
- On the Importance of Having an Identity or, is Consensus really Universal?
- Broadcasting in Wireless Sensor Networks via Sparse Devdatt Dubhashi
- An Experimental Study of a Simple, Distributed Edge Coloring MADHAV V. MARATHE 1 ALESSANDRO PANCONESI 2 LARRY D. RISINGER JR 3
- Concentration of Measure for the Analysis of Randomised Algorithms
- How to Design Connected Sensor Networks that Are Provably Secure
- On the distributed complexity of computing maximal matchings Micha/l Ha'n'ckowiak \Lambda
- PrimalDual Based Distributed Algorithms for Vertex Cover with SemiHard Capacities
- Irrigating Ad Hoc Networks in Constant Time D. Dubhashi, O. Haggstrom, C. Johansson
- Distributed Weighted Vertex Cover via Maximal Fabrizio Grandoni a,2,, Jochen Konemann b,1,
