Will Rosenbaum
Scholar

Will Rosenbaum

Google Scholar ID: vMmb4p0AAAAJ
University of Liverpool
Distributed ComputingComputational ComplexityGame TheoryDiscrete Math
Citations & Impact
All-time
Citations
329
 
H-index
9
 
i10-index
9
 
Publications
20
 
Co-authors
19
list available
Contact
Resume (English only)
Academic Achievements
  • No specific academic achievements listed.
Research Experience
  • Currently a lecturer (assistant professor) in Computer Science at the University of Liverpool. Formerly an assistant professor of Computer Science at Amherst College. Postdoctoral positions in the Algorithms and Complexity group at Max Planck Institute for Informatics, hosted by Christoph Lenzen, and in the School of Electrical Engineering at Tel Aviv University, hosted by Boaz Patt-Shamir.
Education
  • PhD: Mathematics Department at UCLA, supervised by Rafail Ostrovsky; Undergraduate: Reed College.
Background
  • Main research interests are in theoretical computer science, particularly distributed computing, the design and analysis of efficient algorithms, and computational complexity.
Miscellany
  • Personal interests include cooking, playing piano, hiking, photography, snowboarding, and brewing beer. Currently lives in Liverpool with his wife Alivia, their daughter, dog Finnegan, and two cats, Pip and Posy.