Binomial coefficient recursion: the good, and the bad and ugly. - Timothy J. Rolfe (ACM SIGCSE Bull., 2001)

Distributed multiprocessor environments. - Timothy J. Rolfe (J. Comput. Sci. Coll., 2002)

One-time binary search tree balancing: the Day/Stout/Warren (DSW) algorithm. - Timothy J. Rolfe (ACM SIGCSE Bull., 2002)

Spreadsheet-aided numerical experimentation: analytic formula for Fibonacci numbers. - Timothy J. Rolfe (ACM SIGCSE Bull., 2003)

Program optimization: enforcement of local access and array access via pointers. - Timothy J. Rolfe (ACM SIGCSE Bull., 2003)

An alternative problem for backtracking and bounding. - Timothy J. Rolfe; Paul W. Purdom (ACM SIGCSE Bull., 2004)

List processing: sort again, naturally. - Timothy J. Rolfe (ACM SIGCSE Bull., 2005)

Las Vegas does n-queens. - Timothy J. Rolfe (ACM SIGCSE Bull., 2006)

Classroom exercise demonstrating linked list operations. - Timothy J. Rolfe (ACM SIGCSE Bull., 2006)

An alternative dynamic programming solution for the 0/1 knapsack. - Timothy J. Rolfe (ACM SIGCSE Bull., 2007)

A cautionary tale: false efficiencies in the traveling salesman problem. - Timothy J. Rolfe (J. Comput. Sci. Coll., 2008)

Perverse and foolish oft I strayed. - Timothy J. Rolfe (ACM SIGCSE Bull., 2008)

A specimen MPI application: N-Queens in parallel. - Timothy J. Rolfe (ACM SIGCSE Bull., 2008)

The assignment problem: exploring parallelism. - Timothy J. Rolfe (ACM SIGCSE Bull., 2009)

The assignment problem: further exploring parallelism. - Timothy J. Rolfe (ACM SIGCSE Bull., 2009)

Unexpected speed-up in Java on multiprocessors. - Timothy J. Rolfe (Inroads, 2010)

A specimen of parallel programming: parallel merge sort implementation. - Timothy J. Rolfe (Inroads, 2010)

Optimizations generating Armstrong numbers. - Timothy J. Rolfe (Inroads, 2011)

The game of elevenses. - Timothy J. Rolfe (Inroads, 2011)

Exponential base change based on symmetry. - Timothy J. Rolfe (Inroads, 2011)

Dynamic programming of the towers. - Timothy J. Rolfe (Inroads, 2012)