My name is Rod Hilton, I’m in my fourth year of the PhD program at UC Denver, pursuing a degree in Computer Science and Information Systems.
My research interests are Metaheuristics, Graph Theory, NP-Hard Optimization Problems, Approximation Algorithms, and Complexity.
I earned my B.S. in Computer Science at the University of Rochester and my M.S. in Software Engineering at Regis University. In addition to being a student, I work full-time as a Software Engineer.
CSCI 7002: Computer Security
As a class project, I researched and implemented an attack on monoalphabetic substitution ciphers using Genetic Algorithms.
- Paper: Automated Cryptanalysis of Monoalphabetic Substitution Ciphers Using Stochastic Optimization Algorithms
- Presentation: Breaking Monoalphabetic Substitution Ciphers using Generic Algorithms
- Implementation: Geneticrypt
CSCI 7173: Computational Complexity and Algorithms
I gave the class a presentation on the Cook-Levin theorem and the SAT problem
- Presentation: SAT: The First NP-Complete Problem
For a class project, I did a literature review looking at a number of important complexity classes outside of the usual P and NP.
CSCI 7582: Artificial Intelligence
As a semester project, I created an implementation of the shortest path discovery algorithm detailed in Boris Stilman’s book “Linguistic Geometry: From Search to Construction”.
ISMG 7210: Topics in Analytical Research Management
I presented a review of an article detailing an experimental evaluation feature extraction for blind steganalysis
- Presentation: Detecting Codes
Derek Kern and I also performed an experiment analyzing the ability to undermine steganography detection by preprocessing images with different filters.
- Presentation: Priming for Steganography
- Paper: Priming for Steganography: Undermining Steganalysis through the Introduction of Superfluous Variation
CSCI 5408: Applied Graph Theory
My semester project was to implement a Genetic Algorithm that attempts to find a 3D Rectangle Visibility Diagram for the K23.