default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElizabeth Sweedyk
Person information
- affiliation: Harvey Mudd College, Claremont, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j11]Christine Alvarado, Z. Sweedyk:
What we did: CSEdWeek 2012. ACM SIGCSE Bull. 45(1): 2-4 (2013)- [j10]Christine Alvarado, Z. Sweedyk:
Member spotlight. ACM SIGCSE Bull. 45(1): 5-7 (2013) - [j9]Z. Sweedyk:
ITiCSE 2013: Canterbury, UK. ACM SIGCSE Bull. 45(3): 8 (2013) - 2012
- [j8]Z. Sweedyk:
Member spotlight. ACM SIGCSE Bull. 44(4): 7 (2012) - 2001
- [j7]Leslie Ann Goldberg, Paul W. Goldberg
, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk:
The Complexity of Gene Placement. J. Algorithms 41(2): 225-243 (2001) - [j6]Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk:
Better Approximation Guarantees for Job-Shop Scheduling. SIAM J. Discret. Math. 14(1): 67-92 (2001) - 1999
- [j5]Z. Sweedyk:
A 2½-Approximation Algorithm for Shortest Superstring. SIAM J. Comput. 29(3): 954-986 (1999) - 1998
- [j4]Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk:
On the Complexity and Approximation of Syntenic Distance. Discret. Appl. Math. 88(1-3): 59-82 (1998) - 1997
- [j3]Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney:
A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language. Inf. Comput. 134(1): 59-74 (1997) - [j2]Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk:
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations. J. Comput. Syst. Sci. 54(2): 317-331 (1997) - 1996
- [j1]Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow:
Minimizing Phylogenetic Number To Find Good Evolutionary Trees. Discret. Appl. Math. 71(1-3): 111-136 (1996)
Conference and Workshop Papers
- 2016
- [c15]Chris Johnson, Monica McGill, Durell Bouchard, Michael K. Bradshaw, Víctor A. Bucheli, Laurence D. Merkle, Michael James Scott, Elizabeth Sweedyk, Jesus Ángel Velázquez-Iturbide, Zhiping Xiao, Ming Zhang:
Game Development for Computer Science Education. ITiCSE-WGR 2016: 23-44 - 2013
- [c14]Cati N. Boulanger, Adam Boulanger, Lilian de Greef, Andy Kearney, Kiley Sobel, Russell Transue, Z. Sweedyk, Paul H. Dietz, Steven Bathiche:
Stroke rehabilitation with a sensing surface. CHI 2013: 1243-1246 - [c13]Rose Shumba, Kirsten Ferguson-Boucher, Elizabeth Sweedyk, Carol Taylor, Guy Franklin, Claude Turner, Corrine Sande, Gbemi Acholonu, Rebecca G. Bace, Laura Hall:
Cybersecurity, women and minorities: findings and recommendations from a preliminary investigation. ITiCSE-WGR 2013: 1-14 - 2011
- [c12]Elizabeth Sweedyk:
How middle school teachers solved our SE project problems. CSEE&T 2011: 449-453 - [c11]Jessica Blevins, Andy Kearney, Eric Mullen, Emily Myers-Stanhope, Elizabeth Sweedyk:
Muddy hill games. ITiCSE 2011: 395 - [c10]Elizabeth Sweedyk:
Women build games, seriously. SIGCSE 2011: 171-176 - 2005
- [c9]Elizabeth Sweedyk, Marianne de Laet:
Games, Metaphor, and Learning. DiGRA Conference 2005 - [c8]Elizabeth Sweedyk, Robert M. Keller:
Fun and games: a new software engineering course. ITiCSE 2005: 138-142 - [c7]Elizabeth Sweedyk, Marianne de Laet, Michael C. Slattery, James Kuffner:
Computer games and CS education: why and how. SIGCSE 2005: 256-257 - 1999
- [c6]Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk:
The Complexity of Gene Placement. SODA 1999: 386-395 - 1997
- [c5]Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk:
On the complexity and approximation of syntenic distance. RECOMB 1997: 99-108 - [c4]Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk:
Better Approximation Guarantees for Job-shop Scheduling. SODA 1997: 599-608 - 1995
- [c3]Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow:
Minimizing Phylogenetic Number to find Good Evolutionary Trees. CPM 1995: 102-127 - [c2]Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney:
Counting and Random Generation of Strings in Regular Languages. SODA 1995: 551-557 - 1993
- [c1]Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk:
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations. FOCS 1993: 724-733
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-05-08 21:42 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:
