Algorithmic Archaeology: Excavating Insights from Computer Science History

Many of the most well-known algorithms in computer science history aren't just clever solutions to specific problems. They're crystallized wisdom about how to think systematically about complex challenges and help encode mental models you can apply today and in the future. This talk digs deep (get it?) to excavate (get it?) the problem-solving principles buried within classic algorithms and uncover the practical thinking patterns they encode. Journey through algorithmic history to cover: - Dijkstra's shortest path algorithm (1956) - Not just for finding routes on maps! - Union-Find (1964) - Procrastinating for profit! - Fast Fourier Transform (1965) - Hidden structure in seemingly chaotic data Discover how historical algorithms address timeless problem-solving strategies: - Transforming hard problems into easier ones - Leveraging structure to reduce complexity - Trading immediate simplicity for long-term efficiency. This talk will leave you with a toolbox of proven strategies for decomposing, optimizing, and simplifying real-world systems. You'll gain a deeper appreciation for algorithmic history and practical frameworks for recognizing when ancient wisdom applies to contemporary challenges.