| 2008 |
|---|
| 10 | EE | Timothy J. Rolfe:
Perverse and foolish oft I strayed.
SIGCSE Bulletin 40(2): 52-55 (2008) |
| 2007 |
|---|
| 9 | EE | Timothy J. Rolfe:
An alternative dynamic programming solution for the 0/1 knapsack.
SIGCSE Bulletin 39(4): 54-56 (2007) |
| 2006 |
|---|
| 8 | EE | Timothy J. Rolfe:
Las Vegas does n-queens.
SIGCSE Bulletin 38(2): 37-38 (2006) |
| 7 | EE | Timothy J. Rolfe:
Classroom exercise demonstrating linked list operations.
SIGCSE Bulletin 38(4): 83-84 (2006) |
| 2005 |
|---|
| 6 | EE | Timothy J. Rolfe:
List processing: sort again, naturally.
SIGCSE Bulletin 37(2): 46-48 (2005) |
| 2004 |
|---|
| 5 | EE | Timothy J. Rolfe,
Paul W. Purdom:
An alternative problem for backtracking and bounding.
SIGCSE Bulletin 36(4): 83-84 (2004) |
| 2003 |
|---|
| 4 | EE | Timothy J. Rolfe:
Spreadsheet-aided numerical experimentation: analytic formula for Fibonacci numbers.
SIGCSE Bulletin 35(2): 117-119 (2003) |
| 3 | EE | Timothy J. Rolfe:
Program optimization: enforcement of local access and array access via pointers.
SIGCSE Bulletin 35(4): 63-65 (2003) |
| 2002 |
|---|
| 2 | EE | Timothy J. Rolfe:
One-time binary search tree balancing: the Day/Stout/Warren (DSW) algorithm.
SIGCSE Bulletin 34(4): 85-88 (2002) |
| 2001 |
|---|
| 1 | EE | Timothy J. Rolfe:
Binomial coefficient recursion: the good, and the bad and ugly.
SIGCSE Bulletin 33(2): 35-36 (2001) |
