Sfoglia per Autore
Engineering a new loop-free shortest paths routing algorithm
2012-01-01 D'Angelo, Gianlorenzo; M., D'Emidio; D., Frigioni; and V., Maurizio
Pruning the computation of distributed shortest paths in power-law networks
2013-01-01 D'Angelo, G; D'Emidio, M.; Frigioni, D.
Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model
2013-01-01 D'Angelo, G; G., Di Stefano; A., Navarra
A unified approach for different tasks on rings in robot-based computing systems
2013-01-01 D'Angelo, G; Di, Stefano; G., Navarra; A., Nisse; N., Suchan
SRLG-Diverse Routing with the Star Property
2013-01-01 Bermond, Jean-Claude; Coudert, David; D'Angelo, G; Moataz, Zahra
Approximation bounds for the minimum k-storage problem
2013-01-01 D'Angelo, G; Diodati, D.; Navarra, A.; Pinotti, C. M.
Multi-Interface Wireless Networks: Complexity and Algorithms
2013-01-01 D'Angelo, G; G., Di Stefano; A., Navarra
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks
2013-01-01 Cicerone, S; D'Angelo, G; Di Stefano, G; Frigioni, D; Maurizio, V
Flow Problems in Multi-Interface Networks
2014-01-01 D'Angelo, G; Di Stefano, G; Navarra, A
Understanding the power of stigmergy of anonymous agents in discrete environments
2014-01-01 D'Angelo, G; Defago, X.; Nisse, N.
Optimal placement of storage nodes in a wireless sensor network
2014-01-01 D'Angelo, G; Diodati, D.; Navarra, A.; Pinotti, C. M.
Gathering and exclusive searching on rings under minimal assumptions
2014-01-01 D'Angelo, G; Navarra, A.; Nisse, N.
Gathering on rings under the Look-Compute-Move model
2014-01-01 D'Angelo, G; Di Stefano, G; Navarra, A
Engineering graph-based models for dynamic timetable information systems
2014-01-01 Cionini, A.; D'Angelo, G; D'Emidio, M.; Frigioni, D.; Giannakopoulou, K.; Paraskevopoulos, A.; Zaroliagis, C.
Gathering six oblivious robots on anonymous symmetric rings
2014-01-01 D'Angelo, G; Di Stefano, G; Navarra, A
Fully dynamic update of arc-flags
2014-01-01 D'Angelo, G; D'Emidio, M; Frigioni, D
A loop-free shortest-path routing algorithm for dynamic networks
2014-01-01 D'Angelo, G; D'Emidio, M; Frigioni, D
The minimum k-storage problem on directed graphs
2015-01-01 D'Angelo, G; Diodati, D; Navarra, A; Pinotti, Cm
Greedily improving our own centrality in a network
2015-01-01 Crescenzi, P.; D'Angelo, G; Severini, L.; Velaj, Y.
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks
2015-01-01 D'Angelo, G; Di Stefano, G; Navarra, A; Nisse, N; Suchan, K
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Engineering a new loop-free shortest paths routing algorithm | 1-gen-2012 | D'Angelo, Gianlorenzo; M., D'Emidio; D., Frigioni; and V., Maurizio | |
| Pruning the computation of distributed shortest paths in power-law networks | 1-gen-2013 | D'Angelo, G; D'Emidio, M.; Frigioni, D. | |
| Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model | 1-gen-2013 | D'Angelo, G; G., Di Stefano; A., Navarra | |
| A unified approach for different tasks on rings in robot-based computing systems | 1-gen-2013 | D'Angelo, G; Di, Stefano; G., Navarra; A., Nisse; N., Suchan | |
| SRLG-Diverse Routing with the Star Property | 1-gen-2013 | Bermond, Jean-Claude; Coudert, David; D'Angelo, G; Moataz, Zahra | |
| Approximation bounds for the minimum k-storage problem | 1-gen-2013 | D'Angelo, G; Diodati, D.; Navarra, A.; Pinotti, C. M. | |
| Multi-Interface Wireless Networks: Complexity and Algorithms | 1-gen-2013 | D'Angelo, G; G., Di Stefano; A., Navarra | |
| Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks | 1-gen-2013 | Cicerone, S; D'Angelo, G; Di Stefano, G; Frigioni, D; Maurizio, V | |
| Flow Problems in Multi-Interface Networks | 1-gen-2014 | D'Angelo, G; Di Stefano, G; Navarra, A | |
| Understanding the power of stigmergy of anonymous agents in discrete environments | 1-gen-2014 | D'Angelo, G; Defago, X.; Nisse, N. | |
| Optimal placement of storage nodes in a wireless sensor network | 1-gen-2014 | D'Angelo, G; Diodati, D.; Navarra, A.; Pinotti, C. M. | |
| Gathering and exclusive searching on rings under minimal assumptions | 1-gen-2014 | D'Angelo, G; Navarra, A.; Nisse, N. | |
| Gathering on rings under the Look-Compute-Move model | 1-gen-2014 | D'Angelo, G; Di Stefano, G; Navarra, A | |
| Engineering graph-based models for dynamic timetable information systems | 1-gen-2014 | Cionini, A.; D'Angelo, G; D'Emidio, M.; Frigioni, D.; Giannakopoulou, K.; Paraskevopoulos, A.; Zaroliagis, C. | |
| Gathering six oblivious robots on anonymous symmetric rings | 1-gen-2014 | D'Angelo, G; Di Stefano, G; Navarra, A | |
| Fully dynamic update of arc-flags | 1-gen-2014 | D'Angelo, G; D'Emidio, M; Frigioni, D | |
| A loop-free shortest-path routing algorithm for dynamic networks | 1-gen-2014 | D'Angelo, G; D'Emidio, M; Frigioni, D | |
| The minimum k-storage problem on directed graphs | 1-gen-2015 | D'Angelo, G; Diodati, D; Navarra, A; Pinotti, Cm | |
| Greedily improving our own centrality in a network | 1-gen-2015 | Crescenzi, P.; D'Angelo, G; Severini, L.; Velaj, Y. | |
| Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks | 1-gen-2015 | D'Angelo, G; Di Stefano, G; Navarra, A; Nisse, N; Suchan, K |
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