Honors Theses
Honors In Mathematics & Honors In Computer Science
The Department of Mathematics and Computer Science grants honors to graduating students with outstanding records of accomplishment in mathematics or computer science, as demonstrated in three areas:
- breadth of curriculum,
- quality of academic performance, and
- significance of scholarly project.
Students should review the that explains the process to become an honors candidate. Candidates must:
- complete a specified selection of courses,
- attain a minimum overall GPA of 3.2, as well as a GPA of at least 3.5 on all courses that either fulfill a major requirement or a course requirement for honors, and
- undertake advanced work, supervised by a faculty member, culminating in a thesis successfully defended before a departmental committee.
Additionally, the department may choose to confer high honors upon a candidate who displays unusual independence and initiative, develops original results, and clearly and rigorously communicates these via a high-quality thesis and oral defense.
Some of our past Honors Theses
Cox, Caroline, Pattern-Avoiding Desarrangements, 2025
Guth, Alice A., Virtual Reality: Measuring Movement and Mapping Bias, 2025
Harkins, Grant, Analysis of Order-Dependence and Accuracy in Rating Methods, 2025
Jones, Andrew J., A Machine Learning Approach to Expanding the Degrees of Freedom on Phone-Based Head Mounted Displays, 2025
Pakenas, Paige, Mathematical Insights for the Baltimore Orioles: Exploring Problems Related to Changepoint Detection and Predictive Modeling, 2025
Tuller, Jr, William Porcher Dubose, What Do Machines Understand About Music? An Analysis of Vector Embeddings and What They Encode, 2025
Wood, Kenan, Computational Combinatorics: Union-Closed Sets, Pebbling Graphs, and Formal Methods, 2025
Wood, Kenan, Distributed Computing: Arrovian Impossibilities, Blockchain Consensus, and Decentralized Applications, 2025
Ahmadi, Shahin, Time Series Classification of Fly Microbehaviors: An Application of Minirocketin Computational Neuroethology, 2024
Cha, Pauline W., Combating Discrimination: VR in the Classroom Against Stereotype Threat, 2024
Kalani, Malavika, Decoding Google’s Pagerank: A Critical Analysis pf Community Structures on Search Results, 2024
Rivera, Jr., Johnny, Counting Pattern Avoiding Permutations by Big Descents, 2024
Turk, Umut, Building a 2-Level Reliable Broadcast Algorithm, 2024
Vulpis, Cole Nathan, Evolution of the NBA: Analyzing Rebounding Trends Using Player Tracking Data, 2024
Clark, William Lathrop, Kernels of Descent Statistics, 2023
Elzatahry, Basel, Word-Level American Sign Language recognition Using Transformer and hybrid Models, 2023
Smith, Will, Ramsey Theory on the Integer Grid and the “L” Problem, 2023
Wang, Yanni (Mareen), Graph Pebbling on Grids, 2003
Baker, Noah, Triangle Degrees, 2022
Gatchel, Madelyn, Variable-Player Learning for Simulation-Based Games, 2021
Hayne, Roxana (Ana), Load Balancing in Lazy Implementations of Concurrent Data Structures, 2020
Li, Man (Max), Redefine the Hot Hand: Perception of Hotness Changes the Game, 2020
O’Neill, Aidan, Distributed Artificial Intelligence, 2020
Robertson, Michael David, Restricted Numerical Ranges of Digraph Laplacians, 2020
Strauss, Ryan, Task-Aware Multi-Task Agents, 2020
Thomas, Samuel C., Using Layering and Data Partitioning Techniques to Increase NUMA-Locality and Performance in Concurrent Data Structures, 2020