1. An article on list-labeling work was featured in CACM News.
2. A paper on low-associativity caching won Distinguished Paper at SPAA'25.
3. Research on the list-labeling problem was featured in Quanta and Wired.
4. Work on incremental open addressing, led by Andrew Krapivin, was featured in Quanta and Wired.
5. A paper on distributed load balancing won Best Paper at SPAA'24.
6. His PhD Thesis won Honorable Mention for the ACM Doctoral Dissertation Award, the EATCS Distinguished Dissertation Award, and the MIT George M. Sprowls PhD Thesis Award.
7. A paper on faster TLBs was selected as an IEEE MICRO Top Pick for 2023.
8. Quanta Magazine wrote an article about his work on space-efficient dictionaries.
9. A paper on applying data-structural techniques to hardware TLBs won the Distinguished Paper Award at ASPLOS'23.
Research Experience
Extensive experience in the field of designing and analyzing randomized data structures, including several award-winning research projects.
Education
Specific educational background details are not provided, but his PhD thesis has won multiple awards.
Background
Assistant Professor of Computer Science at Carnegie Mellon University, focusing on the design and analysis of randomized data structures. He also writes a blog named Algorithm Soup.
Miscellany
No specific personal interests or hobbies mentioned.