Abstract
In this short talk, I'll discuss my research on practical graph algorithms including scalable algorithms for problems that scale to hundreds of billions of edges and differentially private algorithms that allow for stronger guarantees for users beyond scalability. I'll briefly outline some specific aspects of data structures that make them more conducive to being practically efficient on real-world datasets.