Contact Information
-
Office: Avery 336
Office Phone: 402-472-8176
-
Email: s-dstolee1@math.unl.edu
Courses Taught
- CSCE 424/824 - Complexity Theory
- Instructor.
- Computational Models, Complexity Classes, Boolean Circuits, and other advanced topics.
- MATH 102 - Trigonometry
- Instructor.
- Measure of angles, trigonometric functions, identities and proofs.
- CSCE 424/824 - Complexity Theory
- Co-instructor, with Vinod Variyam.
- Computational Models, Complexity Classes, Boolean Circuits, and other advanced topics.
- CSCE 150A - Problem Solving with Computers Laboratory
- with Chris Bourke.
- C programming language, file I/O, memory management, arrays, structures
- CSCE 361 - Software Engineering
- Project Support with Sebastian Elbaum.
- Basics of software engineering, testing, architecture
- Project: test, analyze, and enhance RSSOwl.
- Math 107 Calculus and Analytic Geometry II
- Fall 2008 with Steve Cohn, Irakli Loladze.
- Spring 2008 with Roger Wiegand, Mohammed Rammaha.
- Fall 2007 with Steve Cohn, Mikil Foss.
- Exam 1 Study Guide
- Exam 2 Study Guide
- Exam 3 Study Guide
- Integration, sequences and series, applications
Undergraduate Teaching Assistant
- RAIK 183H - Foundations of Computer Science I
- Fall 2005 with Myra Cohen.
- Fall 2006 with Leen-Kiat Soh.
- Java programming language, object-oriented programming, GUI
- RAIK 184H - Foundations of Computer Science
- Spring 2005, 2006 with Steve Reichenbach.
- C++ programming language, basic algorithms, UNIX
- CSCE 235 - Introduction to Discrete Structures
- Spring 2006, with Brian Kell.
- Logic and proofs, sets, graphs, algorithms
Derrick Stolee
Derrick is a computational graph theorist in the Joint Mathematics and Computer Science Ph.D. program at the University of Nebraska-Lincoln.
He is interested in extremal and structural problems in graph theory as well as problems in complexity theory, especially reachability problems.




