The Harvey Mudd College Department of Computer Science graduated its first class in 1992. Since then, the department has grown to its current size of eighteen tenure-track faculty, several visiting or adjunct faculty, and five staff members.

In addition to the Computer Science Major, the department supports the Joint Major in Computer Science and Mathematics and the Mathematical and Computational Biology Major. There are currently approximately 80 students total per graduating class in these three majors.

The department works closely with our sister departments at Pomona and Claremont McKenna Colleges and our courses draw students from all five Claremont Colleges and the Claremont Graduate University.

The department seeks to provide students with a strong foundational background blending experimentation, theory, and design. Our graduates are equally well-prepared for work in industry and graduate school. The capstone Clinic Program provides students with a year-long software design project and our active Research Program involves approximately 50 students in research, funded by grants and gifts from the National Science Foundation, Howard Hughes Medical Institute, and the Rose-Hills and Baker Foundations.

Department News

  • [September 2, 2021] Along with Professor George Montañez, students Eric M. Weiner '21,  Aaron Trujillo '21, Abtin Molavi '21 published a paper titled "Hyperparameter Choice as Search Bias in AlphaZero" in the 2021 IEEE International Conference on Systems, Man, and Cybernetics. The paper looks at how the choice of a hyperparameter in the deep reinforcement learning system AlphaZero acts as a biasing mechanism, allowing human input into what has been argued to be a learning system that lacks human input.
  • [August 16, 2021] Along with Professors Yi-Chieh (Jessica) Wu and Ran Libeskind-Hadas, student Matthew LeMay '21 published a paper titled "The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization is NP-Hard" in the Workshop on Algorithms in Bioinformatics (WABI) 2021. Matthew presented the paper.
  • [August 16, 2021] Along with Professors Yi-Chieh (Jessica) Wu and Ran Libeskind-Hadas, student Matthew LeMay '21 published a paper titled "A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks" in the IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • [July 16, 2021] Along with Professor George Montañez, students Amani Maina-Kilaas '23, Cynthia Hom '23, Cindy Lay CMC '22 and Kevin Ginta (Biola University, '21) will present a paper titled "The Hero's Dilemma: Survival Advantages of Intention Perception in Virtual Agent Games" at the 2021 IEEE Conference on Games.
  • Along with Professor George Montañez, students Jonathan Hayase '20, Julius Lauw  '20, Dominique Macias '19, Akshay Trikha '21 and Julia Vendemiatti '21 published a paper titled "The Futility of Bias-Free Learning and Search." Learning algorithms are machines that turn data resources into predictions. Their paper shows that unless algorithms do this conversion in a biased way, predisposing their predictions toward predetermined outcomes, they cannot predict any more accurately than random guessing. The paper proves that finding a good bias for a given problem is difficult, when searching among any set of data resources that on average isn't itself positively biased. These results apply to machine learning algorithms, AI systems, genetic learning algorithms, and many other forms of search and optimization.
  • Mara Downing, Chris Thompson and Professor Lucas Bang had their paper titled "Automatically Solving Deduction Games via Symbolic Execution, Model Counting, and Entropy Maximization" accepted at the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment Strategy Game Workshop. Mara and Chris designed a DSL for expressing a class of puzzles called "deduction games", implemented a symbolic execution engine for it using an automated theorem prover, and then wrote and entropy maximizer that outputs the steps of game solution. The main takeaway is that you can give their system the source code of a game and it will then automatically solve the game, playing it in real time.
  • Professor Geoff Kuenning co-authored the paper "Graphs Are Not Enough: Using Interactive Visual Analytics in Storage Research", which appeared in the Usenix HotStorage '19 Workshop. The paper presents a visualization tool that helps system designers and experimenters explore the vast number of possibilities available (often millions or more) when configuring storage systems. The tool makes it easy to "zero in" on the parameters that have the most impact on performance in a chosen situation, so that an analyst can quickly find the best settings for a given environment.
  • The International Conference on Automated Planning and Scheduling (ICAPS) has accepted three papers co-authored by Professor Jim Boerkoel with students working in his HEATLab (the Human Experience & Agent Teamwork Lab).  The papers are:  "Quantifying Degrees of Controllability in Temporal Networks with Uncertainty", written with Shyan Akmal '19, Savana Ammons '20, and Maggie Li '19;  "Measuring and Optimizing Durability Against Scheduling Disturbances", written with Joon Lee '20 and Viva Ojha '19; and "Reducing the Computational and Communication Overhead of Robust Agent Rescheduling", written with Jordan Abrahams '19 and co-author Jeremy Frank. The papers will be presented at the ICAPS conference in Berkeley, CA in Summer 2019.