Adam D. Groce

Below is a brief list of my past teaching and (where possible) links to course web pages and materials. (If a course is not linked, that generally means it was run off a Moodle page, and students can access it there.) If you are an instructor looking to use any of these materials in courses taught elsewhere I am happy to allow it, but please let me know you are doing so.

Previous Reed classes

  • CSCI 121: Introduction to Computing
    Fall 2014, Fall 2015, Fall 2017, Spring 2017
  • MATH/CSCI 382: Algorithms and Data Structures
    Spring 2015, Spring 2016, Fall 2018
  • MATH/CSCI 387: Computability and Complexity
    Fall 2014, Fall 2015, Fall 2016, Fall 2017, Fall 2018
  • MATH/CSCI 388: Cryptography
    Spring 2017, Fall 2018
  • MATH/CSCI 441: Topics in Computer Science Theory

Reed Senior Theses

Below are the senior theses I have advised. Asterisks denote theses that were co-advised with someone else. All theses are available through the Reed library. Where thesis work has appeared in a paper, I have included a link.

  • Galen Harrison (2014-15) - Implementation and analysis of differentially private algorithms
  • Nathan Duncan (2015-16) - Zero knowledge proofs
  • Joshua Gancher (2015-16) - Fully homomorphic encryption
  • Alex Ledger (2015-16) - Efficient secure multiparty computation through precomputation [Paper]
  • Taylor Allen (2016-17) - Rational secret sharing schemes
  • Nick Franzese* (2016-17) - Algorithms for shortest path in hypergraphs [Paper]
  • Erik Lopez* (2016-17) - Password-based key derivation functions
  • Benjamin Morrison* (2016-17) - Relating the BQP and NISZK complexity classes [Paper]
  • Mark Schultz* (2017-18) - Lattice-based cryptography
  • Palak Jain (2017-18) - Oblivious RAM and oblivious data structures
  • Ira Globus-Harris (2018) - Differentially private ANOVA testing [Paper]

Other Teaching