 | 2009 |
| 13 |  | Daniel D. Garcia,
Robb Cutler,
Zachary Dodds,
Eric Roberts,
Alison Young:
Rediscovering the passion, beauty, joy, and awe: making computing fun again, continued.
SIGCSE 2009: 65-66 |
| 2008 |
| 12 |  | Andrew D. McGettrick,
Eric Roberts,
Daniel D. Garcia,
Chris Stevenson:
Rediscovering the passion, beauty, joy and awe: making computing fun again.
SIGCSE 2008: 217-218 |
| 11 |  | Jonas Boustedt,
Robert McCartney,
Josh D. Tenenberg,
Scott D. Anderson,
Caroline M. Eastman,
Daniel D. Garcia,
Paul V. Gestwicki,
Margaret S. Menzin:
It seemed like a good idea at the time.
SIGCSE 2008: 528-529 |
| 2007 |
| 10 |  | Owen L. Astrachan,
Nick Parlante,
Daniel D. Garcia,
Stuart Reges:
Teaching tips we wish they'd told us before we started.
SIGCSE 2007: 2-3 |
| 9 |  | Jeffrey Forbes,
Daniel D. Garcia:
"...But what do the top-rated schools do?": a survey of introductory computer science curricula.
SIGCSE 2007: 245-246 |
| 2005 |
| 8 |  | David Ginat,
Richard J. Anderson,
Daniel D. Garcia,
Richard Rasala:
Randomness and probability in the early CS courses.
SIGCSE 2005: 556-557 |
| 2004 |
| 7 |  | Andrew Begel,
Daniel D. Garcia,
Steven A. Wolfman:
Kinesthetic learning in the classroom.
SIGCSE 2004: 183-184 |
| 6 |  | John P. Dougherty,
Thomas B. Horton,
Daniel D. Garcia,
Susan H. Rodger:
Panel on teaching faculty positions.
SIGCSE 2004: 231-232 |
| 5 |  | David Ginat,
Owen L. Astrachan,
Daniel D. Garcia,
Mark Guzdial:
"But it looks right!": the bugs students don't see.
SIGCSE 2004: 284-285 |
| 2003 |
| 4 |  | Daniel D. Garcia,
David Ginat,
Peter Henderson:
Everything you always wanted to know about game theory: but were afraid to ask.
SIGCSE 2003: 96-97 |
| 2002 |
| 3 |  | David Ginat,
Daniel D. Garcia,
William I. Gasarch:
Aha! an illuminating perspective.
SIGCSE 2002: 1-2 |
| 2 |  | Nick Parlante,
John K. Estell,
David Reed,
David B. Levine,
Daniel D. Garcia,
Julie Zelenski:
Nifty assignments.
SIGCSE 2002: 319-320 |
| 2001 |
| 1 |  | David Ginat,
Daniel D. Garcia,
Owen L. Astrachan,
Joseph Bergin:
Colorful illustrations of algorithmic design techniques and problem solving.
SIGCSE 2001: 425-426 |