 | 2010 |
| 27 |  | David P. Bunde,
Michael H. Goldwasser:
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput.
SWAT 2010: 346-358 |
| 26 |  | Michael H. Goldwasser:
A survey of buffer management policies for packet switches.
SIGACT News 41(1): 100-128 (2010) |
| 2009 |
| 25 |  | Michael H. Goldwasser,
David Letscher:
A graphics package for the first day and beyond.
SIGCSE 2009: 206-210 |
| 2008 |
| 24 |  | Michael H. Goldwasser,
David Letscher:
A python graphics package for the first day and beyond.
ITiCSE 2008: 326 |
| 23 |  | Michael H. Goldwasser,
David Letscher:
Teaching an object-oriented CS1 -: with Python.
ITiCSE 2008: 42-46 |
| 22 |  | Michael H. Goldwasser,
Mark Pedigo:
Online nonpreemptive scheduling of equal-length jobs on two identical machines.
ACM Transactions on Algorithms 5(1): (2008) |
| 21 |  | Michael H. Goldwasser,
Arundhati Bagchi Misra:
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts.
Inf. Process. Lett. 107(6): 240-245 (2008) |
| 2007 |
| 20 |  | Michael H. Goldwasser,
David Letscher:
Introducing network programming into a CS1 course.
ITiCSE 2007: 19-22 |
| 19 |  | Michael H. Goldwasser,
David Letscher:
Teaching object-oriented programming in python.
ITiCSE 2007: 365-366 |
| 18 |  | Michael H. Goldwasser,
David Letscher:
Teaching strategies for reinforcing structural recursion with lists.
OOPSLA Companion 2007: 889-896 |
| 2006 |
| 17 |  | Michael H. Goldwasser,
Mark Pedigo:
Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines.
SWAT 2006: 113-123 |
| 2005 |
| 16 |  | Michael H. Goldwasser,
David Letscher:
Providing students universal access to a centralized, graphical computing environment.
ITiCSE 2005: 79-83 |
| 15 |  | Michael H. Goldwasser,
Ming-Yang Kao,
Hsueh-I Lu:
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications.
J. Comput. Syst. Sci. 70(2): 128-144 (2005) |
| 14 |  | Xin He,
Michael H. Goldwasser:
Identifying Conserved Gene Clusters in the Presence of Homology Families.
Journal of Computational Biology 12(6): 638-656 (2005) |
| 13 |  | Gagan Aggarwal,
Qi Cheng,
Michael H. Goldwasser,
Ming-Yang Kao,
Pablo Moisset de Espanés,
Robert T. Schweller:
Complexities for Generalized Models of Self-Assembly.
SIAM J. Comput. 34(6): 1493-1515 (2005) |
| 2004 |
| 12 |  | Xin He,
Michael H. Goldwasser:
Identifying conserved gene clusters in the presence of orthologous groups.
RECOMB 2004: 272-280 |
| 11 |  | Gagan Aggarwal,
Michael H. Goldwasser,
Ming-Yang Kao,
Robert T. Schweller:
Complexities for generalized models of self-assembly.
SODA 2004: 880-889 |
| 2003 |
| 10 |  | Michael H. Goldwasser:
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control.
J. Scheduling 6(2): 183-211 (2003) |
| 9 |  | Michael H. Goldwasser,
Boris Kerbikov:
Admission Control with Immediate Notification.
J. Scheduling 6(3): 269-285 (2003) |
| 2002 |
| 8 |  | Michael H. Goldwasser:
A gimmick to integrate software testing throughout the curriculum.
SIGCSE 2002: 271-275 |
| 7 |  | Michael H. Goldwasser,
Ming-Yang Kao,
Hsueh-I Lu:
Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics.
WABI 2002: 157-171 |
| 6 |  | Michael H. Goldwasser,
Ming-Yang Kao,
Hsueh-I Lu:
Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications
CoRR cs.DS/0207026: (2002) |
| 2000 |
| 5 |  | Adam L. Buchsbaum,
Michael H. Goldwasser,
Suresh Venkatasubramanian,
Jeffery Westbrook:
On external memory graph traversal.
SODA 2000: 859-860 |
| 1999 |
| 4 |  | Michael H. Goldwasser:
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control.
SODA 1999: 396-405 |
| 3 |  | Michael H. Goldwasser,
Rajeev Motwani:
Complexity Measures for Assembly Sequences.
Int. J. Comput. Geometry Appl. 9(4/5): 371- (1999) |
| 1997 |
| 2 |  | Michael H. Goldwasser,
Rajeev Motwani:
Intractability of Assembly Sequencing: Unit Disks in the Plane.
WADS 1997: 307-320 |
| 1995 |
| 1 |  | Michael H. Goldwasser:
An Implementation for Maintaining Arrangements of Polygons.
Symposium on Computational Geometry 1995: C32-C33 |