Elizabeth Sweedyk

Affiliations:
  • Harvey Mudd College, Claremont, CA, USA


According to our database1, Elizabeth Sweedyk authored at least 22 papers between 1993 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016

2013
ITiCSE 2013: Canterbury, UK.
ACM SIGCSE Bull., 2013

Member spotlight.
ACM SIGCSE Bull., 2013

What we did: CSEdWeek 2012.
ACM SIGCSE Bull., 2013

Cybersecurity, women and minorities: findings and recommendations from a preliminary investigation.
Proceedings of the ITiCSE working group reports conference on Innovation and technology in computer science education-working group reports, 2013

Stroke rehabilitation with a sensing surface.
Proceedings of the 2013 ACM SIGCHI Conference on Human Factors in Computing Systems, 2013

2012
Member spotlight.
ACM SIGCSE Bull., 2012

2011
Women build games, seriously.
Proceedings of the 42nd ACM technical symposium on Computer science education, 2011

Muddy hill games.
Proceedings of the 16th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2011

How middle school teachers solved our SE project problems.
Proceedings of the 24th IEEE-CS Conference on Software Engineering Education and Training, 2011

2005
Computer games and CS education: why and how.
Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, 2005

Fun and games: a new software engineering course.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

Games, Metaphor, and Learning.
Proceedings of the Digital Games Research Conference 2005, 2005

2001
Better Approximation Guarantees for Job-Shop Scheduling.
SIAM J. Discret. Math., 2001

The Complexity of Gene Placement.
J. Algorithms, 2001

1999
A 2½-Approximation Algorithm for Shortest Superstring.
SIAM J. Comput., 1999

1998
On the Complexity and Approximation of Syntenic Distance.
Discret. Appl. Math., 1998

1997
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations.
J. Comput. Syst. Sci., 1997

A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language.
Inf. Comput., 1997

1996
Minimizing Phylogenetic Number To Find Good Evolutionary Trees.
Discret. Appl. Math., 1996

1995
Counting and Random Generation of Strings in Regular Languages.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1993
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993


  Loading...