We stand with Ukraine  

Timothy J. Rolfe

Affiliations:
  • Eastern Washington University, USA


According to our database1, Timothy J. Rolfe authored at least 21 papers between 2001 and 2012.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Dynamic programming of the towers.
[BibTeX]
[DOI]
Timothy J. Rolfe
Inroads, 2012

2011
Exponential base change based on symmetry.
[BibTeX]
[DOI]
Timothy J. Rolfe
Inroads, 2011

The game of elevenses.
[BibTeX]
[DOI]
Timothy J. Rolfe
Inroads, 2011

Optimizations generating Armstrong numbers.
[BibTeX]
[DOI]
Timothy J. Rolfe
Inroads, 2011

2010
A specimen of parallel programming: parallel merge sort implementation.
[BibTeX]
[DOI]
Timothy J. Rolfe
Inroads, 2010

Unexpected speed-up in Java on multiprocessors.
[BibTeX]
[DOI]
Timothy J. Rolfe
Inroads, 2010

2009
The assignment problem: further exploring parallelism.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2009

The assignment problem: exploring parallelism.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2009

2008
A specimen MPI application: N-Queens in parallel.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2008

Perverse and foolish oft I strayed.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2008

A cautionary tale: false efficiencies in the traveling salesman problem.
[BibTeX]
[DOI]
Timothy J. Rolfe
J. Comput. Sci. Coll., 2008

2007
An alternative dynamic programming solution for the 0/1 knapsack.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2007

2006
Classroom exercise demonstrating linked list operations.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2006

Las Vegas does n-queens.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2006

2005
List processing: sort again, naturally.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2005

2004
An alternative problem for backtracking and bounding.
[BibTeX]
[DOI]
Timothy J. Rolfe
,
Paul W. Purdom
Proceedings of the Working group reports from ITiCSE on Innovation and technology in computer science education, 2004

2003
Program optimization: enforcement of local access and array access via pointers.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2003

Spreadsheet-aided numerical experimentation: analytic formula for Fibonacci numbers.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2003

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

Distributed multiprocessor environments.
[BibTeX]
[DOI]
Timothy J. Rolfe
J. Comput. Sci. Coll., 2002

2001
Binomial coefficient recursion: the good, and the bad and ugly.
[BibTeX]
[DOI]
Timothy J. Rolfe
ACM SIGCSE Bull., 2001


  Loading...