RicercaInizia una nuova ricerca
NOTA: è possibile cercare una corrispondenza esatta usando i doppi apici, ad es: "evoluzione della specie". Qualora si cerchi un identificativo, è consigliabile cercarlo in due modi differenti: tra apici con caratteri speciali es: "978-94-6366-274" oppure senza caratteri speciali solo come sequenza numerica: es 978946366274.
Design of trees in the hose model: The balanced case
2006 Italiano, Giuseppe Francesco; Leonardi, S; Oriolo, G
Designing Reliable Algorithms in Unreliable Memories
2007 Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco
Deterministic fully dynamic data structures for vertex cover and matching
2018 Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe Francesco
Dynamic algorithms via the primal-dual method
2018 Bhattacharya, S; Henzinger, M; Italiano, Giuseppe Francesco
Dynamic maintenance of directed hypergraphs
1990 Ausiello, G; Italiano, Giuseppe Francesco; Nanni, U
Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures
2006 Demetrescu, C; Italiano, Giuseppe Francesco
Dynamically switching vertices in planar graphs
2000 Frigioni, D.; Italiano, Giuseppe Francesco
Efficient splitting and merging algorithms for order decomposable problems
1999 Grossi, R.; Italiano, Giuseppe Francesco
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms
2006 Demetrescu, C; Italiano, Giuseppe Francesco
Facial recognition with 2D color barcodes
2013 Querini, M; Italiano, Giuseppe Francesco
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Design of trees in the hose model: The balanced case | 2006 | Italiano, Giuseppe Francesco; Leonardi, S; Oriolo, G | |
Designing Reliable Algorithms in Unreliable Memories | 2007 | Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco | |
Deterministic fully dynamic data structures for vertex cover and matching | 2018 | Bhattacharya, Sayan; Henzinger, Monika; Italiano, Giuseppe Francesco | |
Dynamic algorithms via the primal-dual method | 2018 | Bhattacharya, S; Henzinger, M; Italiano, Giuseppe Francesco | |
Dynamic maintenance of directed hypergraphs | 1990 | Ausiello, G; Italiano, Giuseppe Francesco; Nanni, U | |
Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures | 2006 | Demetrescu, C; Italiano, Giuseppe Francesco | |
Dynamically switching vertices in planar graphs | 2000 | Frigioni, D.; Italiano, Giuseppe Francesco | |
Efficient splitting and merging algorithms for order decomposable problems | 1999 | Grossi, R.; Italiano, Giuseppe Francesco | |
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms | 2006 | Demetrescu, C; Italiano, Giuseppe Francesco | |
Facial recognition with 2D color barcodes | 2013 | Querini, M; 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
Opzioni
Scopri
Collezione
- 01 - Pubblicazione su rivista (JOURNAL ARTICLE) 72
- 01 - Pubblicazione su rivista (JOURNAL ARTICLE)::01.1 - Articolo su rivista (Article) 72
Data di pubblicazione
- 2020 - 2023 6
- 2010 - 2019 21
- 2000 - 2009 18
- 1990 - 1999 24
- 1986 - 1989 3
Editore
- Elsevier 2
- ACM (Association for Computing Machinery) 1
- Association for Computing Machinery 1
- Society for Industrial and Applied Mathematics Publications 1
Rivista
- THEORETICAL COMPUTER SCIENCE 9
- ALGORITHMICA 8
- JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY 6
- SIAM JOURNAL ON COMPUTING 6
- ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS 3
- ACM TRANSACTIONS ON ALGORITHMS 3
- INFORMATION AND COMPUTATION 3
- INFORMATION PROCESSING LETTERS 3
- JOURNAL OF ALGORITHMS 3
- JOURNAL OF DISCRETE ALGORITHMS 3
Keyword
- Dynamic graph algorithms 5
- Approximation algorithms 3
- Directed graphs 3
- Graph algorithms 3
- Shortest paths 3
- Analysis of algorithms 2
- Combinatorial optimization 2
- Critical nodes 2
- Design and Analysis of Algorithms 2
- Dynamic data structures 2
Lingua
- eng 72
Accesso al fulltext
- no fulltext 53
- reserved 17
- open 2