Selected talks by John MacCormick

• The Online Index-Merging Problem. Princeton Computer Science Colloquium, 10/14/05. PDF.
• The Science of Search Engines. Dickinson College Math/CS Chat, 11/14/06. PDF.
• Can Computers See? Dickinson College Math/CS Chat, 2/2/07. PDF.
• The Need for Polite Software. Microsoft Research Silicon Valley Lab, July 2007. PDF.
• Retrospective on leaving Silicon Valley Lab of Microsoft Research. July 2007. PDF (fragmentary).
• How to keep a secret, even on the Internet. Dickinson College Math/CS Chat, 11/4/08. PDF (fragmentary). Similar talks were given at Princeton (3/3/10, as part of Princeton's Lunch and Learn series) and Messiah College (11/31/09).
• What should a scientist know about computer science? Dickinson College Rush Hour interdisciplinary seminar, 10/13/09. PDF (fragmentary).
• The Coolest Theorem in Computer Science: Computers Can't Do Everything. Dickinson College Math/CS Chat, 4/6/10. PDF (fragmentary).
• The Benefits of Pairing By Ability. SIGCSE 2011. PDF.
• Did Alan Turing analyze the Halting Problem? Microsoft Research Silicon Valley Lab, July 2010. PDF.
• Some Reasons Why Computer Scientists Should Study Math, and Mathematicians Should Study Computer Science. Math and Computer Science Majors' Dinner, Dickinson College, 4/26/11. PDF.
• How does the Kinect work? Dickinson College Math/CS Chat, 9/6/11. PDF.
• A Brief Overview of Some of the Most Interesting Cutting-Edge Research on Computer Systems: highlights from the 2011 Symposium on Operating Systems Principles (SOSP). Informal departmental seminar, Dickinson College, 12/8/11. PDF.
• 9 Algorithms that Changed the Future, Microsoft author talk series, Microsoft Corp., Redmond, WA, 10/16/12.