Strumenti Utente

Strumenti Sito


magistraleinformaticanetworking:ae:ae2019:start

Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

Link a questa pagina di confronto

Entrambe le parti precedenti la revisioneRevisione precedente
Prossima revisione
Revisione precedente
magistraleinformaticanetworking:ae:ae2019:start [12/06/2020 alle 09:52 (5 anni fa)] – [Exam] Paolo Ferraginamagistraleinformaticanetworking:ae:ae2019:start [26/04/2021 alle 10:37 (4 anni fa)] (versione attuale) – [Books, Notes, etc.] Paolo Ferragina
Linea 53: Linea 53:
 ====== Books, Notes, etc. ======  ====== Books, Notes, etc. ====== 
  
-We'll use the //old-fashioned// blackboard and few slides. Most of the content of the course will be covered by some notes I wrote in these years; for some topics parts of papers/books will be used. You can download the latest version of these notes from [[https://www.dropbox.com/s/dqttqigvuf4ydkd/main.pdf?dl=0 | this link]].+We'll use the //old-fashioned// blackboard and few slides. Most of the content of the course will be covered by some notes I wrote in these years; for some topics parts of papers/books will be used. 
  
  
Linea 85: Linea 85:
 | 06/11/2019 | Exercises | | | 06/11/2019 | Exercises | |
 | 11/11/2019 | Prefix search: definition of the problem, solution based on arrays, Front-coding, two-level indexing. Locality Preserving front coding and its use with arrays. | Chap. 9 of the notes: 9.1, 9.3. | | 11/11/2019 | Prefix search: definition of the problem, solution based on arrays, Front-coding, two-level indexing. Locality Preserving front coding and its use with arrays. | Chap. 9 of the notes: 9.1, 9.3. |
-| 12/11/2019 | Recap: BFS and DFS visits, Minimum Spanning Tree problem: Kruskal and Prim algorithms and analysis. Dejkstra algorithm for shortest path tree | CLR cap.23 {{ :magistraleinformaticanetworking:ae:ae2019:aelec10_copy.pptx|MST }}{{ :magistraleinformaticanetworking:ae:ae2019:ae_lec11.pptx|SPT }} | +| 12/11/2019 | Recap: BFS and DFS visits, Minimum Spanning Tree problem: Kruskal and Prim algorithms and analysis. Dijkstra algorithm for shortest path tree | CLR cap.23 {{ :magistraleinformaticanetworking:ae:ae2019:aelec10_copy.pptx|MST }}{{ :magistraleinformaticanetworking:ae:ae2019:ae_lec11.pptx|SPT }} | 
 | 13/11/2019 | Algorithms for external and semi-external computation of MST, Sybein algorithm. | Sect 11.5 of the {{:magistraleinformaticanetworking:ae:ae2014:mst-mehlhorn.pdf|Mehlhorn-Sander's book}}|  | 13/11/2019 | Algorithms for external and semi-external computation of MST, Sybein algorithm. | Sect 11.5 of the {{:magistraleinformaticanetworking:ae:ae2014:mst-mehlhorn.pdf|Mehlhorn-Sander's book}}| 
 | 18/11/2019 | Cancellata per allerta meteo | |  | 18/11/2019 | Cancellata per allerta meteo | | 
magistraleinformaticanetworking/ae/ae2019/start.1591955547.txt.gz · Ultima modifica: 12/06/2020 alle 09:52 (5 anni fa) da Paolo Ferragina

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki