Most of my research papers are in the general area of asymptotic methods in combinatorics; however, I am willing to look at any concretely stated problem in mathematics.  I particularly appreciate computational experimentation as a means of achieving mathematical insight, and I am an avid user of Maple. Using the computer in this manner goes back, for me, to the keypunch era, beginning in graduate school. The areas of computer science which interest me most are theory, programming, algorithms, data structures, and complexity theory. Quoting from the introduction of an old research grant, "Asymptotic methods refer to the utlization of analysis, probability theory, and combinatorics to discover approximate solutions to combinatorial problems whose exact solutions can not be obtained in any meaningful form. Such approximate results facilitate applications and yield theoretical insights."