I joined Europa in the spring of 2002.
Research Interests
Current Projects
Completed Projects
Return to Europa
Complexity theory seems fascinating at this point.
I also like to believe I am interested in AI, though I will not be
certain until I take a few AI courses.
Also on the list, is the idea of theorem-proving algorithms.
As I continue to learn more about computer science, this list will
certainly increase/decrease in size.
The focus of this project is to develop algorithms and techniques to solve scheduling problems with prerequisites. The goal is to allow an ambitious OSU student to complete his degree in the shortest number of quarters subject to a few constraints. The general problem seems NP-hard though this has not been proved as of yet. Therefore, most of the work related to this project involves finding effective polynomial-time heuristics to produce near-optimal results. We are also aware that simplified versions of this problem can be solved by existing Integer Programming methods and plan to implement this in the future.
This project aims to develop additional written material for students enrolled in the CIS 221, 222 & 321 courses, to aid in their understanding of key concepts important to this course sequence.
Below, three topics where additional written material was deemed necessary, are listed-:
1. Pointers
2. Predicate Calculus
3. Topics from Set Theory
The preliminary appendix was completed in Spring '03 and is available on the project web page.