📖 Course Overview
CIS 5020 offers a rigorous graduate-level introduction to algorithm design and analysis, highlighting the societal implications and civic contexts surrounding algorithmic systems.
🧩 Key Topics
- Asymptotic analysis and tight bounds
- Divide-and-conquer, greedy algorithms, dynamic programming
- Graph and network flow algorithms
- Linear programming and duality
- Randomized algorithms
- Intractability and approximation algorithms
💬 Civic and Dialogic Components
- Structured Academic Controversies on algorithmic fairness
- Guest speakers from tech, law, and social sciences
- Critical reflections on algorithmic impacts
📚 Textbooks and Readings
- Algorithms, Jeff Erickson
- The Ethical Algorithm, Michael Kearns and Aaron Roth
- "Societal Sorting as a Systemic Risk of Recommenders," Thorburn et al.
- Tech Monopoly, Herbert Hovenkamp
- "How to Depolarize Your Students," Sigal Ben-Porath
👨🏻🏫 Instructor
Jérémie Lumbroso, Ph.D.
Practice Assistant Professor, CIS
Pronouns: he/him/his
LinkedIn |
GitHub
🚧 More Details Coming Soon
Full syllabus, schedule, assignments, and guest speakers will be announced shortly. Stay tuned!