Elizabeth Sweedyk

Christine Alvarado, Z. Sweedyk: What we did: CSEdWeek 2012. SIGCSE Bulletin 45(1): 2-4 (2013)

Christine Alvarado, Z. Sweedyk: Member spotlight. SIGCSE Bulletin 45(1): 5-7 (2013)

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

Z. Sweedyk: Member spotlight. SIGCSE Bulletin 44(4): 7 (2012)

Elizabeth Sweedyk: How middle school teachers solved our SE project problems. CSEE&T 2011: 449-453

Jessica Blevins, Andy Kearney, Eric Mullen, Emily Myers-Stanhope, Elizabeth Sweedyk: Muddy hill games. ITiCSE 2011: 395

Elizabeth Sweedyk: Women build games, seriously. SIGCSE 2011: 171-176

Elizabeth Sweedyk, Marianne de Laet: Games, Metaphor, and Learning. DIGRA Conf. 2005

Elizabeth Sweedyk, Robert M. Keller: Fun and games: a new software engineering course. ITiCSE 2005: 138-142

Elizabeth Sweedyk, Marianne de Laet, Michael C. Slattery, James Kuffner: Computer games and CS education: why and how. SIGCSE 2005: 256-257

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)

Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-Shop Scheduling. SIAM J. Discrete Math. 14(1): 67-92 (2001)

Z. Sweedyk: A 2½-Approximation Algorithm for Shortest Superstring. SIAM J. Comput. 29(3): 954-986 (1999)

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

Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk: On the Complexity and Approximation of Syntenic Distance. Discrete Applied Mathematics 88(1-3): 59-82 (1998)

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)

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)

Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk: On the complexity and approximation of syntenic distance. RECOMB 1997: 99-108

Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-shop Scheduling. SODA 1997: 599-608

Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow: Minimizing Phylogenetic Number To Find Good Evolutionary Trees. Discrete Applied Mathematics 71(1-3): 111-136 (1996)

Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow: Minimizing Phylogenetic Number to find Good Evolutionary Trees. CPM 1995: 102-127

Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney: Counting and Random Generation of Strings in Regular Languages. SODA 1995: 551-557

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