07: Algorithmenforschung: Bindestrichalgorithmen & Sortiersysteme – Theorie trifft Praxis 📊

0:00:00 Starten
0:00:57 1 Algorithm Engineering
0:05:04 (Caricatured) Traditional View: Algorithm Theory
0:07:43 Gaps Between Theory & Practice
0:12:14 Algorithmics as Algorithm Engineering
0:18:43 Bits of History
0:25:30 Realistic Models
0:28:11 Design
0:30:03 Analysis
0:31:05 Implementation
0:33:47 Experiments
0:37:14 Algorithm Libraries - Challenges
0:42:58 Problem Instances
0:43:45 Example: Sorting Benchmark (Indy)
0:45:41 GraySort
0:45:41 JouleSort
0:46:46 Applications tha ""Change the World""
0:51:07 Conclusion: Algorithm Engineering – Algorithm Theory
0:52:28 More On Experimental Methodology
0:53:24 Quality Criteria
0:58:20 Not Here but Important
1:00:47 The Starting Point
1:01:46 The Process
1:07:31 Of Risks and Opportunities
1:08:36 Übung 4
1:08:41 Themen
1:09:47 Starke Zusammenhangskomponenten
1:10:39 SCC (Wiederholung)

Dozenten:
Prof. Dr. Peter Sanders, M.Sc. Michael Axtmann | Karlsruher Institut für Technologie (KIT), Name des Instituts

Vorlesungsaufzeichnung: KIT | WEBCAST
http://webcast.kit.edu