Timothy J. Rolfe - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2012

Dynamic programming of the towersTimothy J. Rolfe. inroads, 3(3):40-45, 2012. [doi]

2011

Optimizations generating Armstrong numbersTimothy J. Rolfe. inroads, 2(2):43-46, 2011. [doi]

Exponential base change based on symmetryTimothy J. Rolfe. inroads, 2(4):33-37, 2011. [doi]

The game of elevensesTimothy J. Rolfe. inroads, 2(3):29-30, 2011. [doi]

2010

A specimen of parallel programming: parallel merge sort implementationTimothy J. Rolfe. inroads, 1(4):72-79, 2010. [doi]

Unexpected speed-up in Java on multiprocessorsTimothy J. Rolfe. inroads, 1(2):22-23, 2010. [doi]

2009

The assignment problem: further exploring parallelismTimothy J. Rolfe. SIGCSE, 41(4):78-81, 2009. [doi]

The assignment problem: exploring parallelismTimothy J. Rolfe. SIGCSE, 41(2):127-131, 2009. [doi]

2008

Perverse and foolish oft I strayedTimothy J. Rolfe. SIGCSE, 40(2):52-55, 2008. [doi]

A specimen MPI application: N-Queens in parallelTimothy J. Rolfe. SIGCSE, 40(4):42-45, 2008. [doi]

2007

An alternative dynamic programming solution for the 0/1 knapsackTimothy J. Rolfe. SIGCSE, 39(4):54-56, 2007. [doi]

2006

Classroom exercise demonstrating linked list operationsTimothy J. Rolfe. SIGCSE, 38(4):83-84, 2006. [doi]

Las Vegas does n-queensTimothy J. Rolfe. SIGCSE, 38(2):37-38, 2006. [doi]

2005

List processing: sort again, naturallyTimothy J. Rolfe. SIGCSE, 37(2):46-48, 2005. [doi]

2004

An alternative problem for backtracking and boundingTimothy J. Rolfe, Paul W. Purdom. SIGCSE, 36(4):83-84, 2004. [doi]

An alternative problem for backtracking and boundingTimothy J. Rolfe, Paul W. Purdom. iticse 2004: 83-84 [doi]

2003

Program optimization: enforcement of local access and array access via pointersTimothy J. Rolfe. SIGCSE, 35(4):63-65, 2003. [doi]

Spreadsheet-aided numerical experimentation: analytic formula for Fibonacci numbersTimothy J. Rolfe. SIGCSE, 35(2):117-119, 2003. [doi]

2002

One-time binary search tree balancing: the Day/Stout/Warren (DSW) algorithmTimothy J. Rolfe. SIGCSE, 34(4):85-88, 2002. [doi]

2001

Binomial coefficient recursion: the good, and the bad and uglyTimothy J. Rolfe. SIGCSE, 33(2):35-36, 2001. [doi]

Sign in or sign up to see more results.

runs on WebDSL