Our group focuses on research in sublinear algorithms, privacy and robustness, quantum algorithms, and graph algorithms. Our research is mainly in the style of theoretical computer science, studying problems from algorithms and computational complexity perspectives. We are also open to practical applications, especially at the intersection of theory with machine learning, data science, and network science.