Michael H. Goldwasser

According to our database1, Michael H. Goldwasser authored at least 30 papers between 1995 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
Interactive exploration of Huffman coding (abstract only).
Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

2010
A survey of buffer management policies for packet switches.
SIGACT News, 2010

Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput.
Proceedings of the Algorithm Theory, 2010

2009
A graphics package for the first day and beyond.
Proceedings of the 40th SIGCSE Technical Symposium on Computer Science Education, 2009

2008
Online nonpreemptive scheduling of equal-length jobs on two identical machines.
ACM Trans. Algorithms, 2008

A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts.
Inf. Process. Lett., 2008

Scrambling for students: our graduates are sexier than yours.
Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2008

A python graphics package for the first day and beyond.
Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2008

Teaching an object-oriented CS1 -: with Python.
Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2008

2007
Teaching strategies for reinforcing structural recursion with lists.
Proceedings of the Companion to the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2007

Teaching object-oriented programming in python.
Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007

Introducing network programming into a CS1 course.
Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007

2006
Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines.
Proceedings of the Algorithm Theory, 2006

2005
Complexities for Generalized Models of Self-Assembly.
SIAM J. Comput., 2005

Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications.
J. Comput. Syst. Sci., 2005

Identifying Conserved Gene Clusters in the Presence of Homology Families.
J. Comput. Biol., 2005

Providing students universal access to a centralized, graphical computing environment.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

2004
Complexities for generalized models of self-assembly.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Identifying conserved gene clusters in the presence of orthologous groups.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

2003
Admission Control with Immediate Notification.
J. Sched., 2003

Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control.
J. Sched., 2003

2002
Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

A gimmick to integrate software testing throughout the curriculum.
Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002

2000
On external memory graph traversal.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Complexity Measures for Assembly Sequences.
Int. J. Comput. Geom. Appl., 1999

1997
Complexity measures for assembly sequences.
PhD thesis, 1997

Intractability of Assembly Sequencing: Unit Disks in the Plane.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

1996
Complexity measures for assembly sequences.
Proceedings of the 1996 IEEE International Conference on Robotics and Automation, 1996

1995
A survey of linear programming in randomized subexponential time.
SIGACT News, 1995

An Implementation for Maintaining Arrangements of Polygons.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995


  Loading...