Michael Goldwasser

Education:

• PhD in Computer Science, Stanford University
• ScB in Math/Computer Science, Brown University

Research interests:

Algorithms, Computer Science Education

Biography:

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 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 undergraduate textbooks.

Publications

Show all

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.

Michael H. Goldwasser. “A survey of buffer management policies for packet switches”. In: SIGACT News 41.1 (2010), pp. 100–128. doi: 10.1145/1753171.1753195. url: http://doi.acm.org/10.1145/1753171.1753195.

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.

Michael H. Goldwasser and Arundhati Bagchi Misra. “A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts”. In: Inf. Process. Lett. 107.6 (2008), pp. 240–245. doi: 10.1016/j.ipl.2008.03.003. url: https://doi.org/10.1016/j.ipl.2008.03.003.

Alison Young, Arnold Pears, Pedro de Miguel Anasagasti, Ralf Romeike, Michael Goldweber, Michael Goldwasser, and Vicki L. Almstrum. “Scrambling for students: our graduates are sexier than yours”. In: Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2008, Madrid, Spain, June 30 - July 2, 2008. 2008, pp. 333–334. doi: 10.1145/1384271.1384375. url: http://doi.acm.org/10.1145/1384271.1384375.

Michael H. Goldwasser and David Letscher. “A python graphics package for the first day and beyond”. In: Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2008, Madrid, Spain, June 30 - July 2, 2008. 2008, p. 326. doi: 10.1145/1384271.1384369. url: http://doi.acm.org/10.1145/1384271.1384369.

Michael H. Goldwasser and David Letscher. “Teaching an object-oriented CS1 -: with Python”. In: Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2008, Madrid, Spain, June 30 - July 2, 2008. 2008, pp. 42–46. doi: 10.1145/1384271.1384285. url: http://doi.acm.org/10.1145/1384271.1384285.

Michael H. Goldwasser and David Letscher. “Teaching strategies for reinforcing structural recursion with lists”. In: Companion to the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2007, October 21-25, 2007, Montreal, Quebec, Canada. 2007, pp. 889–896. doi: 10.1145/1297846.1297940. url: http://doi.acm.org/10.1145/1297846.1297940.

Michael H. Goldwasser and David Letscher. “Teaching object-oriented programming in python”. In: Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2007, Dundee, Scotland, UK, June 25-27, 2007. 2007, pp. 365–366. doi: 10.1145/1268784.1268937. url: http://doi.acm.org/10.1145/1268784.1268937.

Michael H. Goldwasser and David Letscher. “Introducing network programming into a CS1 course”. In: Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2007, Dundee, Scotland, UK, June 25-27, 2007. 2007, pp. 19–22. doi: 10.1145/1268784.1268793. url: http://doi.acm.org/10.1145/1268784.1268793.

Michael H. Goldwasser and Mark Pedigo. “Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines”. In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings. 2006, pp. 113–123. doi: 10.1007/11785293“?13. url: https://doi.org/10.1007/11785293%5C_13.

Gagan Aggarwal, Qi Cheng, Michael H. Goldwasser, Ming-Yang Kao, Pablo Moisset de Espan?s, and Robert T. Schweller. “Complexities for Generalized Models of Self-Assembly”. In: SIAM J. Comput. 34.6 (2005), pp. 1493–1515. doi: 10.1137/S0097539704445202. url: https://doi.org/10.1137/S0097539704445202.

Michael H. Goldwasser, Ming-Yang Kao, and Hsueh-I Lu. “Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications”. In: J. Comput. Syst. Sci. 70.2 (2005), pp. 128–144. doi: 10.1016/j.jcss.2004.08.001. url: https://doi.org/10.1016/j.jcss.2004.08.001.

Xin He and Michael H. Goldwasser. “Identifying Conserved Gene Clusters in the Presence of Homology Families”. In: Journal of Computational Biology 12.6 (2005), pp. 638–656. doi: 10.1089/cmb.2005.12.638. url: https://doi.org/10.1089/cmb.2005.12.638.

Michael H. Goldwasser and David Letscher. “Providing students universal access to a centralized, graphical computing environment”. In: Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2005, Caparica, Portugal, June 27-29, 2005. 2005, pp. 79–83. doi: 10.1145/1067445.1067470. url: http://doi.acm.org/10.1145/1067445.1067470.

Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, and Robert T. Schweller. “Complexities for generalized models of self-assembly”. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004. 2004, pp. 880–889. url: http://dl.acm.org/citation.cfm?id=982792.982926.

Xin He and Michael H. Goldwasser. “Identifying conserved gene clusters in the presence of orthologous groups”. In: Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004, San Diego, California, USA, March 27-31, 2004. 2004, pp. 272–280. doi: 10.1145/974614.974650. url: http://doi.acm.org/10.1145/974614.974650.

Michael H. Goldwasser and Boris Kerbikov. “Admission Control with Immediate Notification”. In: J. Scheduling 6.3 (2003), pp. 269–285. doi: 10.1023/A:1022956425198. url: https://doi.org/10.1023/A:1022956425198.

Michael H. Goldwasser. “Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control”. In: J. Scheduling 6.2 (2003), pp. 183–211. doi: 10.1023/A:1022994010777. url: https://doi.org/10.1023/A:1022994010777.

Michael H. Goldwasser, Ming-Yang Kao, and Hsueh-I Lu. “Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications”. In: CoRR cs.DS/0207026 (2002). url: http://arxiv.org/abs/cs.DS/0207026.

Michael H. Goldwasser, Ming-Yang Kao, and Hsueh-I Lu. “Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics”. In: Algorithms in Bioinformatics, Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings. 2002, pp. 157–171. doi: 10.1007/3-540-45784-4“?12. url: https://doi.org/10.1007/3-540-45784-4%5C_12.

Michael H. Goldwasser. “A gimmick to integrate software testing throughout the curriculum”. In: Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002, Cincinnati, Kentucky, USA, February 27 - March 3, 2002. 2002, pp. 271–275. doi: 10.1145/563340.563446. url: http://doi.acm.org/10.1145/563340.563446.

Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian, and Jeffery Westbrook. “On external memory graph traversal”. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA. 2000, pp. 859–860. url: http://dl.acm.org/citation.cfm?id=338219.338650.

Michael H. Goldwasser and Rajeev Motwani. “Complexity Measures for Assembly Sequences”. In: Int. J. Comput. Geometry Appl. 9.4/5 (1999), pp. 371–418. doi: 10.1142/S0218195999000248. url: https://doi.org/10.1142/S0218195999000248.

Michael H. Goldwasser. “Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control”. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA. 1999, pp. 396–405. url: http://dl.acm.org/citation.cfm?id=314500.314592.

Michael H. Goldwasser and Rajeev Motwani. “Intractability of Assembly Sequencing: Unit Disks in the Plane”. In: Algorithms and Data Structures, 5th International Workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings. 1997, pp. 307–320. doi: 10.1007/3-540-63307-3“?70. url: https://doi.org/10.1007/3-540-63307-3%5C_70.

Michael H. Goldwasser, Jean-Claude Latombe, and Rajeev Motwani. “Complexity measures for assembly sequences”. In: Proceedings of the 1996 IEEE International Conference on Robotics and Automation, Minneapolis, Minnesota, USA, April 22-28, 1996. 1996, pp. 1851–1857. doi: 10.1109/ROBOT.1996.506981. url: https://doi.org/10.1109/ROBOT.1996.506981.

Michael Goldwasser. “A survey of linear programming in randomized subexponential time”. In: SIGACT News 26.2 (1995), pp. 96–104. doi: 10.1145/202840.202847. url: http://doi.acm.org/10.1145/202840.202847.

Michael H. Goldwasser. “An Implementation for Maintaining Arrangements of Polygons”. In: Proceedings of the Eleventh Annual Symposium on Computational Geometry, Vancouver, B.C., Canada, June 5-12, 1995. 1995, pp. C32–C33. doi: 10.1145/220279.220337. url: http://doi.acm.org/10.1145/220279.220337.

Courses

Show all