Sfoglia per Autore
Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier
2005 Demetrescu, C; Italiano, Giuseppe Francesco
Designing reliable algorithms in unreliable memories
2005 Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco
Portraying algorithms with Leonardo Web
2005 Bonifaci, V.; Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco; Laura, L.
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
2006 Calamoneri, Tiziana; Finocchi, Irene; Italiano, Giuseppe Francesco
Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures
2006 Demetrescu, C; Italiano, Giuseppe Francesco
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights
2006 Demetrescu, C; Italiano, Giuseppe Francesco
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms
2006 Demetrescu, C; Italiano, Giuseppe Francesco
CHECKCOL: Improved local search for graph coloring
2006 Caramia, M; Dell'Olmo, P; Italiano, Giuseppe Francesco
Small stretch spanners on dynamic graphs
2006 Ausiello, G; Franciosa, P. G.; Italiano, Giuseppe Francesco
Design of trees in the hose model: The balanced case
2006 Italiano, Giuseppe Francesco; Leonardi, S; Oriolo, G
Alenex workshop preface
2006 Roman, R.; Stallmann, M.; Baeza-Yates, R.; Buriol, L.; Erlebach, T.; Finocchi, Irene; Grossi, R.; Kettner, L.; Laber, E. S.; Lopez-Ortiz, A.; Naher, S.; Sanders, P.; Streinu, I.; Willhaim, T.; Arge, L.; Battiti, R.; Buchsbaum, A.; Demetrescu, C.; Goldberg, A. V.; Goodrich, M. T.; Italiano, Giuseppe Francesco; Johnson, D. S.; Ladner, R. E.; Mcgeoch, C. C.; Moret, B. M. E.; Mount, D.; Snoeyink, J.; Stein, C.; Tamassia, R.
Optimal Resilient Sorting and Searching in the presence of Dynamic Memory Faults
2006 Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco
The Price of Resiliency: A Case Study on Sorting with Memory Faults
2006 FERRARO PETRILLO, U.; Finocchi, Irene; Italiano, Giuseppe Francesco
GSM and GPRS performance of IPSEC data communication
2006 Me, Gianluigi; Italiano, Giuseppe Francesco; Spagnoletti, Paolo
Optimal Resilient Dynamic Dictionaries
2007 Brodal, G. S.; Fagerberg, R.; Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco; Jorgensen, A. G.; Moruz, G.; Molhave, T.
Progetto di algoritmi e strutture dati in Java
2007 Camil, Demetrescu; Umberto Ferraro Petrillo, ; Finocchi, Irene; Italiano, Giuseppe Francesco
Resilient Search Trees
2007 Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco
Designing Reliable Algorithms in Unreliable Memories
2007 Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco
Novel Local-Search-Based Approaches to University Examination Timetabling
2008 M., Caramia; P., Dell'Olmo; Italiano, Giuseppe Francesco
Maintaining Dynamic Matrices for Fully Dynamic Transitive Closure
2008 C., Demetrescu; Italiano, Giuseppe Francesco
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier | 2005 | Demetrescu, C; Italiano, Giuseppe Francesco | |
| Designing reliable algorithms in unreliable memories | 2005 | Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco | |
| Portraying algorithms with Leonardo Web | 2005 | Bonifaci, V.; Demetrescu, C.; Finocchi, Irene; Italiano, Giuseppe Francesco; Laura, L. | |
| Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings | 2006 | Calamoneri, Tiziana; Finocchi, Irene; Italiano, Giuseppe Francesco | |
| Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures | 2006 | Demetrescu, C; Italiano, Giuseppe Francesco | |
| Fully Dynamic All Pairs Shortest Paths with Real Edge Weights | 2006 | Demetrescu, C; Italiano, Giuseppe Francesco | |
| Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms | 2006 | Demetrescu, C; Italiano, Giuseppe Francesco | |
| CHECKCOL: Improved local search for graph coloring | 2006 | Caramia, M; Dell'Olmo, P; Italiano, Giuseppe Francesco | |
| Small stretch spanners on dynamic graphs | 2006 | Ausiello, G; Franciosa, P. G.; Italiano, Giuseppe Francesco | |
| Design of trees in the hose model: The balanced case | 2006 | Italiano, Giuseppe Francesco; Leonardi, S; Oriolo, G | |
| Alenex workshop preface | 2006 | Roman, R.; Stallmann, M.; Baeza-Yates, R.; Buriol, L.; Erlebach, T.; Finocchi, Irene; Grossi, R.; Kettner, L.; Laber, E. S.; Lopez-Ortiz, A.; Naher, S.; Sanders, P.; Streinu, I.; Willhaim, T.; Arge, L.; Battiti, R.; Buchsbaum, A.; Demetrescu, C.; Goldberg, A. V.; Goodrich, M. T.; Italiano, Giuseppe Francesco; Johnson, D. S.; Ladner, R. E.; Mcgeoch, C. C.; Moret, B. M. E.; Mount, D.; Snoeyink, J.; Stein, C.; Tamassia, R. | |
| Optimal Resilient Sorting and Searching in the presence of Dynamic Memory Faults | 2006 | Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco | |
| The Price of Resiliency: A Case Study on Sorting with Memory Faults | 2006 | FERRARO PETRILLO, U.; Finocchi, Irene; Italiano, Giuseppe Francesco | |
| GSM and GPRS performance of IPSEC data communication | 2006 | Me, Gianluigi; Italiano, Giuseppe Francesco; Spagnoletti, Paolo | |
| Optimal Resilient Dynamic Dictionaries | 2007 | Brodal, G. S.; Fagerberg, R.; Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco; Jorgensen, A. G.; Moruz, G.; Molhave, T. | |
| Progetto di algoritmi e strutture dati in Java | 2007 | Camil, Demetrescu; Umberto Ferraro Petrillo, ; Finocchi, Irene; Italiano, Giuseppe Francesco | |
| Resilient Search Trees | 2007 | Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco | |
| Designing Reliable Algorithms in Unreliable Memories | 2007 | Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco | |
| Novel Local-Search-Based Approaches to University Examination Timetabling | 2008 | M., Caramia; P., Dell'Olmo; Italiano, Giuseppe Francesco | |
| Maintaining Dynamic Matrices for Fully Dynamic Transitive Closure | 2008 | C., Demetrescu; Italiano, Giuseppe Francesco |
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