Sfoglia per Autore
Improved Distributed Algorithms for Coloring and Network Decomposition Problems
1992 Panconesi, Alessandro; Aravind, Srinivasan
Quantifiers and approximation
1993 Panconesi, Alessandro; Ranjan,
Completeness in approximation classes
1993 Crescenzi, ; Panconesi, Alessandro
The local nature of Delta-colorings and its algorithmic applications
1995 Panconesi, Alessandro; Srinivasan,
Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds
1997 Panconesi, Alessandro; Srinivasan,
Nearly optimal distributed edge colouring in O(log log n) rounds
1997 Grable, D.; Panconesi, Alessandro
Hardness of Approximations
1997 Kann, V.; Panconesi, Alessandro
On the distributed complexity of computing maximal matchings
1998 Hanckowiack, M.; Karonski, M.; Panconesi, Alessandro
Near-Optimal, Distributed Edge Coloring via the Nibble Method
1998 Grable, D.; Dubhashi, D.; Panconesi, Alessandro
A faster distributed algorithm for computing maximal matchings deterministically
1999 Hanckowiack, M.; MICHAL KARONSKI, M.; Panconesi, Alessandro
Fast distributed algorithms for brooks-vizing colorings
2000 Grable, D.; Panconesi, Alessandro
On the importance of having an identity
2000 Buhrman, H.; Panconesi, Alessandro; Silvestri, Riccardo; Vitanyi, P.
Some simple distributed algorithms for sparse networks
2001 Panconesi, Alessandro; R., Rizzi
Wavelength rerouting in optical networks, or the Venetian Routing problem
2002 Italiano, Caprara; G., Mohan; Panconesi, Alessandro; Srinivasan,
Experimental analysis of simple, distributed vertex coloring algorithms
2002 Finocchi, Irene; Panconesi, Alessandro; Silvestri, Riccardo
On the Distributed Complexity of Computing Maximal Matchings
2002 Hanckowiak, M.; Karonski, M.; Panconesi, Alessandro
Fast distributed algorithms for (weakly) connected dominating sets and linear size skeletons
2003 Dubhashi, D; Mei, Alessandro; Panconesi, Alessandro; Radhakrishnan, J; Srinivasan, A.
On packing cycles in undirected graphs
2003 A., Caprara; Panconesi, Alessandro; R., Rizzi
Connectivity properties of secure sensor networks
2004 DI PIETRO, Roberto; Mancini, Luigi Vincenzo; Mei, Alessandro; Panconesi, Alessandro; J., Radhakrishnan
Ancestral minimum likelihood of phylogenetic trees is hard
2004 L., Addarioberry; B., Chor; M., Hallett; J., Lagergren; Panconesi, Alessandro; T., Wareham
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Improved Distributed Algorithms for Coloring and Network Decomposition Problems | 1992 | Panconesi, Alessandro; Aravind, Srinivasan | |
Quantifiers and approximation | 1993 | Panconesi, Alessandro; Ranjan, | |
Completeness in approximation classes | 1993 | Crescenzi, ; Panconesi, Alessandro | |
The local nature of Delta-colorings and its algorithmic applications | 1995 | Panconesi, Alessandro; Srinivasan, | |
Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds | 1997 | Panconesi, Alessandro; Srinivasan, | |
Nearly optimal distributed edge colouring in O(log log n) rounds | 1997 | Grable, D.; Panconesi, Alessandro | |
Hardness of Approximations | 1997 | Kann, V.; Panconesi, Alessandro | |
On the distributed complexity of computing maximal matchings | 1998 | Hanckowiack, M.; Karonski, M.; Panconesi, Alessandro | |
Near-Optimal, Distributed Edge Coloring via the Nibble Method | 1998 | Grable, D.; Dubhashi, D.; Panconesi, Alessandro | |
A faster distributed algorithm for computing maximal matchings deterministically | 1999 | Hanckowiack, M.; MICHAL KARONSKI, M.; Panconesi, Alessandro | |
Fast distributed algorithms for brooks-vizing colorings | 2000 | Grable, D.; Panconesi, Alessandro | |
On the importance of having an identity | 2000 | Buhrman, H.; Panconesi, Alessandro; Silvestri, Riccardo; Vitanyi, P. | |
Some simple distributed algorithms for sparse networks | 2001 | Panconesi, Alessandro; R., Rizzi | |
Wavelength rerouting in optical networks, or the Venetian Routing problem | 2002 | Italiano, Caprara; G., Mohan; Panconesi, Alessandro; Srinivasan, | |
Experimental analysis of simple, distributed vertex coloring algorithms | 2002 | Finocchi, Irene; Panconesi, Alessandro; Silvestri, Riccardo | |
On the Distributed Complexity of Computing Maximal Matchings | 2002 | Hanckowiak, M.; Karonski, M.; Panconesi, Alessandro | |
Fast distributed algorithms for (weakly) connected dominating sets and linear size skeletons | 2003 | Dubhashi, D; Mei, Alessandro; Panconesi, Alessandro; Radhakrishnan, J; Srinivasan, A. | |
On packing cycles in undirected graphs | 2003 | A., Caprara; Panconesi, Alessandro; R., Rizzi | |
Connectivity properties of secure sensor networks | 2004 | DI PIETRO, Roberto; Mancini, Luigi Vincenzo; Mei, Alessandro; Panconesi, Alessandro; J., Radhakrishnan | |
Ancestral minimum likelihood of phylogenetic trees is hard | 2004 | L., Addarioberry; B., Chor; M., Hallett; J., Lagergren; Panconesi, Alessandro; T., Wareham |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile