About Me

Welcome to my site! I’m Andrew Krapivin, a first-year PhD student in computer science at CMU, advised by William Kuszmaul and Elaine Shi. Broadly, I am interested in developing theory, particulary for data structures and security, and finding new applications in which it can be useful. I am currently working on incremental open-addressed hash tables (the first paper in this series has already been published and was featured in quanta), new ORAM constructions, and reducing the number of clauses in SAT formulas. Also, I have worked on improving the performance of hash tables at high load factors, on succinct graph representations (biclique decompositions), on a computational model to capture out of order execution on modern CPUs, on comparing encoders and (reasoning) decoders from a theoretical perspective, and more.

I previously completed an MPhil in Advanced Computer Science at Cambridge University, funded by a Churchill Scholarship. Before that, I received a BS in mathematics and computer science from Rutgers University.

If you want to discuss anything, feel free to reach out!