Michael Goldwasser, Ph.D.
Department of Computer Science
CSCI 1300 Introduction to Object-Oriented Programming, CSCI 3100 Algorithms, CSCI
4930 Special Topics: Game Development, CSCI 5030 Principles of Software Development,
CSCI 5930 Special Topics: Game Development
- Ph.D. in Computer Science, Stanford University
- Sc.B. in Math/Computer Science, Brown University
Dr. Michael Goldwasser joined the faculty at Saint Louis University in 2003, having
previously been a faculty member at Loyola University in Chicago and a postdoc at
Princeton University. He has served as the chairperson for the Department of Computer
Science since 2016. His research interests are in the design and analysis of algorithms,
with a particular interest in the area of online computation and approximation algorithms.
He is also active in the computer science education community and the author of three
- Computer Science Education
Publications and Media Placements
- Nicholas Brown and Michael H. Goldwasser. “Interactive exploration of Huffman coding (abstract only)”. In: The 44th ACM Technical Symposium on Computer Science Education, SIGCSE ’13, Denver, CO, USA, March 6-9, 2013. 2013, p. 744. doi: 10.1145/2445196.2445458. url: http://doi.acm.org/10.1145/2445196.2445458.
- David P. Bunde and Michael H. Goldwasser. “Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput”. In: Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings. 2010, pp. 346–358. doi: 10.1007/978-3-642-13731-0“?33. url: https://doi.org/10.1007/978-3-642-13731-0%5C_33.
- Michael H. Goldwasser and David Letscher. “A graphics package for the first day and beyond”. In: Proceedings of the 40th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2009, Chattanooga, TN, USA, March 4-7, 2009. 2009, pp. 206–210. doi: 10.1145/1508865.1508945. url: http://doi.acm.org/10.1145/1508865.1508945.
- Michael H. Goldwasser and Mark Pedigo. “Online nonpreemptive scheduling of equal-length jobs on two identical
machines”. In: ACM Trans. Algorithms 5.1 (2008), 2:1–2:18. doi: 10.1145/1435375.1435377. url: http://doi.acm.org/10.1145/1435375.1435377.