Job Title:  Professor of Computer Science  
Institution:  Haverford College  
Street address:  370 Lancaster Ave., Haverford, PA 19041  
Office:  Koshland L308, INSC  
Office phone:  (610) 8961203  FAX number:  (610) 8964904  
Email address:  slindell@haverford.edu 
Activity  Time  Location 
CS 345 Theory of Computation 
MWF 10:0011:30  S412 
Office hours  Tues & Wed. 2:30  L308 
Events (recent and upcoming)
Date  Location  Presentation 
September 20, 2013  HIGHLIGHTS of Logic, Games and Automata 2013 Paris, France 
Presentationinvariant
definability ABSTRACT: We extend the notion of invariant elementary definability to a variety of different graph representations, including those that strictly extend the power of firstorder logic with an arbitrary linear order. 
October 26, 2012  AALAC/Mellon 23 Working Group on Information at Bryn
Mawr College CoSponsored by the NSF Center for Science of Information 
Information: basic definitions 
May 14, 2012  Finite
and Algorithmic Model Theory 2012 École de Physique des Houches 
Infinitary methods in finite model theory 
March 30, 2012  Logical
Approaches to Barriers in Complexity II Isaac Newton Institute for Mathematical Sciences 
Infinitary
methods in finite model theory Handout; Notes 
I was featured in Haverford's newsletter, April 2006.
Teaching assistants
(* = NSF Graduate Fellowship recipient)
Rose Abernathy  A history of mechanical thought  Fall 2012 
Lili Dworkin *  A history of mechanical thought  Fall 2010 
Sam Wood *  Analysis of algorithms  Spring 2011 
Summer research assistants
(* = NSF Graduate Fellowship recipient)
Gavriella Fried and Jon SweitzerLamme 
A course
resource for CS147: The History of Mechanized Thought 
2012 
Rose Abernathy  Visualization of
switching circuits for formulas of firstorder logic 
2011 
Rebecca Knowles *  Displaying formulas and data structures for firstorder logic over finite domains 
2010 
Lili Dworkin *  Labs to support the History of Computing  2009 
Abby Novick  Comparing college literacy and numeracy  2009 
Anne Miller  Lineartime algorithms for transitive closure  2008 
Stephanie Hilton  Graphical programming of data structures  2008 
Michael Jablin  Pen tablet technology in education  2006 
Pat Clancy  Mathematical typesetting by voice  2005 
Senior thesis students
(* = NSF Graduate Fellowship recipient)
Year  Name  Topic  Second major 
2013  Chang Cao  Complexity of Counting  Mathematics 
2012  Tanvi Surti  Social Recommender Systems  
2011  Lili Dworkin *  AutomataTheoretic Model Checking  Mathematics 
2011  Andrew Gonczi  Fast distance queries in seriesparallel graphs  
2009  Joe Huttner  Recommendation algorithms using the SVD  Spanish 
2008  Alex Moser  Digital Watermarking and DRM  Sociology 
2008  Anne Miller  Lineartime algorithms for transitive closure  Math (BMC) 
2005  Lee Weinstein  Scalefree networks and Random Graphs  Mathematics 
2004  Brian Bejile  Bilevel Lossless Compression Techniques  Economics 
2002  Aaron Block *  Quantum Computation: An Introduction  Mathematics 
2001  Todd Miller  Kolmogorov Complexity  
2000  David Costello  Computerized pricing of derivatives  
2000  Betsy Renner  HumanComputer Interaction  
1998  Adam Schran  Relational database design  
1997  Jeremy Manson  Rewrite systems: ChurchRosser property  
1996  Nik Swoboda  A Multivalued approach to default reasoning  
1993  Jon Hurwitz  Introduction to digital image processing  
1993  Waimar Tun  Gödel's (in)completeness theorems  
1993  Oolan Zimmer  Alternation complexity and the BFVP  Mathematics 
1992  Mark Belasco  A brief introduction to coding theory  Mathematics 
1990  Bryant Tolles  A brief introduction to information theory  Mathematics 
1989  Hank Fieglein  Parallel algorithms  Mathematics 
1988  Allen Gunn  The Lambda calculus  Mathematics 
Contents 
Biographical Information I received my B.A. and M.A. in Mathematics at UCLA, and went on to receive a Ph.D. in theoretical Computer Science at UCLA under the supervision of Sheila Greibach and Yiannis Moschovakis (mathematical logic) in 1987. Since then I have been a member of the Computer Science program at Haverford College, which offers a major or minor, along with a concentration for Mathematics and Physics majors. The courses we offer are geared toward preparing students for graduate study by emphasizing the foundations of the subject. 
Number (click for syllabus) 
Course title (click for course materials) 
Brief description  Other 
Fluency with Information Technology  A basic introduction to a wide range of computing and the technology behind it.  satisfies "Q" requirement  
Foundations of Rigorous Thinking  Quantitative seminar which covers the logical foundations of human reasoning..  satisfies "Q" requirement  
History of Mechanical Thought  Writing seminar which covers the long and colorful history of computing, ancient and modern.  satisfies freshman writing  
Number Systems and Computer Arithmetic  Advanced algorithms and circuit techniques for high speed arithmetic.  intermediate level CS/Math elective 

Information and Coding Theory  Shannon's classical theory of mathematical communication.  intermediate level CS/Math elective 

Analysis of Algorithms  An advanced theoretical course on the design of algorithms.  core major requirement, crosslisted in Math  
Theory of Computation  An advanced course covering theoretical models and languages.  core major requirement, crosslisted in Math  

Physics of Computation  An advanced seminar which explains the deep connection between thermodynamics and energy efficient computation.  CS elective 


Papers
Book Reviews
Dissertation

Talks (selected)
