Algorithmen 2, Vorlesung, WS18/19

03 |
0:00:00 Start
0:00:10 Algorithmics as Algorithm Engineering
0:01:26 Problem Instances
0:02:50 Example: Sorting Benchmark (Indy)
0:09:34 GraySort:
0:11:27 JouleSort
0:13:39 Applications that ""Change the world""
0:22:09 Conclusion
0:24:17 More on experimental Methodology
0:29:48 Quality Criteria
0:36:53 Not here but important
0:37:57 The starting point
0:40:08 The Process
0:45:06 Of Risks and Opportunities
0:47:19 Fortgeschrittene Datenstrukturen
0:47:35 Adressierbare Prioritätslisten
0:47:54 Grundlegende Datenstrukturen
0:48:19 Wälder bearbeiten
0:48:46 Pairing Heaps
0:50:27 Fibonacci Heaps
0:50:46 Repräsentation
0:51:09 deleteMin mit Union-by-Rank
0:52:22 Kaskadierende Schnitte
0:53:56 Addressable Priority Queues: Mehr
0:55:09 Zusammenfassung: Datenstrukturen
0:55:51 Kürzeste Wege
0:57:46 Allgemeine Definitionen
0:59:39 Kante
1:00:43 Dijkstra's Algorithmmus
1:05:03 Laufzeit