A Framework for Adversarially Robust Streaming Algorithms
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, and Eylon Yogev
Omri Ben-Eliezer is a PhD student at Tel Aviv University, advised by Noga Alon. His research interests are in the algorithmic foundations of structured data analysis. His works develop efficient algorithms for data with complex structure by studying combinatorial characterizations of the data and how they can be myPicture.JPG exploited from a statistical perspective.
Rajesh Jayaram is a PhD student at Carnegie Mellon University, advised by David Woodruff. Previously, he received his B.S. in Mathematics and Computer Science from Brown University. His research focuses primarily on sublinear algorithms, especially sketching and streaming algorithms for problems in big-data. A large part of his work has been devoted to designing efficient randomized algorithms for problems with database applications, such as his work on the first polynomial time algorithm for approximate counting and sampling from regular languages, which received the PODS Best Paper Award in 2019.
David Woodruff works on data science topics such as data streams, machine learning, randomized linear algebra, sketching and sparse recovery. He has been an associate professor in the computer science department at Carnegie Mellon University since 2017. Prior to that he was a research scientist at IBM Almaden Research Center for ten years, which he joined after completing his Ph.D. in theoretical computer science at the Massachusetts Institute of Technology. He is the recipient of the 2020 Simons Investigator Award and the 2014 Presburger Award, and previously received Best Paper Awards at STOC 2013 and PODS 2010. At IBM he was a member of the Academy of Technology, a Master Inventor, and received multiple Pat Goldberg Awards.
Eylon Yogev is a postdoc affiliated with both Boston University and Tel-Aviv University. He has received his Ph.D. from the Weizmann institute supervised by Prof. Moni Naor. His research interests are in general cryptography and, in particular, in its various relationships with other areas in theoretical computer science. The most prominent examples include complexity, data structures, streaming algorithms, distributed algorithms, and search problems.