Graduate Courses Taken
- 2009-2010
- MATH 921/922 - Real Analysis - with Mohammed Rammaha
- CSCE 835 - Cluster and Grid Computing - with David Swanson
- 2008-2009
- MATH 832 - Linear Optimization - with Stephen G. Hartke
- MATH 958 - Topics in Graph Theory - with Stephen G. Hartke
- CSCE 896 - Wireless Sensor Networks - with Mehmet Can Vuran
- CSCE 990 - Topics in Complexity Theory - with N.V. Vinodchandran
- MATH 958 - Topics in Graph Codes - with Christine Kelley
- CSCE 876 - Artificial Intelligence - with Berthe Chouiery
- CSCE 970 - Pattern Recognition - with Stephen D. Scott
- 2007-2008
- MATH 901/902 - Algebra I & II - with Sylvia Wiegand
- MATH 918 - Topics in Coding Theory - with Judy Walker
- MATH 825/826 - Analysis I & II - with Allan Donsig
- CSCE 824 - Computational Complexity - with N.V. Vinodchandran
- 2006-2007
- MATH 817/818 - Intro to Modern Algebra I & II - with Mark Walker
Derrick
is a graduate student in the Joint Mathematics and Computer Science
Ph.D. program at the University of Nebraska-Lincoln. Research areas
include Graph Theory, Graph Algorithms, and Computational Complexity.
