Alessandro Panconesi
Some recent and not so recent papers and manuscripts (I will be happy to provide you with a copy of those not directly available on this page).

• Concentration of Measure for the Analysis of Randomised Algorithms, Devdatt Dubhashi and Alessandro Panconesi. Cambridge University Press, 2009.
  Some praise about the book: Luca, Michael, and Richard Lipton
• Rumour spreading and graph conductance. Flavio Chierichetti, Silvio Lattanzi and Alessandro Panconesi. Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms, (SODA 2010)
• Models for the compressible Web. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, and Prabhakar Raghavan. Proceedings of the 50th Annual IEEE Symposium on the Foundations of Computer Science (FOCS 2009)
• On Compressing Social Networks. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, and Prabhakar Raghavan. Proceedings of the 15th ACM SIGKDD Conference On Knowledge Discovery and Data Mining (KDD 2009)
• Rumor Spreading in Social Networks. Flavio Chierichetti, Silvio Lattanzi and Alessandro Panconesi. Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009 - Track C)
• Unassailable Sensor Networks. Alessandro Mei, Alessandro Panconesi and Jaikumar Radhakrishnan. Proceedings of the 4th International Conference on Security and Privacy in Communication Networks (SecureComm 2008)
• Fast Distributed Scheduling via Primal-Dual. Alessandro Panconesi and Mauro Sozio. Proceedings of the 20th ACM Symposium on Parallelism in Algorithms and Architectures Munich, Germany, June 14 - 16, 2008 (SPAA 08)
• On Placing Skips Optimally In Expectation. Flavio Chierichetti, Silvio Lattanzi, Federico Mari, Alessandro Panconesi. Proceedings of the 1st ACM International Conference on Web Search and Data Mining (WSDM 2008)
• How to design connecetd sensor networks that are provably secure Roberto Di Pietro, Luigi Mancini, Alessandro Mei, Alessandro Panconesi and Jaikumar Radhakrishnan. Proceedings of SecureComm 2006, the 2nd IEEE/CreateNet International Conference on Security and Privacy in Communication Networks
• Localized protocols for ad hoc clustering and backbone formation: a performance comparison Stefano Basagni, Michele Mastrogiovanni, Alessandro Panconesi and Chiara Petrioli. IEEE Transactions on Parallel and Distributed Systems Special Issue - Localized Communication. April 2006, vol. 17, Nr. 4, 292--306

• Primal-Dual based Distributed Algorithms for Vertex Cover with Semi-Hard Capacities Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi and Mauro Sozio. Proceedings of Twenty-Fourth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2005)
• Irrigating Ad Hoc Networks in Constant Time D. Dubhashi, O. Häggström, C. Johansson, A. Panconesi and M. Sozio. Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 05)
• Blue Pleieades, a new solution for Device Discovery and Scatternet Formation in multi-hop Bluetooth networks Devdatt Dubhashi, Olle Häggström, Gabriele Mambrini, Alessandro Panconesi and Chiara Petrioli. ACM-Kluwer Wireless Networks.
• Transcriptional Response of Human Umbilical Vein Endothelial Cells to Low Doses of Ionizing Radiation. Vincenzo Lanza, Valeria Pretazzoli, Gregorio Olivieri, Giuseppe Pascarella, Alessandro Panconesi, Rodolfo Negri. Accepted for publication in The Journal of Radiation Research
• Broadcasting in wireless sensor networks via sparse overlays. Devdatt Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli and Andrea Vitaletti. To appear in a special issue of Algorithmica devoted to algorithms for wireless networks.
• Localized techniques for broadcasting in wireless sensor networks. Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli and Andrea Vitaletti. Proceedings of ACM Dial-M POMC 2004, the Joint Workshop on Foundations of Mobile Computing.
• Connectivity properties of secure sensor networks Roberto Di Pietro, Luigi Mancini, Alessandro Mei, Alessandro Panconesi and Jaikumar Radhakrishnan. Proceedings of the 2004 ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN '04)
• Fast Hare: a Fast Heuristic for Single Individual SNP Haplotype Reconstruction Alessandro Panconesi and Mauro Sozio. Proceedings of WABI 2004, LNCS Springer-Verlag.
• Distributed Weighted Vertex Cover via Maximal Matchings Fabrizio Grandoni, Jochen Könemann and Alessandro Panconesi. In Proceedings of Cocoon 05.
• Expansion properties of (secure) wireless networks Alessandro Panconesi and Jaikumar Radhakrishnan. Proceedings of SPAA 04, the 2004 ACM Symposium on Parallel Algorithms and Architectures.
• Cuts and disjoint in the valley-free path model T.Erlebach, A.Hall, A.Panconesi and D.Vukadinovic. In Proceedings of CAAN 04, the Workshop on Combinatorial and Algorithmic Aspects of Networking, LNCS Springer-Verlag.
• A new approach to device discovery and scatternet formation in Bluetooth Networks. F. Ferraguto, G. Mambrini, A. Panconesi, C. Petrioli. Proceedings of the International Workshop on Wireless, Mobile, and Ad Hoc Networks (WMAN04, an IEEE IPDPS 2004 workshop), Santa Fe, aprile 2003.
• Ancestral Maximum Likelihood of Phylogenetic Trees is Hard L.Addario-Berry, B.Chor, M.Hallett, J.Lagergren, A.Panconesi and T.Wareham. Journal of Bioinformatics and Computational Biology, January 2004, 12:55
• Collaborative Filtering in Planted Partition Models D.Dubhashi, L.Laura and A.Panconesi. Proceedings of FSTTCS 2003, LNCS Springer-Verlag.
• Packing Cycles in Undirected Graphs Alberto Caprara, Alessandro Panconesi and Romeo Rizzi. Journal of Algorithms, 48 (2003) 239--256
• Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons Devdatt Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, and Aravind Srinivasan. Proceedings of the Fourteenth ACM-SIAM Symposium on Discrete Algorithms, (SODA 03), Baltimore, USA. Accepted for publications in Journal of Computer and System Sciences.
• An experimental study of simple, distributed vertex colouring algorithms Irene Finocchi, Alessandro Panconesi and Riccardo Silvestri, Proceedings of the Thirteenth ACM-SIAM Symposium on Discrete Algorithms, (SODA 02), San Francisco, USA. Published in Algorithmica.
• An experimental study of a simple, distributed edge colouring algorithms Madhav Marathe, Alessandro Panconesi and Larry D. Risinger, in Proceedings of Eleventh ACM Symposium on Parallel Algorithms and Architectures (SPAA 00), July 9-13, 2000, Bar Harbor, Maine, USA. Accepted for publication in the the ACM Journal of Experimental Algorithmics.
• On the importance of having an identity or, is consensus really universal? Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri and Paul Vitanyi. Distributed Computing (2006) 18, 167-176
• A faster distributed algorithm for computing maximal matchings deterministically, Michal Hanckoviak, Michal Karonski and Alessandro Panconesi, in Proceedings of PODC 99, the Eighteenth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.
• Fast Distributed Algorithms for Brooks-Vizing Colourings, David Grable and Alessandro Panconesi, in Proceedings of SODA 98, the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 473-480. Invited to appear in the special issue of Journal of Algorithms dedicated to the best papers of SODA 98.
• On the distributed complexity of computing maximal matchings, Michal Hanckoviak, Michal Karonski and Alessandro Panconesi, in Proceedings of SODA 98, the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 219-225.
• Hardness of Approximations, Viggo Kann and Alessandro Panconesi, Chapter 2 of Annotated Bibliographies in Combinatorial Optimization, M . Dell'Amico, F. Maffioli and S. Martello Editors, John Wiley & Sons, 1997.
• Approximate Max k-Cut with Subgraph Guarantee, Viggo Kann, Jens Lagergren and Alessandro Panconesi, Information Processing Letters, 65 (1998) 145--190
• Nearly optimal distributed edge colouring in O(log log n) rounds , David Grable and Alessandro Panconesi, Random Structures and Algorithms, Vol. 10, No. 3, pp. 385-405, May 1997.
• Nearly-optimal, distributed edge-colouring via the nibble method, Devdatt Dubhashi, David Grable and Alessandro Panconesi. Theoretical Computer Science 203 (1998) 225--251, a special issue for the best papers of ESA95, the 3rd European Symposium on Algorithms (ESA 95).
• Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds, Aravind Srinivasan and Alessandro Panconesi, SIAM Journal on Computing, Vol. 26, No. 2, pp. 350-368, April 1997
• On the hardness of approximating Max k-Cut and its dual, , Viggo Kann, Sajneev Khanna, Jens Lagergren and Alessandro Panconesi, The Chicago Journal of Theoretical Computer Science, 3 June 1997.
• On the complexity of Distributed Network Decomposition Alessandro Panconesi and Aravind Srinivasan. Journal of Algorithms 20, 356--374 (1996).
• The Local Nature of Delta-coloring and Its Algorithmic Applications, Aravind Srinivasan and Alessandro Panconesi, Combinatorica 15 (2) 1995, pp. 255-280.
• Improved Distributed Algorithms for Coloring and Network Decomposition Problems Aravind Srinivasan and Alessandro Panconesi, in Proceedings of the 24th ACM-SIGACT Symposium on Theory of Computing, May 1992 (STOC 92). (Best Student Paper Award)
• Quantifiers and Approximation, Alessandro Panconesi and Desh Ranjan. Theoretical Computer Science 107 (1993), pp. 145--163, a special issue dedicated to the best papers of the 1990 ACM conference on Structural Complexity Theory. Extended abstract in Proceedings of STOC 90.

Back to home page

Alessandro Panconesi
Some recent and not so recent papers and manuscripts (I will be happy to provide you with a copy of those not directly available on this page).

• Concentration of Measure for the Analysis of Randomised Algorithms, Devdatt Dubhashi and Alessandro Panconesi. Cambridge University Press, 2009.
  Some praise about the book: Luca, Michael, and Richard Lipton
• Unassailable Sensor Networks. Alessandro Mei, Alessandro Panconesi and Jaikumar Radhakrishnan. Proceedings of the 4th International Conference on Security and Privacy in Communication Networks (SecureComm 2008)
• Fast Distributed Scheduling via Primal-Dual. Alessandro Panconesi and Mauro Sozio. Proceedings of the 20th ACM Symposium on Parallelism in Algorithms and Architectures Munich, Germany, June 14 - 16, 2008 (SPAA 08)
• On Placing Skips Optimally In Expectation. Flavio Chierichetti, Silvio Lattanzi, Federico Mari, Alessandro Panconesi. Proceedings of the 1st ACM International Conference on Web Search and Data Mining (WSDM 2008)
• How to design connecetd sensor networks that are provably secure Roberto Di Pietro, Luigi Mancini, Alessandro Mei, Alessandro Panconesi and Jaikumar Radhakrishnan. Proceedings of SecureComm 2006, the 2nd IEEE/CreateNet International Conference on Security and Privacy in Communication Networks
• Localized protocols for ad hoc clustering and backbone formation: a performance comparison Stefano Basagni, Michele Mastrogiovanni, Alessandro Panconesi and Chiara Petrioli. IEEE Transactions on Parallel and Distributed Systems Special Issue - Localized Communication. April 2006, vol. 17, Nr. 4, 292--306

• Primal-Dual based Distributed Algorithms for Vertex Cover with Semi-Hard Capacities Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi and Mauro Sozio. Proceedings of Twenty-Fourth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2005)
• Irrigating Ad Hoc Networks in Constant Time D. Dubhashi, O. Häggström, C. Johansson, A. Panconesi and M. Sozio. Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 05)
• Blue Pleieades, a new solution for Device Discovery and Scatternet Formation in multi-hop Bluetooth networks Devdatt Dubhashi, Olle Häggström, Gabriele Mambrini, Alessandro Panconesi and Chiara Petrioli. ACM-Kluwer Wireless Networks.
• Transcriptional Response of Human Umbilical Vein Endothelial Cells to Low Doses of Ionizing Radiation. Vincenzo Lanza, Valeria Pretazzoli, Gregorio Olivieri, Giuseppe Pascarella, Alessandro Panconesi, Rodolfo Negri. Accepted for publication in The Journal of Radiation Research
• Broadcasting in wireless sensor networks via sparse overlays. Devdatt Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli and Andrea Vitaletti. To appear in a special issue of Algorithmica devoted to algorithms for wireless networks.
• Localized techniques for broadcasting in wireless sensor networks. Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli and Andrea Vitaletti. Proceedings of ACM Dial-M POMC 2004, the Joint Workshop on Foundations of Mobile Computing.
• Connectivity properties of secure sensor networks Roberto Di Pietro, Luigi Mancini, Alessandro Mei, Alessandro Panconesi and Jaikumar Radhakrishnan. Proceedings of the 2004 ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN '04)
• Fast Hare: a Fast Heuristic for Single Individual SNP Haplotype Reconstruction Alessandro Panconesi and Mauro Sozio. Proceedings of WABI 2004, LNCS Springer-Verlag.
• Distributed Weighted Vertex Cover via Maximal Matchings Fabrizio Grandoni, Jochen Könemann and Alessandro Panconesi. In Proceedings of Cocoon 05.
• Expansion properties of (secure) wireless networks Alessandro Panconesi and Jaikumar Radhakrishnan. Proceedings of SPAA 04, the 2004 ACM Symposium on Parallel Algorithms and Architectures.
• Cuts and disjoint in the valley-free path model T.Erlebach, A.Hall, A.Panconesi and D.Vukadinovic. In Proceedings of CAAN 04, the Workshop on Combinatorial and Algorithmic Aspects of Networking, LNCS Springer-Verlag.
• A new approach to device discovery and scatternet formation in Bluetooth Networks. F. Ferraguto, G. Mambrini, A. Panconesi, C. Petrioli. Proceedings of the International Workshop on Wireless, Mobile, and Ad Hoc Networks (WMAN04, an IEEE IPDPS 2004 workshop), Santa Fe, aprile 2003.
• Ancestral Maximum Likelihood of Phylogenetic Trees is Hard L.Addario-Berry, B.Chor, M.Hallett, J.Lagergren, A.Panconesi and T.Wareham. Journal of Bioinformatics and Computational Biology, January 2004, 12:55
• Collaborative Filtering in Planted Partition Models D.Dubhashi, L.Laura and A.Panconesi. Proceedings of FSTTCS 2003, LNCS Springer-Verlag.
• Packing Cycles in Undirected Graphs Alberto Caprara, Alessandro Panconesi and Romeo Rizzi. Journal of Algorithms, 48 (2003) 239--256
• Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons Devdatt Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, and Aravind Srinivasan. Proceedings of the Fourteenth ACM-SIAM Symposium on Discrete Algorithms, (SODA 03), Baltimore, USA. Accepted for publications in Journal of Computer and System Sciences.
• An experimental study of simple, distributed vertex colouring algorithms Irene Finocchi, Alessandro Panconesi and Riccardo Silvestri, Proceedings of the Thirteenth ACM-SIAM Symposium on Discrete Algorithms, (SODA 02), San Francisco, USA. Published in Algorithmica.
• An experimental study of a simple, distributed edge colouring algorithms Madhav Marathe, Alessandro Panconesi and Larry D. Risinger, in Proceedings of Eleventh ACM Symposium on Parallel Algorithms and Architectures (SPAA 00), July 9-13, 2000, Bar Harbor, Maine, USA. Accepted for publication in the the ACM Journal of Experimental Algorithmics.
• On the importance of having an identity or, is consensus really universal? Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri and Paul Vitanyi. Distributed Computing (2006) 18, 167-176
• A faster distributed algorithm for computing maximal matchings deterministically, Michal Hanckoviak, Michal Karonski and Alessandro Panconesi, in Proceedings of PODC 99, the Eighteenth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.
• Fast Distributed Algorithms for Brooks-Vizing Colourings, David Grable and Alessandro Panconesi, in Proceedings of SODA 98, the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 473-480. Invited to appear in the special issue of Journal of Algorithms dedicated to the best papers of SODA 98.
• On the distributed complexity of computing maximal matchings, Michal Hanckoviak, Michal Karonski and Alessandro Panconesi, in Proceedings of SODA 98, the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 219-225.
• Hardness of Approximations, Viggo Kann and Alessandro Panconesi, Chapter 2 of Annotated Bibliographies in Combinatorial Optimization, M . Dell'Amico, F. Maffioli and S. Martello Editors, John Wiley & Sons, 1997.
• Approximate Max k-Cut with Subgraph Guarantee, Viggo Kann, Jens Lagergren and Alessandro Panconesi, Information Processing Letters, 65 (1998) 145--190
• Nearly optimal distributed edge colouring in O(log log n) rounds , David Grable and Alessandro Panconesi, Random Structures and Algorithms, Vol. 10, No. 3, pp. 385-405, May 1997.
• Nearly-optimal, distributed edge-colouring via the nibble method, Devdatt Dubhashi, David Grable and Alessandro Panconesi. Theoretical Computer Science 203 (1998) 225--251, a special issue for the best papers of ESA95, the 3rd European Symposium on Algorithms (ESA 95).
• Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds, Aravind Srinivasan and Alessandro Panconesi, SIAM Journal on Computing, Vol. 26, No. 2, pp. 350-368, April 1997
• On the hardness of approximating Max k-Cut and its dual, , Viggo Kann, Sajneev Khanna, Jens Lagergren and Alessandro Panconesi, The Chicago Journal of Theoretical Computer Science, 3 June 1997.
• On the complexity of Distributed Network Decomposition Alessandro Panconesi and Aravind Srinivasan. Journal of Algorithms 20, 356--374 (1996).
• The Local Nature of Delta-coloring and Its Algorithmic Applications, Aravind Srinivasan and Alessandro Panconesi, Combinatorica 15 (2) 1995, pp. 255-280.
• Improved Distributed Algorithms for Coloring and Network Decomposition Problems Aravind Srinivasan and Alessandro Panconesi, in Proceedings of the 24th ACM-SIGACT Symposium on Theory of Computing, May 1992 (STOC 92). (Best Student Paper Award)
• Quantifiers and Approximation, Alessandro Panconesi and Desh Ranjan. Theoretical Computer Science 107 (1993), pp. 145--163, a special issue dedicated to the best papers of the 1990 ACM conference on Structural Complexity Theory. Extended abstract in Proceedings of STOC 90.

Back to home page