
Teaching
- Current courses (Fall 2006):
- 15-100 Intro/Intermediate Programming - taught in Java for people who have no programming experience.
- 15-128
Freshman Immigration Course. A course to introduce cs majors to
computer science as a field and some of the projects at Carnegie Mellon. Rich Pattis is the leader of this course.
- 15-391 Technical
Consulting in the Community. A course which has students
consulting for non-profit organizations. Co-taught with Joe Mertz.
- Past courses:
- SAMS - CS.
- A summer program for high school students, the Summer Academy for Math and Science, is run by the CMARC
office. Ananda Gunawardena, Neema Moraveji and I have worked on
computer science projects with some students in this program. My involvement was 2002-2004.
- Carnegie Mellon, Computer Science Department (2001- present)
- 15-100. See current semester for a sample of this course.
- 15-111
Intermediate/Advanced Programming - beginning data structures in Java,
for people who have introductory level programming experience in a
language other than Java
- Muhlenberg College, Department
of Mathematical Sciences. (1998-2001)
- Statistical Methods, Topics in
Mathematics, Computer Science I, Computer Science II, Introduction to
Computers, Data Structures, Theory of Programming Languages.
- St. Lawrence University, Department of Mathematics.
(1995-1998)
- Concepts of Computation, Introduction to Computer
Programming, Introduction to Computer Science, Data Structures,
Object-Oriented Programming, Programming Languages, Algorithm Analysis.
- Dartmouth College, Department of Computer Science - then part of the Department of Mathematics (1994)
- Introduction to Computer Science (Honors)

Research
I received my PhD in Computer Science from Dartmouth
College's Department of Computer
Science in June 2002.
My thesis: Locally Minimal Triangulations
Advisor: Robert L. "Scot" Drysdale
My papers: (Some links thanks to others. I didn't make all this
stuff available myself. Further, some of it is copyrighted.)
-
"On Exclusion Regions for Optimal Triangulations", Scot Drysdale, Scott
McElfresh, Jack Scott Snoeyink. Discrete
Applied Mathematics 109 (2001) 49--65. [Preliminary version at
CG98, 14th European Workshop on Computational Geometry.]
-
"Fast
Greedy Triangulation Algorithms", Matt Dickerson, Scot Drysdale, Scott
McElfresh, Emo Welzl. Computational
Geometry: Theory and Applications, 8 (1997) 67--86.
[Preliminary version at SoCG94, ACM Symposium on Computational Geometry.]
-
"New Algorithms
and Empirical Findings on Minimum Weight Triangulation Heuristics",
Matt Dickerson, Scott McElfresh, Mark Montague. Proceedings of the 11th
Annual Symposium on Computational Geometry (1995): 238--247.
Some recent work in computational geometry includes:
Examination of the properties of Locally Optimal Triangulations.
Empirical examination of various skeletons for the MWT.
Theoretical work on pre-tests for inclusion or exclusion from the MWT or
LOTs.

Affiliations within CMU

Affiliations external to CMU
|