Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alessandro Panconesi
2010 – today
- 2013
[e3]Stefano Leonardi, Alessandro Panconesi, Paolo Ferragina, Aristides Gionis (Eds.): Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, Rome, Italy, February 4-8, 2013. ACM 2013, ISBN 978-1-4503-1869-3- [i2]Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri: Rumor Spreading in Random Evolving Graphs. CoRR abs/1302.3828 (2013)
- 2012
- [j37]Marcos K. Aguilera, Dahlia Malkhi, Keith Marzullo, Alessandro Panconesi, Andrzej Pelc, Roger Wattenhofer: Announcing the 2012 Edsger W. Dijkstra prize in distributed computing. SIGARCH Computer Architecture News 40(4): 1-2 (2012)
- [j36]Alessandro Panconesi, Jaikumar Radhakrishnan: Expansion properties of (secure) wireless networks. ACM Transactions on Algorithms 8(3): 21 (2012)
- [c48]Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi: How to schedule a cascade in an arbitrary graph. ACM Conference on Electronic Commerce 2012: 355-368
- [e2]Darek Kowalski, Alessandro Panconesi (Eds.): ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012. ACM 2012, ISBN 978-1-4503-1450-3
- 2011
- [j35]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi: Rumor spreading in social networks. Theor. Comput. Sci. 412(24): 2602-2610 (2011)
- [c47]Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar: Milgram-routing in social networks. WWW 2011: 725-734
- 2010
- [j34]Alessandro Panconesi, Mauro Sozio: Fast primal-dual distributed algorithms for scheduling and matching problems. Distributed Computing 22(4): 269-283 (2010)
- [c46]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi: Rumour Spreading and Graph Conductance. SODA 2010: 1657-1663
- [c45]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi: Almost tight bounds for rumour spreading with conductance. STOC 2010: 399-408
2000 – 2009
- 2009
- [b1]Devdatt P. Dubhashi, Alessandro Panconesi: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press 2009, ISBN 978-0-521-88427-3, pp. I-XIV, 1-196
- [c44]Stefan Dziembowski, Alessandro Mei, Alessandro Panconesi: On Active Attacks on Sensor Network Key Distribution Schemes. ALGOSENSORS 2009: 52-63
- [c43]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan: Models for the Compressible Web. FOCS 2009: 331-340
- [c42]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi: Rumor Spreading in Social Networks. ICALP (2) 2009: 375-386
- [c41]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan: On compressing social networks. KDD 2009: 219-228
- 2008
- [j33]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. 38(3): 825-840 (2008)
- [j32]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed weighted vertex cover via maximal matchings. ACM Transactions on Algorithms 5(1) (2008)
- [j31]Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan: Redoubtable Sensor Networks. ACM Trans. Inf. Syst. Secur. 11(3) (2008)
- [c40]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi: Gossiping (via mobile?) in social networks. DIALM-POMC 2008: 27-28
- [c39]
- [c38]Flavio Chierichetti, Silvio Lattanzi, Federico Mari, Alessandro Panconesi: On placing skips optimally in expectation. WSDM 2008: 15-24
- [e1]Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi (Eds.): Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings. Lecture Notes in Computer Science 5035, Springer 2008, ISBN 978-3-540-68886-0
- 2007
- [j30]
- [j29]Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti: Localized Techniques for Broadcasting in Wireless Sensor Networks. Algorithmica 49(4): 412-446 (2007)
- [j28]Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic: Cuts and Disjoint Paths in the Valley-Free Model. Internet Mathematics 3(3): 333-359 (2007)
- [j27]Devdatt P. Dubhashi, Olle Häggström, Gabriele Mambrini, Alessandro Panconesi, Chiara Petrioli: Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks. Wireless Networks 13(1): 107-125 (2007)
- [c37]Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi: Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. ESA 2007: 206-217
- [c36]Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal: Finding near neighbors through cluster pruning. PODS 2007: 103-112
- [c35]Alessandro Panconesi: Fast Distributed Algorithms Via Primal-Dual (Extended Abstract). SIROCCO 2007: 1-6
- 2006
- [j26]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi: On the importance of having an identity or, is consensus really universal?. Distributed Computing 18(3): 167-176 (2006)
- [j25]Stefano Basagni, Michele Mastrogiovanni, Alessandro Panconesi, Chiara Petrioli: Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison. IEEE Trans. Parallel Distrib. Syst. 17(4): 292-306 (2006)
- [c34]Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic: Robustness of the Internet at the Topology and Routing Level. Research Results of the DICS Program 2006: 260-274
- [c33]Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan: Sensor Networks that Are Provably Resilient. SecureComm 2006: 1-10
- [c32]Carlos Castillo, Alberto Nelli, Alessandro Panconesi: A Memory-Efficient Strategy for Exploring the Web. Web Intelligence 2006: 680-686
- 2005
- [j24]Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. 71(4): 467-479 (2005)
- [c31]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed Weighted Vertex Cover via Maximal Matchings. COCOON 2005: 839-848
- [c30]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125
- [c29]Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio: Irrigating ad hoc networks in constant time. SPAA 2005: 106-115
- 2004
- [j23]Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri: An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. Algorithmica 41(1): 1-23 (2004)
- [j22]Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham: Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinformatics and Computational Biology 2(2): 257-272 (2004)
- [j21]Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.: An experimental study of a simple, distributed edge-coloring algorithm. ACM Journal of Experimental Algorithmics 9 (2004)
- [j20]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi: Packing cuts in undirected graphs. Networks 44(1): 1-11 (2004)
- [c28]Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic: Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. CAAN 2004: 49-62
- [c27]Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti: Localized techniques for broadcasting in wireless sensor networks. DIALM-POMC 2004: 41-51
- [c26]Fabrizio Ferraguto, Gabriele Mambrini, Alessandro Panconesi, Chiara Petrioli: A New Approach to Device Discovery and Scatternet Formation in Bluetooth Networks. IPDPS 2004
- [c25]Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan: Connectivity properties of secure wireless sensor networks. SASN 2004: 53-58
- [c24]Alessandro Panconesi, Jaikumar Radhakrishnan: Expansion properties of (secure) wireless networks. SPAA 2004: 281-285
- [c23]Alessandro Panconesi, Mauro Sozio: Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction. WABI 2004: 266-277
- 2003
- [j19]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi: Packing cycles in undirected graphs. J. Algorithms 48(1): 239-256 (2003)
- [c22]Devdatt P. Dubhashi, Luigi Laura, Alessandro Panconesi: Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. FSTTCS 2003: 168-182
- [c21]Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. SODA 2003: 717-724
- [c20]Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham: Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI 2003: 202-215
- 2002
- [j18]Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan: Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms 45(2): 93-125 (2002)
- [j17]
- [c19]Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri: Experimental analysis of simple, distributed vertex coloring algorithms. SODA 2002: 606-615
- [i1]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi: On the Importance of Having an Identity or, is Consensus really Universal? CoRR cs.DC/0201006 (2002)
- 2001
- [j16]Alessandro Panconesi, Romeo Rizzi: Some simple distributed algorithms for sparse networks. Distributed Computing 14(2): 97-100 (2001)
- [j15]Michal Hanckowiak, Michal Karonski, Alessandro Panconesi: On the Distributed Complexity of Computing Maximal Matchings. SIAM J. Discrete Math. 15(1): 41-57 (2001)
- [c18]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi: Packing Cycles and Cuts in Undirected Graphs. ESA 2001: 512-523
- 2000
- [j14]David A. Grable, Alessandro Panconesi: Fast Distributed Algorithms for Brooks-Vizing Colorings. J. Algorithms 37(1): 85-120 (2000)
- [c17]Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan: Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX 2000: 72-83
- [c16]Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.: An experimental study of a simple, distributed edge coloring algorithm. SPAA 2000: 166-175
- [c15]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi: On the Importance of Having an Identity or is Consensus Really Universal? DISC 2000: 134-148
1990 – 1999
- 1999
- [c14]Michal Hanckowiak, Michal Karonski, Alessandro Panconesi: A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically. PODC 1999: 219-228
- 1998
- [j13]Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi: Randomized Naming Using Wait-Free Shared Variables. Distributed Computing 11(3): 113-124 (1998)
- [j12]Viggo Kann, Jens Lagergren, Alessandro Panconesi: Approximate Max k-Cut with Subgraph Guarantee. Inf. Process. Lett. 65(3): 145-150 (1998)
- [j11]Devdatt P. Dubhashi, David A. Grable, Alessandro Panconesi: Near-Optimal, Distributed Edge Colouring via the Nibble Method. Theor. Comput. Sci. 203(2): 225-251 (1998)
- [j10]Ewa Malesinska, Alessandro Panconesi: On the Hardness of Allocating Frequences for Hybrid Networks. Theor. Comput. Sci. 209(1-2): 347-363 (1998)
- [c13]Michal Hanckowiak, Michal Karonski, Alessandro Panconesi: On the Distributed Complexity of Computing Maximal Matchings. SODA 1998: 219-225
- [c12]David A. Grable, Alessandro Panconesi: Fast Distributed Algorithms for {Brooks-Vizing} Colourings. SODA 1998: 473-480
- 1997
- [j9]Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi: On the Hardness of Approximating Max k-Cut and its Dual. Chicago J. Theor. Comput. Sci. 1997 (1997)
- [j8]David A. Grable, Alessandro Panconesi: Nearly optimal distributed edge coloring in O(log log n) rounds. Random Struct. Algorithms 10(3): 385-405 (1997)
- [j7]Alessandro Panconesi, Aravind Srinivasan: Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds. SIAM J. Comput. 26(2): 350-368 (1997)
- [c11]David A. Grable, Alessandro Panconesi: Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds. SODA 1997: 278-285
- 1996
- [j6]Viggo Kann, Jens Lagergren, Alessandro Panconesi: Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. Inf. Process. Lett. 58(3): 105-110 (1996)
- [j5]Alessandro Panconesi, Aravind Srinivasan: On the Complexity of Distributed Network Decomposition. J. Algorithms 20(2): 356-374 (1996)
- [c10]Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi: On the Hardness of Approximating Max k-Cut and Its Dual. ISTCS 1996: 61-67
- [c9]Ewa Malesinska, Alessandro Panconesi: On the Hardness of Allocating Frequencies for Hybrid Networks. WG 1996: 308-322
- 1995
- [j4]Alessandro Panconesi, Aravind Srinivasan: The Local Natur of Delta-Coloring and its Algorithmic Applications. Combinatorica 15(2): 255-280 (1995)
- [c8]Devdatt P. Dubhashi, Alessandro Panconesi: Near-Optimal Distributed Edge Coloring. ESA 1995: 448-459
- 1994
- [c7]Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi: Randomized Wait-Free Naming. ISAAC 1994: 83-91
- 1993
- [j3]Alessandro Panconesi, Desh Ranjan: Quantifiers and Approximation. Theor. Comput. Sci. 107(1): 145-163 (1993)
- 1992
- [c6]Alessandro Panconesi, Aravind Srinivasan: Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract). PODC 1992: 251-262
- [c5]Alessandro Panconesi, Aravind Srinivasan: Improved Distributed Algorithms for Coloring and Network Decomposition Problems. STOC 1992: 581-592
- 1991
- [j2]Pierluigi Crescenzi, Alessandro Panconesi: Completeness in Approximation Classes. Inf. Comput. 93(2): 241-262 (1991)
- 1990
- [j1]Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi: Predicting deadlock in store-and-forward networks. Networks 20(7): 861-881 (1990)
- [c4]Alessandro Panconesi, Desh Ranjan: Quantifiers and Approximation (Abstract). Structure in Complexity Theory Conference 1990: 244
- [c3]Alessandro Panconesi, Desh Ranjan: Quantifiers and Approximation (Extended Abstract). STOC 1990: 446-456
1980 – 1989
- 1989
- [c2]
- 1988
- [c1]Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi: Predicting deadlock in Store-and-Forward Networks. FSTTCS 1988: 123-142
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-02 19:25 CET by the dblp team