|
David ReedAssociate Professor of Computer Science
|
Integrating Empirical Methods into the Computer Science
Curriculum.
NSF CCLI-Educational Materials Development Grant.
Budget: $74,995 (2003 - 2006)
Creighton University Pipeline for Innovation Grant.
Budget: $500 (2006 - 2007).
Creighton Faculty Development Grant.
Budget: $4,300 (Summer 2005)
Creighton University Summer Assessment Grant.
Budget: $2,724 (Summer 2002)
A Balanced Introduction
to Computer Science, 2nd edition.
David Reed.
Prentice Hall, ISBN 978-0-13-601722-6, 2008.
A Balanced Introduction
to Computer Science, 2nd edition -- Online Supplement.
David Reed.
Prentice Hall, ISBN 978-0-13-601759-2, 2008.
A Balanced Introduction
to Computer Science, 2nd edition -- Instructor Supplement.
David Reed.
Prentice Hall, ISBN 978-0-13601723-3, 2008.
A Balanced Introduction
to Computer Science.
David Reed.
Prentice Hall, ISBN 0-13-046709-X, 2005.
A Balanced Introduction
to Computer Science -- Online Supplement.
David Reed.
Prentice Hall, ISBN 0-13-141338-4, 2005.
A Balanced Introduction
to Computer Science -- Instructor Supplement.
David Reed.
Prentice Hall, ISBN 0-13-141340-6, 2005.
Teaching the Tapestry: An
Instructor's Manual to Accompany A Computer Science Tapestry.
David Reed.
McGraw-Hill Companies, Inc., ISBN 0-07-002037-X, 1997.
Introduction to Computing: An Interactive Approach Using ISETL.
David
Reed.
Published at Dickinson College for use in CS 131 courses, 1995,
1996, 1997.
A 2007 Model Curriculum for a Liberal Arts
Degree in Computer Science.
Liberal Arts Computer Science Consortium
(contributing author).
ACM Journal on Educational Resources in Computing, 7(2), 2007.
The Convergence of Computer Programming and
Graphic Design.
David Reed and Joel Davies.
Journal of Computing Sciences in Colleges, 21(3), 2006.
Core Empirical Concepts and Skills for
Computer Science.
Grant Braught, Craig Miller, and David Reed.
In Proceedings of the 35th SIGCSE Technical
Symposium on Computer Science Education,
SIGCSE Bulletin 36(1),
2004.
The Use of Ill-Defined Problems for Developing
Problem-Solving and Empirical Skills in CS1.
David Reed.
Journal of Computing Sciences in Colleges, 18(1), 2002.
Disequilibration for Teaching the
Scientific
Method in Computer Science.
Grant Braught and David Reed.
In Proceedings of the 33rd SIGCSE Technical
Symposium on Computer Science Education,
SIGCSE Bulletin 34(1),
2002.
The Knob & Switch Computer: A Computer
Architecture
Simulator for Introductory Computer Science.
Grant Braught and David Reed.
ACM Journal on Educational Resources in Computing, 1(4), 2001.
Rethinking
CS0 with JavaScript.
David Reed.
In Proceedings of the 32nd SIGCSE Technical
Symposium on Computer Science Education,
SIGCSE Bulletin 33(1),
2001.
Developing Empirical Skills in an Introductory
Computer Science Course.
David Reed.
In Proceedings of the 34th Midwest Instruction and Computing Symposium,
Fienup (ed.), 2001.
Empirical
Investigation throughout the CS Curriculum.
David Reed, Craig Miller,
and Grant Braught.
In Proceedings of the 31st SIGCSE Technical
Symposium on Computer Science Education,
SIGCSE Bulletin 32(1),
2000.
Incorporating
Problem-solving Patterns in CS 1.
David Reed.
In Proceedings of
the 29th SIGCSE Technical Symposium on Computer Science Education,
SIGCSE Bulletin 30(1), 1998.
Reprinted in Journal of Computer
Science Education, 13(1), 1999.
Near-Horn
Prolog and the Ancestry Family of Proof Procedures.
David Reed and
Donald Loveland.
Annals of Mathematics and Artificial
Intelligence, 14, 1995.
AAA and
CS 1: The Applied Apprenticeship Approach to CS 1.
Owen Astrachan
and David Reed.
In Proceedings of the 26th SIGCSE Technical
Symposium on Computer Science Education,
SIGCSE Bulletin 27(1),
1995.
SATCHMORE:
SATCHMO with RElevancy.
Donald Loveland, David Reed and Debra
Wilson.
Journal of Automated Reasoning, 14:325-351, 1995.
A
Near-Horn Approach to Disjunctive Logic Programming.
David Reed,
Donald Loveland and Bruce Smith.
In Proceedings of the 2nd Int'l
Workshop on Extensions of Logic Programming,
Lecture Notes in AI 596,
Springer-Verlag, 1992.
A
Comparison of Three Prolog Extensions.
David Reed and Donald
Loveland.
Journal of Logic Programming, 12(1), 1992.
A
Near-Horn Prolog for Compilation.
Donald Loveland and David
Reed.
In Computational Logic: Essays in Honor of Alan Robinson,
Lassez and Plotkin (eds.), MIT Press, 1991.
An
Alternative Characterization of Disjunctive Logic Programs.
David
Reed, Donald Loveland and Bruce Smith.
In Proceedings of the 1991
International Logic Programming Symposium,
Saraswat and Ueda (eds.),
MIT Press, 1991.
Nifty
Assignments: ASCIImations.
Special Session presentation at the 38th SIGCSE
Technical Symposium on
Computer Science Education, Covington,
KY, 2007.
What Colleges Should Know about the New AP Computer Science.
Panel presentation at the 39th annual Midwest Instruction and Computing Symposium,
Mount Pleasant, IA, 2006.
Integrating Empirical Methods into the Computer Science Curriculum.
Poster presentation at the 37th SIGCSE Technical Symposium on
Computer Science Education, Houston, TX, 2006.
Growl...Roar...Are We Ready for Tiger?.Review of the Current Climate and Changes to be Implemented for the 2007 AP CS Exam.
Panel presentation at the 37th SIGCSE Technical Symposium on
Computer Science Education, Houston, TX, 2006.
What Colleges Should Know about the New AP Computer Science.
Panel presentation at the 2005 Rocky Mountain Conference on
Computing Sciences in Colleges, Denver, CO, 2005.
The Year in Review... Changes and Lessons Learned in the Design and
Implementation of the AP CS Exam in Java.
Panel presentation at the 36th SIGCSE
Technical
Symposium on
Computer Science Education, St. Louis,
MO, 2005.
Nifty Assignments: Talk Like a Pirate.
Special Session presentation at the 35th SIGCSE
Technical
Symposium on
Computer Science Education, Norfolk,
VA, 2004.
Integrating Empirical Methods into Computer Science.
Panel
presentation at
the
33rd SIGCSE Technical Symposium on
Computer Science Education
(organizer/moderator),
Northern Kentucky/Cincinnati, 2002.
Nifty Assignments: Interactive Web Pages in CS0.
Special Session presentation at the
33rd
SIGCSE
Technical
Symposium on
Computer Science Education, Northern
Kentucky/Cincinnati,
OH, 2002.
Abstraction vs. Implementation in CS2.
Presented at the The Future of CS2 and Data
Structures Workshop,
OOPSLA 98, Vancouver, Canada, 1998.
Incorporating Default Negation into Bidirectional Reasoning.
Presented at
Disjunctive Logic Programming and Databases: Nonmonotonic Aspects,
Dagstuhl Seminar 9627,
Dagstuhl, Germany, 1996.
The First Year: Beyond Language Issues.
Panel presentation at the 27th
SIGCSE Technical Symposium on
Computer Science Education,
Philadelphia,
PA, 1996.
A Role for Classical Negation in Disjunctive Logic Programming.
Presented at the Workshop on Disjunctive Logic Programming,
1991
International Logic Programming Symposium, San Diego, CA, 1991.
A Case-analysis Based Fixpoint Semantics for Disjunctive Logic Programs.
Presented at the Workshop on Non-Horn Clause Logic Programming,
1990
North American Conference on Logic Programming, Austin, TX, 1990.
Near-Horn Prolog and the Ancestry Family of Proof Systems.
Presented at
the Workshop on Non-Horn Clause Logic Programming,
1990 North American
Conference on Logic Programming, Austin, TX, 1990.
A Comparison of Three Prolog Extensions.
Presented at the 5th
Southeastern Logic Symposium, Charlotte, NC, 1989.
A Survival Guide for Fluctuating CS Enrollments.
Keynote address at the 39th annual Midwest Instruction and Computing Symposium,
Iowa Wesleyan College, Mount Pleasant, IA, 2006.
APCS in Java: Looking Back / Looking Ahead.
Plenary presentation at the 5th annual Computer Science Conference for High School Educators,
Chapman University, Orange, CA, 2005.
Birds of a Feather: The Current State of the AP Computer Science Program.
Presented at the 38th SIGCSE Technical Symposium on Computer Science Education,
Covington, Kentucky, March 2007.
Advanced Placement Computer Science: Meet the Committee.
Presentation at the 2006 Advanced Placement Annual Conference,
Orlando, FL, 2006.
Coming Soon to the AP Computer Science Exam.
Panel presentation at the 2006 Advanced Placement Annual Conference,
Orlando, FL, 2006.
AP Online Event: Overview of the APCS A Exam.
Presented online for the College Board, October 2005.
Advanced Placement Computer Science: Meet the Committee.
Presentation at the 2005
Advanced
Placement
National Conference,
Houston, TX, 2005.
Advanced Placement Computer Science: An Overview/Primer.
Presentation at the 2004 JETT
Java
Workshop,
Northwest Missouri State University, Maryville, MO, 2004.
Advanced Placement Computer Science: Meet the Committee.
Presentation at the 2004
Advanced
Placement
National Conference,
Orlando, FL, 2004.
Computer Science Program Goals.
Presented at the 2002 Liberal Arts Computer Science Consortium Meeting,
Grinnell College, August 2002.
Balance in CS0.
Presented at the 2001 Liberal Arts Computer Science Consortium
Meeting,
Williams College, August 2001.
Rethinking the First Year.
Presented at the 1999 Liberal Arts Computer Science Consortium
Meeting,
Oberlin College, June 1999.
Abstraction vs. Implementation in CS2.
Presented at the The Future of CS2 and Data
Structures Workshop,
OOPSLA 98, Vancouver, Canada, 1998.
Data Abstraction
& Data Structures in the CS Curriculum.
Presented at the Future Directions in Data
Structures Workshop,
sponsored by the National Science Foundation and
the Duke University
Department of Computer Science, Durham, NC, 1997.
One Step Forward, One Step Back: Directionality in Automated Reasoning.
Presented at Gettysburg College, December 1996.
Computer Science Education:
Artificial Intelligence:
Programming Languages:
Program Committee:
Referee:
Member:
Board Member:
Faculty Consultant to the Educational Testing Service
Creighton University Service (2000 - present):
Dickinson College Service (1994 - 2000):