Jon's Home Page
Spring 2008 Semester Schedule
| Course Title | Number | Days | Time | Room |
|---|---|---|---|---|
| OOP and Data Structures | CS248 01 | MTWRF | 10:00-10:50 | FB148 |
| Computer Organization | CS321 01 | MWF | 11:00-11:50 | FB148 |
| Butler Brown Bag | R | 12:00-1:00 | PB103 | |
| Office Hours
(or by appointment) |
MWF | 1:00-1:50 | FB158 | |
| TR | 11:00-11:50 | |||
| Department Meetings - CSSE | M | 12:00-12:50 | FB142 | |
| LAS Heads Meetings (1/17,1/31,2/14,2/28,3/6,3/20,4/3,4/17,5/1) | R | 3:00-4:30 | AU302 | |
| FAEC Meetings
(1/18,2/8,4/11)
FAEC Meeting (3/20) |
F | 2:30-3:30 | AU302 | |
| 4:00-5:00 | RB212 | |||
| FA Meetings (1/25,2/22,3/28[3:30],4/25) | F | 3:00-4:00 | TBA | |
Summer I 2008 Schedule
I am not scheduled to teach any courses during Summer I.
I will be attending ANTS-8 at Banff in Alberta, Canada, May 17-22, 2008, as one of the organizers.
Probably during the first week of June, I'll run a short workshop for students and faculty on how to write parallel programs for the Big Dawg, our supercomputer.
Summer II 2008 Schedule
| Course Title | Number | Days | Time | Room |
|---|---|---|---|---|
| Topics: Web Programming | CS473, indep. study
(Kyle Ehmke, Sarah Rodenbarger) |
TBA | TBA | FB158 |
| Operating Systems | CS431, indep. study
(Mike Lutkewitte) |
TBA | TBA | FB158 |
| Organization of Programming Languages | CS441, indep. study
(Kyle Ehmke) |
TBA | TBA | FB158 |
| Office Hours | Weekdays | by appointment | FB158 | |
My Research Interests
By training, I am a theoretical computer scientist; I like to study algorithms. My primary interest is in algorithmic number theory, which is the design and analysis of algorithms (including parallel algorithms) for problems that arise in number theory. The problems in number theory that interest me include factoring large integers, testing for primality and listing primes, computing greatest common divisors (such as Euclid's algorithm), computing Jacobi symbols, and other related problems.
Two of the main application areas for number theoretic algorithms are in cryptology (the study of methods for sending secret messages) and in computer algebra (this includes software like Mathematica or Maple). Computational number theory is closely related to algorithmic number theory, but the research focus is on solving number theory problems as opposed to studying algorithms.
Brief Bio
I was born in 1964 in Valparaiso, Indiana. I earned a bachelors degree in CS and mathematics with a minor in physics from Valparaiso University in 1986, a masters in CS in 1987, a masters in mathematics in 1989, and a PhD in CS in 1991, all from the University of Wisconsin. I have been at Butler since then.
Chelle and I were married in 1986, and Brianna, our only child, was born in 1998. We have six cats, a hamster, some aquatic frogs, and some fish.
I am an active member of Fairview Presbyterian Church, I am a second degree black belt in Shorei Goju Ryu Karate, I like to play strategy-based computer games (such as Civilization), I play softball for our church league in the summer, and I'm a fan of the Pacers, Fever, Colts, Cubbies, Red Sox, and of course all Butler Sports, especially the women's basketball team -- they let me be an Honorary Faculty Coach for one game in Spring 2004.
