Computer Science University

Location:

Haverford, PA

Posted:

February 22, 2013

Contact this candidate

Resume:

We found ** results related to this asset

Document InformationType: Other

Total # of pages: 1

Avg Rating:

Price:

Free

Document Source

http://www.haverford.edu/cmsc/slindell/resume.pdf

Brief C.V.

Name: Steven Lindell, Professor of Computer Science

Address: Haverford College, Haverford, PA 19041-1392 610-***-**** ********@*********.***

Education: University of California at Los Angeles (UCLA)

Ph.D. Computer Science Major Field: Theory 1987

M.A. Mathematics Emphasis in Logic 1982

B.A. Mathematics Highest Honors 1980

Dissertation The Logical Complexity of Queries on Unordered Graphs

Professor Sheila A. Greibach, Computer Science Department (thesis advisor).

Professor Yiannis N. Moschovakis, Mathematics Department (thesis advisor).

National Science Foundation Grants

2002-5 Principle investigator for SGER grant "A mathematical logic for physically feasible

computation" CCR-0225063.

'98-'02 ROA participant in "Logical Studies in the Complexity of Computation" together with principal

investigator Scott Weinstein in the Department of Philosophy at the University of Pennsylvania,

CCR-9820899.

1994-8 ROA participant in "Logical Methods applied to Complexity Theory": principle investigators

Scott Weinstein and Maria Bonet from the University of Pennsylvania, CCR-9403447.

1990-3 Principle investigator for RUI grant "Fixed-Point Logic on Finite Structures", CCR-9003356.

Publications and Lectures

Please see my webpage http://www.haverford.edu/cmsc/slindell/ for a full list and descriptions.

Active Memberships in Professional Organizations

IEEE Institute of Electrical and Electronics Engineers (full member)

ASL Association of Symbolic Logic

ACM SIGACT Association for Computing Machinery: Special interest in Theory of Computing

EATCS European Association for Theoretical Computer Science

Biographical summary

Steven Lindell founded the Computer Science program at Haverford College, after having received

his education in mathematics and computer science at UCLA. His dissertation was under the joint

direction of Sheila Greibach and Yiannis Moschovakis, on the topic of mathematical logic and

computational complexity. His current interests include finding a logical characterization of basic

computational models, such as connectivity within switching networks, and logical definability in

finite model theory. The recipient of four National Science Foundation grants covering fifteen years,

he has published over a dozen papers in the area of mathematical logic applied to computational

complexity, and given over twenty talks, including a recent invited series at the 3rd Indian Scool for

Logic and Applications.

Related Items

Loading related materials...

Related ContentsRodger Duke University Durham, NC ******@**.****.*** Eric Wiebe NC State University Raleigh, NC eric *****@****.*** Kyung Min Lee Duke University Durham, NC Chris Morgan Georgia Tech Atlanta, GA Kareem OmaryInternational ComputerScience Institute 1947 Center St. Suite 600, Berkeley, California, 94530 U.S.A. ffillmore,********@****.********.*** zSenshu University, Kawasaki, Japan *******@***.******-*.**.** AbstractDepartment of ComputerScience Boston University 111 Cummington St, Room 270 Boston, MA 02215 617-***-**** *****@**.**.*** http://www.cs.bu.edu/fac/byers EDUCATION Ph.D. at Santa Barbara, UCLA, and the University of Utah. It Page 1 of 8A:95sma209.htm 5/24/04file://C:WINDOWSDesktop1995SWMA95sma209.htm Los Angeles Los Angeles, CA 90024, USA *****@**.****.*** Abstract I will review concepts, principles, and mathematical tools that were found usefulBachelor of Science in ComputerScience Prepared by Norman Pestaina Assessments Coordinator I. INTRODUCTION This report is prepared in accordance with the Assessment Plan adopted by the School of ComputingDCCCX X ComputerScience Department Indiana University Bloomington, Indiana 47405-4101 Department of ComputerScience. Philadelphia, Pennsylvania. Ph.D. degree earned (1988) in ComputerScience. Dissertation area: Computer Vision, Image Processing and Computer Graphics. Title: Partial BoundaryGroup, ComputerScience Division, Department of EECS, University of California, Berkeley, and International ComputerScience Institute. On sabbatical leave from University of Namur, Belgium. Fateman University of California, Berkeley Abstract The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathemat- ical recurrence relations. Although thisConference on Computer Vision and Pattern Recognitionn2c pages 251n2d258n2c 1994. Time and Space En0ecient Pose Clustering Clark F. Olson ComputerScience Division University of California at Berkeley Berkeleyn2cComputerScience Department ********@*********.*** ***@**.*********.*** Princeton University Fall Semester 2002/2003 (No e to reader: Th s is a slightlyfrom the NationalScienceFoundation, Penn State University College of Medicine, Pennsylvania Lions Sight Research fund, the William O. and Dr. Katherine Gibson Havemeier fund, the MU Noonan fund, the MUDownes University of California-Berkeley U.S.A. Frank Tendick University of California-San Francisco, U.S.A. ABSTRACT In this paper we describe two projects. The first is our novel and superiorStanford University RESEARCH INTERESTS Sequential/Parallel Constraint Solvers for Software Reliability, Security and Biology Software Engineering through NSF grant DUE- 0442513. Copyright is held by the author/owner(s). ITiCSE11, June 2729, 2011, Darmstadt, Germany. ACM 978-1-4503-0697-3/11/06. export to svg formatBachelor of Science in ComputerScience Prepared by Norman Pestaina Assessments Coordinator I. INTRODUCTION This report is prepared in accordance with the Assessment Plan adopted by the School of ComputingCognitive Science Soc., Chicago, Ill., August 1991, pp. 908-912 Syntactic Category Formation with Vector Space Grammars Andreas Stolcke ComputerScience Division University of California Berkeley, CA 94720Dept of ComputerScience Duke University Durham, NC 27708-0129 Thomas Finley Dept of ComputerScience Cornell University Ithaca, NY 14853-7501 Susan H. Rodger Dept of Visualizing protein networks, canonical signaling pathways and proteomic experimental data together Also inside: Storytelling About Lighthouses The Artemis ProjectRecommended TopicsRecommended CoursesRecommended Textbooks

Essential Guide to Computing, The: The Story of Information Technology

Foundations of Computer Science: From Data Manipulation to Theory of Computation, 1st Edition

Introduction to Computing and Programming with Java: A Multimedia Approach

Learning Ace is not sponsored or endorsed by any college or university.

Contact this candidate