Math & Computer Science

Richard Denman

Professor of Math & Computer Science

Areas of expertise
Satisfiability theory, graph theory, combinatorics.

Education

MA, University of Texas at Austin 1992
PhD, University of Texas at Austin 1981
MS, Texas Tech University 1975
BA, Texas Tech University 1972

Teaching Philosophy

I believe that the best kind of learning is discovery learning, and I do all that I can to model that type of learning for my students by my own learning behaviors. I try to show them the joys of learning through playful, challenging activities.

Courses: Spring 2014

Computer Science II
Computer Systems
Sr Sem in Software Engineering

Previous Courses

Statistics, Database Theory, Algorithms, Compiler Design, Programming Languages, Algorithms (C++ based), Computer Organization, Discrete Mathematics, Theory of Computation, Computer Science I , Introduction to Programming, Introduction to Computing, Extreme Programming, Algebraic Structures I and II, Linear Algebra, Calculus I and II, Geometry, Topology, Theory of Computation, and Mathematical Concepts, First Year Seminar("Puzzle Me This!"), Computer Systems, Rapid Application Development, and Senior Seminar in Software Engineering.

Research

1-in-3 SAT problem, NAE 3-SAT problem, Hypergraph coloring, Eccentric graphs, Combinatorics

Professional Work

Software Engineer at National Instruments -- summers 1998-1990 and 1997-2002.

Publications

Some Families of Fixed Points for the Eccentric Digraph Operator, August 2009, jointly
authored with Barbara M. Anthony and Alison M. Marr. To appear in the Journal of
Combinatorial Mathematics and Combinatorial Computing.

The Tower and Glass Marbles Problem, May 2009, jointly authored with David Hailey,
and Mike Rothenberg. To appear in the November 2010 issue of the College
Mathematics Journal, a publication of the Mathematical Association of America.

Using Clausal Graphs to Determine the Computational Complexity of k-Bounded
Positive One-in-Three SAT
, December 2007, jointly authored with SU student
Stephen Foster, in the April 2009 issue of the Journal of Discrete Applied
Mathematics (Volume 157, issue 7).

Derivation of Recursive Algorithms, February 1996, SIGCSE Bulletin, Volume 28, Number
1, pp 9-13. Presented at the national meeting of SIGCSE in Philadelphia, PA.

Derivation of Programs for Freshmen, March1994, SIGCSE Bulletin, Volume 26, Number1,
pp 116-120. Jointly authored with David Naumann, Walter Potter, and Gary Richter.
Presented at the national meeting of SIGCSE in Phoenix, AZ.

A Toroidal Systolic Array for Warshall's Algorithm, April 1991, Proceedings CSC '91.
Jointly authored with SU student Travis B. Rowell.

Approximations and Decompositions in S3, Topology and its Applications 24 (1986) pp. 83-
93, jointly authored with Michael Starbird.

Countable Starlike Decompositions of S3. Continua, decompositions, manifolds (Austin,
Tex.,1980), 128-131, Univ. Texas Press, Austin, TX, 1983.

k-Arc Hamilton Graphs, Theory and Applications of Graphs (Lecture Notes in Mathematics),
Proceedings, Michigan, 1976, 545-556. Jointly authored with Dalton Tarwater.


Seminars & Presentations

k-Bounded Positive Not All Equal LE3-SAT, June 2009, jointly authored with Barbara
M. Anthony. Accepted by the Brown Working Papers, Southwestern University.
k-Bounded Positive One-in-Three SAT, April 2009, presentation of work jointly authored
with SU student Stephen Foster, at the Texas Section Meeting of the MAA,
University of North Texas.

The Binary Hull Algorithm, April 1998, presented at the Texas Section Meeting of the MAA,
at Southern Methodist University.

Two-Dimensional Recurrence Relations, April 1997, presented at the Texas Section Meeting
of the MAA, at Texas Lutheran University.

Catalan's Triangle, April 1995, presented at the Texas Section Meeting of the MAA, at the
University of North Texas.

An Optimal Systolic Array for Standard Matrix Multiplication. May 1990 manuscript, jointly
authored with SU student Robert W. Green.

Shrinking Countable Cellular Decompostions of S3. Continua, decompositions, manifolds --
Proceedings of Texas Topology Symposium 1980.


Groups & Affiliations

Special Interest Group in Computer Science Education, Mathematical Association of America, American Mathematical Society, Society of Industrial and Applied Mathematics