Roksana Baleshzar was a graduate student at Penn State while this work was done. She received her M.Sc. in Computer Science from Penn State under the supervision of Sofya Raskhodnikova, and her Bachelor's degree in Information Technology Engineering from Sharif University of Technology. She currently works as a Software Engineer at Google, Inc.

Deeparnab Chakrabarty is a faculty member of the Department of Computer Science at Dartmouth. Prior to this, he spent five lovely years at Microsoft Research in Bangalore. Deeparnab received his Ph.D. from the Georgia Institute of Technology under the supervision of Vijay Vazirani. He had postdoctoral stints at the University of Waterloo and the University of Pennsylvania. He gets excited by the application of optimization techniques in the design of algorithms, and is constantly surprised by the breadth of their applicability. He loves teaching undergraduate algorithms at Dartmouth, and hopes that the class sizes remain small.

Ramesh Krishnan S. Pallavoor recently graduated with a Ph.D. from the Department of Computer Science at Boston University where he was advised by Sofya Raskhodnikova. Previously, he was a Ph.D. student at Penn State, advised by Sofya Raskhodnikova. Before that, he received his B.Tech. in Computer Engineering from the Indian Institute of Information Technology, Design and Manufacturing (IIITD&M), Kancheepuram. His research interests include sublinear algorithms (in particular, property testing), and differential privacy.

He grew up in Chennai, a coastal city of 7 million, in the southern part of India. His interest in math was partly spurred by his obsession with cricket statistics. During the initial part of his undergraduate studies, he was not too interested in the theory side of CS, and he thanks his teacher and mentor, Professor N. Sadagopan, for changing his outlook.

Sofya Raskhodnikova is a professor of Computer Science at Boston University. Previously, she was a Professor of Computer Science and Engineering at Penn State. She received her Ph.D. from MIT. Prior to joining Penn State, she was a postdoctoral fellow at the Hebrew University of Jerusalem and the Weizmann Institute of Science. She has held visiting positions at the Institute for Pure and Applied Mathematics at UCLA, Boston University, Harvard University and at the Simons Institute for the Theory of Computing at Berkeley. Sofya works in the areas of randomized and approximation algorithms. Her main interest is the design and analysis of sublinear-time algorithms for combinatorial problems. She has also made important contributions to data privacy. As far as her hobbies go, recall that she works on privacy.

C. Seshadhri (Sesh) is a faculty member of the Department of Computer Science and Engineering at the University of California, Santa Cruz. He received his Ph.D. from Princeton University under the supervision of Bernard Chazelle and did a postdoc at IBM Almaden. Prior to joining UCSC, he spent four years as a staff member at Sandia National Laboratories, Livermore. Sesh's research interests are periodically sampled from a distribution that includes sublinear algorithms, social network analysis, and mathematical foundations for massive data analysis.

Sesh got his B.Tech from the Computer Science and Engineering Department at the Indian Institute of Technology, Kanpur. He still remembers his first data structures course with Prof. Manindra Agrawal; in that course, he fell in love with TCS.

He used to have hobbies and was an all around interesting person, but that was before his kids were born.