The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Alessandro Panconesi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
    Wavelength rerouting in optical networks, or the Venetian routing problem. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:72-83 [Conf]
  2. Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic
    Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:49-62 [Conf]
  3. Alessandro Panconesi, Desh Ranjan
    Quantifiers and Approximation (Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:244- [Conf]
  4. Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi
    Distributed Weighted Vertex Cover via Maximal Matchings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:839-848 [Conf]
  5. L. Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti
    Localized techniques for broadcasting in wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2004, pp:41-51 [Conf]
  6. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    Packing Cycles and Cuts in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:512-523 [Conf]
  7. Devdatt P. Dubhashi, Alessandro Panconesi
    Near-Optimal Distributed Edge Coloring. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:448-459 [Conf]
  8. Pierluigi Crescenzi, Alessandro Panconesi
    Completeness in Approximation Classes. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:116-126 [Conf]
  9. Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
    Predicting deadlock in Store-and-Forward Networks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:123-142 [Conf]
  10. Devdatt P. Dubhashi, Luigi Laura, Alessandro Panconesi
    Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:168-182 [Conf]
  11. Fabrizio Ferraguto, Gabriele Mambrini, Alessandro Panconesi, Chiara Petrioli
    A New Approach to Device Discovery and Scatternet Formation in Bluetooth Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  12. Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi
    Randomized Wait-Free Naming. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:83-91 [Conf]
  13. Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi
    On the Hardness of Approximating Max k-Cut and Its Dual. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:61-67 [Conf]
  14. Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio
    Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:118-125 [Conf]
  15. Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
    A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:219-228 [Conf]
  16. Alessandro Panconesi, Aravind Srinivasan
    Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1992, pp:251-262 [Conf]
  17. Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan
    Connectivity properties of secure wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    SASN, 2004, pp:53-58 [Conf]
  18. Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
    Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:717-724 [Conf]
  19. Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
    Experimental analysis of simple, distributed vertex coloring algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:606-615 [Conf]
  20. David A. Grable, Alessandro Panconesi
    Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:278-285 [Conf]
  21. David A. Grable, Alessandro Panconesi
    Fast Distributed Algorithms for {Brooks-Vizing} Colourings. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:473-480 [Conf]
  22. Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
    On the Distributed Complexity of Computing Maximal Matchings. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:219-225 [Conf]
  23. Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio
    Irrigating ad hoc networks in constant time. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:106-115 [Conf]
  24. Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.
    An experimental study of a simple, distributed edge coloring algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:166-175 [Conf]
  25. Alessandro Panconesi, Jaikumar Radhakrishnan
    Expansion properties of (secure) wireless networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:281-285 [Conf]
  26. Alessandro Panconesi, Desh Ranjan
    Quantifiers and Approximation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:446-456 [Conf]
  27. Alessandro Panconesi, Aravind Srinivasan
    Improved Distributed Algorithms for Coloring and Network Decomposition Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:581-592 [Conf]
  28. Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
    Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:202-215 [Conf]
  29. Alessandro Panconesi, Mauro Sozio
    Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:266-277 [Conf]
  30. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
    On the Importance of Having an Identity or is Consensus Really Universal? [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:134-148 [Conf]
  31. Carlos Castillo, Alberto Nelli, Alessandro Panconesi
    A Memory-Efficient Strategy for Exploring the Web. [Citation Graph (0, 0)][DBLP]
    Web Intelligence, 2006, pp:680-686 [Conf]
  32. Ewa Malesinska, Alessandro Panconesi
    On the Hardness of Allocating Frequencies for Hybrid Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:308-322 [Conf]
  33. 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. [Citation Graph (0, 0)][DBLP]
    Research Results of the DICS Program, 2006, pp:260-274 [Conf]
  34. Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
    An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:1, pp:1-23 [Journal]
  35. Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi
    On the Hardness of Approximating Max k-Cut and its Dual. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1997, v:1997, n:, pp:- [Journal]
  36. Alessandro Panconesi, Aravind Srinivasan
    The Local Natur of Delta-Coloring and its Algorithmic Applications. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:2, pp:255-280 [Journal]
  37. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
    On the Importance of Having an Identity or, is Consensus really Universal? [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  38. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
    On the importance of having an identity or, is consensus really universal?. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:167-176 [Journal]
  39. Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi
    Randomized Naming Using Wait-Free Shared Variables. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1998, v:11, n:3, pp:113-124 [Journal]
  40. Alessandro Panconesi, Romeo Rizzi
    Some simple distributed algorithms for sparse networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:2, pp:97-100 [Journal]
  41. Pierluigi Crescenzi, Alessandro Panconesi
    Completeness in Approximation Classes [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:93, n:2, pp:241-262 [Journal]
  42. Viggo Kann, Jens Lagergren, Alessandro Panconesi
    Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:58, n:3, pp:105-110 [Journal]
  43. Viggo Kann, Jens Lagergren, Alessandro Panconesi
    Approximate Max k-Cut with Subgraph Guarantee. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:3, pp:145-150 [Journal]
  44. Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
    Wavelength rerouting in optical networks, or the Venetian Routing problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:93-125 [Journal]
  45. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    Packing cycles in undirected graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:239-256 [Journal]
  46. David A. Grable, Alessandro Panconesi
    Fast Distributed Algorithms for Brooks-Vizing Colorings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:1, pp:85-120 [Journal]
  47. Alessandro Panconesi, Aravind Srinivasan
    On the Complexity of Distributed Network Decomposition. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:2, pp:356-374 [Journal]
  48. Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
    Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2004, v:2, n:2, pp:257-272 [Journal]
  49. Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
    Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:4, pp:467-479 [Journal]
  50. Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.
    An experimental study of a simple, distributed edge-coloring algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2004, v:9, n:, pp:- [Journal]
  51. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    Packing cuts in undirected graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:1, pp:1-11 [Journal]
  52. David A. Grable, Alessandro Panconesi
    Nearly optimal distributed edge coloring in O(log log n) rounds. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:3, pp:385-405 [Journal]
  53. Tibor Jordán, Alessandro Panconesi
    Preface. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:3, pp:261- [Journal]
  54. Alessandro Panconesi, Aravind Srinivasan
    Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:350-368 [Journal]
  55. Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
    On the Distributed Complexity of Computing Maximal Matchings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:15, n:1, pp:41-57 [Journal]
  56. Devdatt P. Dubhashi, David A. Grable, Alessandro Panconesi
    Near-Optimal, Distributed Edge Colouring via the Nibble Method. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:2, pp:225-251 [Journal]
  57. Ewa Malesinska, Alessandro Panconesi
    On the Hardness of Allocating Frequences for Hybrid Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:347-363 [Journal]
  58. Alessandro Panconesi, Desh Ranjan
    Quantifiers and Approximation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:107, n:1, pp:145-163 [Journal]
  59. Stefano Basagni, Michele Mastrogiovanni, Alessandro Panconesi, Chiara Petrioli
    Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:4, pp:292-306 [Journal]
  60. Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi
    Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:206-217 [Conf]
  61. Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal
    Finding near neighbors through cluster pruning. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:103-112 [Conf]
  62. Alessandro Panconesi
    Fast Distributed Algorithms Via Primal-Dual (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:1-6 [Conf]
  63. Alessandro Panconesi
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:215- [Journal]
  64. 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. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2007, v:13, n:1, pp:107-125 [Journal]

  65. On Active Attacks on Sensor Network Key Distribution Schemes. [Citation Graph (, )][DBLP]


  66. Gossiping (via mobile?) in social networks. [Citation Graph (, )][DBLP]


  67. Models for the Compressible Web. [Citation Graph (, )][DBLP]


  68. Rumor Spreading in Social Networks. [Citation Graph (, )][DBLP]


  69. On compressing social networks. [Citation Graph (, )][DBLP]


  70. Rumour Spreading and Graph Conductance. [Citation Graph (, )][DBLP]


  71. Fast distributed scheduling via primal-dual. [Citation Graph (, )][DBLP]


  72. Almost tight bounds for rumour spreading with conductance. [Citation Graph (, )][DBLP]


  73. On placing skips optimally in expectation. [Citation Graph (, )][DBLP]


  74. Localized Techniques for Broadcasting in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002