Thesis Information
Title: Sketching Distances in Graphs
Adviser: Virginia Vassilevska Williams
Institution: MIT
Graduation Date: June 2018
Contact Information
Email Candidate
Candidate Website
Candidate Bio:
"Hi! I’m Greg Bodwin, a researcher in theoretical computer science. I finished my PhD in 2018, split between MIT and Stanford, advised in both places by Virginia Vassilesvska Williams. Currently, I’m a postdoc at Georgia Tech with Santosh Vempala.
I’m seeking a job that will let me continue my ongoing research program, either through a tenure-track assistant professorship or with a research-focused industry position. In the past I’ve been lucky to work seriously with both mathematicians and computer scientists, and I am fully comfortable with either flavor of research and either type of job."
Paper 1:
"The 4/3 additive spanner exponent is tight," Greg Bodwin and Amir Abboud, Journal of the ACM (JACM), 2017.
Link to PDFPaper 3:
"A hierarchy of lower bounds for sublinear additive spanners," Amir Abboud, Greg Bodwin, and Seth Pettie, Siam J. Computing (SICOMP), 2017
Link to PDFKeywords: Graph Theory, Combinatorics, Graph Sketching, Shortest Paths, Graph Algorithms