Number Theory
New Results on Primes from an Old Proof of Euler's, by Charles W. Neville. April 2003 revision 1 of a paper and a talk delivered before the Wesleyan Topology Et. Al. Seminar, September 2002.
Cryptography
Strong Cryptography and Public Policy, by Charles W. Neville, a talk delivered before the Computer Law Section of the Connecticut Bar Association, April 2002.
Codes and Internet Security, by Charles W. Neville, April 1999. An expository beginning undergraduate cs  math level talk.


Theoretical Computer Science.
The NP vs P Problem.
Talk 1. The NP = P Conjecture, a general introduction, by Charles W. Neville, October 2000. An expository beginning undergraduate cs  math level talk.
Talk 2. The NP vs P Problem, why it is hard, by Charles W. Neville, October 2000. An expository advanced undergraduate cs  math level talk.
Operator Theory and Functional Analysis.
Invariant Subspaces and Lomonosov's Theorem, by Charles W. Neville, March 1999. An expository graduate mathematics level talk.
