|
Dr. Jessen T. Havill
Ph.D. in Computer Science from The College of William and Mary, 1998
M.S. in Computer Science from The College of William and Mary, 1994
B.A. in Computer Science and Religion from Bucknell University, 1992
See full resume [pdf] |
Teaching
I teach a variety of computer science courses, but I particularly enjoy theory-related courses like Discrete Mathematics and Algorithms, and systems courses like Computer Networks and Operating Systems. In addition, I am interested in helping students improve their technical speaking and writing skills.
Current Courses (Spring, 2013)
CS 111: Foundations of Computing for Scientific Discovery
CS/MATH 275: Elementary Graph Theory
CS 371: Algorithm Design and Analysis
Past Courses
FYS 102: Algorithmics | Bioinformatics
CS 111: Foundations of Computing for Scientific Discovery
CS 171: Introduction to Computer Science
CS 173: Intermediate Computer Science
CS 200: DNA Algorithms | Mathematical Typesetting | Mac OS X Programming
CS 272: Data Structures & Algorithm Analysis II
CS/MATH 275: Elementary Graph Theory
BIOL/CS 309: Computational Biology
CS 377: Database Systems
Pedagogical Publications
Markov Processes [pdf]
Computational Science Across the Curriculum, Capital University
Computer Scientists Wanted! Strategies for Increasing Interest in Computer Science (panel summary) (with Karen Anewalt, Chang Liu, and Jennifer Polack-Wahl)
In Proceedings of the 40th Annual ASEE/IEEE Frontiers in Education Conference, F3B1-2, 2010
Technically Speaking: Fostering the Communication Skills of Computer Science and Mathematics Students [pdf] (with L. D. Ludwig)
In Proceedings of the 38th ACM SIGCSE Technical Symposium on Computer Science Education, pp. 185-189, 2007
Research
My research largely focuses on the design and analysis of algorithms for online network routing and machine scheduling problems. An online algorithm is one that processes its input one element at a time instead of all at once like a traditional algorithm. For example, an online room scheduling algorithm would have to assign a room to each event as it "arrives" without knowing what events might need to be scheduled later. Online algorithms usually cannot come up with optimal solutions due to their lack of knowledge about the future. Instead, we try to design algorithms that find solutions that are provably within some factor of optimal.
Publications
Optimal Online Ring Routing [pdf] (with K. R. Hutson)
Networks 57(2), pp. 187-197, 2011
Online Malleable Job Scheduling for m ≤ 3 [pdf]
Information Processing Letters 111(1), pp. 31-35, 2010
Computer Scientists Wanted! Strategies for Increasing Interest in Computer Science (panel summary). Karen Anewalt, Jessen Havill, Chang Liu, and Jennifer Polack-Wahl. Proceedings of the 40th Annual ASEE/IEEE Frontiers in Education Conference, F3B1-2, October, 2010.
An Algorithm for Detecting TPP Riboswitches in Archaea (poster, with C. Bhatiya and J. S. Thompson)
Ohio Collaborative Conference on Bioinformatics (OCCBIO), 2009
Competitive Online Scheduling of Perfectly Malleable Jobs with Setup Times [pdf] (with W. Mao)
European Journal of Operational Research 187(3), pp. 1126-1142, 2008
Improved Parallel Job Scheduling with Overhead [pdf] (with W. Mao and V. Dimitrov)
In Proceedings of the Seventh Joint Conference on Information Sciences, pp. 393-396, 2003
Online Packet Routing on Linear Arrays and Rings [pdf]
In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 2076, pp. 773-784, 2001
A Competitive Online Algorithm for a Parallel Job Scheduling Problem [pdf]
In Proceedings of the 12th IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 611-616, 2000
Greedy Online Algorithms for Routing Permanent Virtual Circuits [pdf] (with W. Mao)
Networks 34(2), pp. 136-153, 1999
On-line Algorithms for Hybrid Flow Shop Scheduling [pdf] (with W. Mao)
In Proceedings of the Fourth Joint Conference on Information Sciences, pp. 134-137, 1998
Greedy On-line File Transfer Routing (with W. Mao)
In Proceedings of the IASTED International Conference on Parallel and Distributed Systems, pp. 225-230, 1997
A Lower Bound for On-line File Transfer Routing and Scheduling (with W. Mao and R. Simha)
In Proceedings of the 31st Annual Conference on Information Sciences and Systems, pp. 936-941, 1997
On-Line Update of Traveling Salesman Tours
In Proceedings of the 34th Annual ACM Southeast Conference, pp. 218-223, 1996