Magdalen Dobson

mrdobson [at] cs [dot] cmu [dot] edu

Computer Science Department
Carnegie Mellon University


I am a fourth-year PhD student at Carnegie Mellon University. I am advised by Guy Blelloch and supported by an NSF GRFP Fellowship.

I am interested in designing parallel and concurrent algorithms for solving problems related to similarity search, information retrieval, and computing nearest neighbors, with a particular focus on similarity search in high dimensions. Much of my recent work can be found in the ParlayANN repository, a benchmark suite of high-dimensional nearest neighbor algorithms along with a set of useful tools for designing such algorithms.

In Summer 2022, I interned with Harsha Vardhan Simhadri at Microsoft Research Redmond. During my undergraduate studies at MIT, I benefited greatly from advice and mentoring from Ryan Williams, Haynes Miller, and David Spivak.

Published Papers
  • The Geometry of Tree-Based Sorting. Guy E. Blelloch and Magdalen Dobson.
    To appear in the EATCS International Colloquium on Automata, Languages and Programming, ICALP 2023.
  • Poster: The Problem-Based Benchmark Suite, V2. Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Magdalen Dobson, and Yihan Sun.
    Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2022.
  • Multiagent Evaluation Mechanisms. Tal Alon, Magdalen Dobson, Ariel D. Procaccia, Inbal Talgam-Cohen, and Jamie Tucker-Folz.
    Proceedings of the AAAI Conference on Artificial Intelligence, AAAI 2020.
Plain Academic