CS&E Profile: Carl Sturtivant
I teach mainly discrete mathematics, algorithms & data structures, automata theory, computability, complexity
theory at both undergraduate and graduate levels, and also internet & network programming as well as beginning
programming in various languages. I also supervise some independent study and undergraduate projects. Additionally
I coach the intercollegiate programming contest teams for the regional (and occasionally world final) contest.
CSci 1103 Introduction
to Programming in Java
Here are some selected publications. For more details about the content of these, see my personal home page linked above.
Finite Field Arithmetic versus Bit Operations:
Algebraic and Finite Field Circuits, Algebraic analogues of Boolean circuit complexity, One-Way-Functions, Finite Field Arithmetic versus Bit Operations, Permanent versus Determinant, Quantum Circuits, Probability as Scientific Reasoning, Entropy based Probability Assignments.
PhD 1983, Computer Science at Edinburgh University, Scotland.
Diploma (MS) 1980, Computer Science at Churchill College, Cambridge University, England
BA 1979, MA 1982, Theoretical Physics at Churchill College, Cambridge University, England