An Implementation for Maintaining Arrangements of Polygons. - Michael H. Goldwasser (SCG, 1995)

A survey of linear programming in randomized subexponential time. - Michael H. Goldwasser (SIGACT News, 1995)

Complexity measures for assembly sequences. - Michael H. Goldwasser; Jean-Claude Latombe; Rajeev Motwani 001 (ICRA, 1996)

Intractability of Assembly Sequencing: Unit Disks in the Plane. - Michael H. Goldwasser; Rajeev Motwani 001 (WADS, 1997)

Complexity measures for assembly sequences. - Michael H. Goldwasser (1997)

Complexity Measures for Assembly Sequences. - Michael H. Goldwasser; Rajeev Motwani 001 (Int. J. Comput. Geom. Appl., 1999)

On external memory graph traversal. - Adam L. Buchsbaum; Michael H. Goldwasser; Suresh Venkatasubramanian; Jeffery R. Westbrook (SODA, 2000)

A gimmick to integrate software testing throughout the curriculum. - Michael H. Goldwasser (SIGCSE, 2002)

Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics. - Michael H. Goldwasser; Ming-Yang Kao; Hsueh-I Lu (WABI, 2002)

Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control. - Michael H. Goldwasser (J. Sched., 2003)

Admission Control with Immediate Notification. - Michael H. Goldwasser; Boris Kerbikov (J. Sched., 2003)

Identifying conserved gene clusters in the presence of orthologous groups. - Xin He; Michael H. Goldwasser (RECOMB, 2004)

Complexities for generalized models of self-assembly. - Gagan Aggarwal; Michael H. Goldwasser; Ming-Yang Kao; Robert T. Schweller (SODA, 2004)

Providing students universal access to a centralized, graphical computing environment. - Michael H. Goldwasser; David Letscher (ITiCSE, 2005)

Identifying Conserved Gene Clusters in the Presence of Homology Families. - Xin He; Michael H. Goldwasser (J. Comput. Biol., 2005)

Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. - Michael H. Goldwasser; Ming-Yang Kao; Hsueh-I Lu (J. Comput. Syst. Sci., 2005)

Complexities for Generalized Models of Self-Assembly. - Gagan Aggarwal; Qi Cheng 001; Michael H. Goldwasser; Ming-Yang Kao; Pablo Moisset de Espanés; Robert T. Schweller (SIAM J. Comput., 2005)

Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines. - Michael H. Goldwasser; Mark Pedigo (SWAT, 2006)

Introducing network programming into a CS1 course. - Michael H. Goldwasser; David Letscher (ITiCSE, 2007)

Teaching object-oriented programming in python. - Michael H. Goldwasser; David Letscher (ITiCSE, 2007)

Teaching strategies for reinforcing structural recursion with lists. - Michael H. Goldwasser; David Letscher (OOPSLA Companion, 2007)

Teaching an object-oriented CS1 course in Python: tutorial presentation. - Michael H. Goldwasser; David Letscher (J. Comput. Sci. Coll., 2007)

Teaching an object-oriented CS1 -: with Python. - Michael H. Goldwasser; David Letscher (ITiCSE, 2008)

A python graphics package for the first day and beyond. - Michael H. Goldwasser; David Letscher (ITiCSE, 2008)

Scrambling for students: our graduates are sexier than yours. - Alison Young; Arnold Pears; Pedro de Miguel Anasagasti; Ralf Romeike; Michael Goldweber; Michael H. Goldwasser; Vicki L. Almstrum (ITiCSE, 2008)

A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts. - Michael H. Goldwasser; Arundhati Bagchi Misra (Inf. Process. Lett., 2008)

Online nonpreemptive scheduling of equal-length jobs on two identical machines. - Michael H. Goldwasser; Mark Pedigo (ACM Trans. Algorithms, 2008)

A graphics package for the first day and beyond. - Michael H. Goldwasser; David Letscher (SIGCSE, 2009)

Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput. - David P. Bunde; Michael H. Goldwasser (SWAT, 2010)

A survey of buffer management policies for packet switches. - Michael H. Goldwasser (SIGACT News, 2010)

Interactive exploration of Huffman coding (abstract only). - Nicholas Brown; Michael H. Goldwasser (SIGCSE, 2013)