Education
Ph.D. Computer Science, Iowa State University
Research Papers
 Adam Case and Jack H. Lutz. Finitestate mutual dimension. The Proceedings of the 58th Allerton Conference on Communication, Control, and Computing (Allerton 2022, Monticello, IL, September 2730, 2022).
 Adam Case and Christopher P. Porter. The intersection of algorithmically random closed sets and effective dimension. ACM Transactions on Computational Logic 23 (October 2022), p. 119.
 Adam Case. Using computer game software in a firstyear seminar and its effects on students' creative selfefficacy, creative personal identity, and insight problem solving abilities. TechTrends 66 (July 2022), pp. 631642.
 Adam Case. Bounded Turing reductions and data processing inequalities for sequences. Theory of Computing Systems, 62 (October 2018), pp 15861598.
 Adam Case and Jack H. Lutz. Mutual dimension and random sequences. Theoretical Computer Science 731 (June 2018), pp 6887.
 Adam Case, Jack H. Lutz, and D. M. Stull. Reachability problems for continuous chemical reaction networks. Natural Computing 17, Issue 2 (June 2018), pp. 223230.
 Adam Case and Jack H. Lutz. Mutual dimension. ACM Transactions on Computation Theory 7, Article 12 (July 2015), 26 pages.
Advised Student Research
Papers
 Nicole Lacey. Using LempelZivWelch Compression to Describe the Predictability of Fly Movements. Consortium for Computing Sciences in Colleges: Central Plains (CCSC: Central Plains, April 2122, 2023).
 Noah S. Peterson. Mutual Information Using LZWCompression. Consortium for Computing Sciences in Colleges: Central Plains (CCSC: Central Plains, April 2122, 2023).
 Scott Molloy. Twodimensional normality and finitestate compressibility. Consortium for Computing Sciences in Colleges: Central Plains (CCSC: Central Plains, online, April 910, 2021).
 Alec McGlasson, Daniel Madison, and Gavin Menning. Software for visualizing and analyzing dynamical systems in R^{2}. Consortium for Computing Sciences in Colleges: Central Plains (CCSC: Central Plains, online, April 910, 2021).
 Benjamin Valpey. Using hyperheuristics to solve the job shop scheduling problem. Consortium for Computing Sciences in Colleges: Central Plains (CCSC: Central Plains, Cottleville, Missouri, April 56, 2019).
Posters
 Joel Afriyie. SemiSupervised Distance Metric Learning Using Relative Comparisons. Drake University Conference on Undergraduate Research in the Sciences (DUCURS, Des Moines, IA, April 12, 2018).
Conference Talks
 FiniteState Mutual Dimension, 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton 2022), University of Illinois, Monticello, IL, September 2730, 2022.
 FiniteState Mutual Dimension, International Conference on Computability, Complexity, and Randomness 2022 (CCR 2022), Isaac Newton Institute for Mathematical Sciences, Cambridge, England, virtual presentation, June 610, 2022.
 FiniteState Mutual Dimension, Computability and Complexity in Analysis 2022 (CCA 2022), Arcadia University, Glenside, PA, virtual presentation, May 2325, 2022.
 Developing FirstYear College Students' Problem Solving Abilities through GameBased Learning, Teaching Hour, Northeastern Section of the MAA, virtual presentation, November 1920, 2021.
 Developing FirstYear College Students' Problem Solving Abilities through GameBased Learning, Contributed Paper Session on Math in Action, MAA MathFest 2021, virtual presentation, August 47, 2021.
 Using Computer Game Software to Teach Creative Problem Solving in a FirstYear Seminar, Contributed Paper Session on Combining Technological Tools and Innovative Practices to Improve Student Learning Outcomes, Joint Mathematics Meetings 2021, virtual presentation, January 69, 2021.
 Coupled Randomness and a Mutual Divergence Formula, Equidistribution: Arithmetic, Computational and Probabilistic Aspects, Institute for Mathematical Sciences, National University of Singapore, Singapore, April 29May 17, 2019.
 Mutual Dimension and Random Seuquences, Special Session on Algorithmic Dimensions and Fractal Geometry, Joint Mathematics Meetings 2019, Baltimore, MD, January 1619, 2019.
 Bounded Turing Reductions and Data Processing Inequalities for Sequences, Special Session on Computability and Complexity in Discrete and Continuous Worlds, AMS Sectional Meeting, Minneapolis, 2016.
 Turing Reductions and Data Processing Inequalities for Sequences, 11th International Conference on Computability, Complexity, and Randomness (CCR), Honolulu, Hawaii, January 48, 2016.
 Mutual Dimension and Randomnes Sequences, 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), Milan, Italy, 2015.
 Mutual Dimension, Iowa Section of the MAA Mathematics Meeting, 2014.
 Mutual Dimension, Special Session on Computability and Complexity in Discrete and Continuous Worlds, AMS Sectional Meeting, Ames, 2013.
 Mutual Dimension, 30th Symposium on Theoretical Aspects of Computer Science (STACS), Kiel, Germany, 2013.
Teaching
 Programming Languages (spring 2022, spring 2023)
 ObjectOriented Programming (spring 2022, fall 2022, spring 2023)
 The Art of Problem Solving, FirstYear Seminar (fall 2019, fall 2020, fall 2021, fall 2023), Drake University
 Data Structures and Algorithnm Analysis (spring 2018, spring 2019, spring 2020), Drake University
 Introduction to Computer Science II (fall 2016, spring 2017, fall 2017, spring 2018, fall 2019, spring 2020, fall 2020, spring 2021, fall 2023), Drake University
 Discrete Mathematics (fall 2017, fall 2021, fall 2022), Drake University
 Theory of Computation (spring 2017, fall 2018, spring 2021), Drake University
 Introduction to Data Structures (summer terms 20112015), Iowa State University
Other Professional Activities
