default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael H. Goldwasser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c20]Nicholas Brown, Michael H. Goldwasser:
Interactive exploration of Huffman coding (abstract only). SIGCSE 2013: 744- 2010
- [j10]Michael H. Goldwasser:
A survey of buffer management policies for packet switches. SIGACT News 41(1): 100-128 (2010) - [c19]David P. Bunde, Michael H. Goldwasser:
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput. SWAT 2010: 346-358
2000 – 2009
- 2009
- [c18]Michael H. Goldwasser, David Letscher:
A graphics package for the first day and beyond. SIGCSE 2009: 206-210 - 2008
- [j9]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) - [j8]Michael H. Goldwasser, Mark Pedigo:
Online nonpreemptive scheduling of equal-length jobs on two identical machines. ACM Trans. Algorithms 5(1): 2:1-2:18 (2008) - [c17]Michael H. Goldwasser, David Letscher:
Teaching an object-oriented CS1 -: with Python. ITiCSE 2008: 42-46 - [c16]Michael H. Goldwasser, David Letscher:
A python graphics package for the first day and beyond. ITiCSE 2008: 326 - [c15]Alison Young, Arnold Pears
, Pedro de Miguel Anasagasti, Ralf Romeike, Michael Goldweber, Michael H. Goldwasser, Vicki L. Almstrum:
Scrambling for students: our graduates are sexier than yours. ITiCSE 2008: 333-334 - 2007
- [c14]Michael H. Goldwasser, David Letscher:
Introducing network programming into a CS1 course. ITiCSE 2007: 19-22 - [c13]Michael H. Goldwasser, David Letscher:
Teaching object-oriented programming in python. ITiCSE 2007: 365-366 - [c12]Michael H. Goldwasser, David Letscher:
Teaching strategies for reinforcing structural recursion with lists. OOPSLA Companion 2007: 889-896 - 2006
- [c11]Michael H. Goldwasser, Mark Pedigo:
Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines. SWAT 2006: 113-123 - 2005
- [j7]Xin He, Michael H. Goldwasser:
Identifying Conserved Gene Clusters in the Presence of Homology Families. J. Comput. Biol. 12(6): 638-656 (2005) - [j6]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) - [j5]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) - [c10]Michael H. Goldwasser, David Letscher:
Providing students universal access to a centralized, graphical computing environment. ITiCSE 2005: 79-83 - 2004
- [c9]Xin He, Michael H. Goldwasser:
Identifying conserved gene clusters in the presence of orthologous groups. RECOMB 2004: 272-280 - [c8]Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller:
Complexities for generalized models of self-assembly. SODA 2004: 880-889 - 2003
- [j4]Michael H. Goldwasser:
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control. J. Sched. 6(2): 183-211 (2003) - [j3]Michael H. Goldwasser, Boris Kerbikov:
Admission Control with Immediate Notification. J. Sched. 6(3): 269-285 (2003) - 2002
- [c7]Michael H. Goldwasser:
A gimmick to integrate software testing throughout the curriculum. SIGCSE 2002: 271-275 - [c6]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 - [e1]Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch:
Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Proceedings of a DIMACS Workshop, USA, 1999. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59, DIMACS/AMS 2002, ISBN 978-0-8218-2892-2 [contents] - [i1]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
- [c5]Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian, Jeffery R. Westbrook:
On external memory graph traversal. SODA 2000: 859-860
1990 – 1999
- 1999
- [j2]Michael H. Goldwasser, Rajeev Motwani:
Complexity Measures for Assembly Sequences. Int. J. Comput. Geom. Appl. 9(4/5): 371-418 (1999) - [c4]Michael H. Goldwasser:
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control. SODA 1999: 396-405 - 1997
- [b1]Michael H. Goldwasser:
Complexity measures for assembly sequences. Stanford University, USA, 1997 - [c3]Michael H. Goldwasser, Rajeev Motwani:
Intractability of Assembly Sequencing: Unit Disks in the Plane. WADS 1997: 307-320 - 1996
- [c2]Michael H. Goldwasser, Jean-Claude Latombe, Rajeev Motwani:
Complexity measures for assembly sequences. ICRA 1996: 1851-1857 - 1995
- [j1]Michael H. Goldwasser:
A survey of linear programming in randomized subexponential time. SIGACT News 26(2): 96-104 (1995) - [c1]Michael H. Goldwasser:
An Implementation for Maintaining Arrangements of Polygons. SCG 1995: C32-C33
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
