April 18: Sublinear Day


The first Sublinear Algorithms and Big Data Day or, in short, "The Sublinear Day" will take place at Brown ICERM on Friday, April 18. Further details are below.

This event will bring together researchers from academic institutions in New England for a day of interaction and discussion. The Sublinear Day will feature four hour-long + two 30-minute presentations by leading experts in the areas of sublinear and streaming algorithms.




  • Ronitt Rubinfeld

    Ronitt Rubinfeld received her PhD at the University of California, Berkeley, and is currently on the faculties at MIT and Tel Aviv University. Her research focuses on sub-linear time algorithms for big data sets.

  • Michael Kapralov

    Michael Kapralov is a postdoc in the Theory of Computation Group at MIT. His research interests are in classical combinatorial optimization problems as well as problems motivated by modern data models, such as streaming, sketching and online algorithms. More recent interests include sparse recovery and Fourier sampling. Michael obtained his Ph.D. from Stanford University in 2012.

  • Huy Le Nguyen

    Huy Le Nguyen is a graduate student in the Computer Science Department at Princeton University, advised by Professor Moses Charikar. Before attending Princeton, he received his Bachelor's degrees in Computer Science and Mathematics, and Master of Engineering in Computer Science, all from MIT. His research has focused on algorithms for large datasets, including dimensionality reduction methods, approximate nearest neighbor search, and fast numerical linear algebra algorithms. He is also interested in other areas of theoretical computer science, and has worked on online algorithms, natural algorithms, and data structure lower bounds.

  • Sofya Raskhodnikova

    Sofya Raskhodnikova is an associate professor of Computer Science and Engineering at the Pennsylvania State University. She is currently on sabbatical, visiting Boston University and Harvard University. Sofya works on design and analysis of sublinear-time algorithms for combinatorial problems and on privacy-preserving methods for publishing aggregate statistical data. Sofya got her PhD from MIT in 2003. From the fall of 2003 to 2006, she worked at the Hebrew University of Jerusalem, the Weizmann Institute of Science and the Institute for Pure and Applied Mathematics at UCLA.

  • Andrew McGregor

    Andrew McGregor is an Assistant Professor at the University of Massachusetts, Amherst. He received a B.A. degree and the Certificate of Advance Study in Mathematics from the University of Cambridge and a Ph.D. from the University of Pennsylvania. He also spent a couple of years as a post-doc at UC San Diego and Microsoft Research SVC. He is interested in many areas of theoretical computer science and specializes in data stream algorithms, linear sketching, and communication complexity. He received the NSF Career Award in 2010.

  • Amit Chakrabarti

    Amit Chakrabarti is an Associate Professor in the Department of Computer Science at Dartmouth College. He received an M.A. and a Ph.D. in Computer Science from Princeton University in 2002 and a B.Tech. in Computer Science from the Indian Institute of Technology, Bombay, along with the President of India Gold Medal, in 1997. Professor Chakrabarti's research is in the broad area of theoretical computer science. Specific interests are (1) complexity theory, especially communication complexity and the application of information theory, and (2) algorithms, including space-efficient algorithms for massive data streams and approximation techniques for optimization problems.

Organizers and Support


Program + Homepage: Grigory Yaroslavtsev
Local arrangements: Lauren Warmington
Coordinator: Nicole Henrichs
Technical support: Isani Cayetano

Supported by: