- Complexity Theory
- Distributed Computing
Xin Li, an assistant professor in the Department of Computer Science, is known for his research in theoretical computer science, including pseudorandomness, complexity theory, distributed computing, and cryptography.
Li’s work focuses on the use of randomness in computation, complexity theory, coding theory, and cryptography. His research has led to a number of breakthroughs in the field of theoretical computer science. For example, his studies on the explicit constructions of randomness extractors has resulted in an almost optimal solution to the long-standing open problem of constructing explicit two source extractors. His discoveries have contributed to the development of tamper-resilient cryptography and error correcting codes, as well as the creation of more efficient computing methods using limited
resources. He is a member of the Theory & Programming Languages research group at Johns Hopkins.
The National Science Foundation (NSF) has funded the bulk of Li’s research. He is the recipient of a Simons Postdoctoral Fellowship, Lucent Global Science Scholarship, and a 2017 Johns Hopkins Catalyst Award. He also received a 2019 NSF CAREER award, which recognizes early stage scholars with high levels of excellence and promise. That award is supporting a project exploring pseudorandom objects and their applications in computer science. Li has authored more than 30 combined journal and conference publications.
Li earned his BS and MS degrees in Computer Science from Tsinghua University in Beijing in 2002 and 2005, respectively. He received his PhD from the University of Texas at Austin in 2011. Prior to joining Johns Hopkins in 2013, he spent two years as a Simons Postdoctoral Fellow at University of Washington in Seattle and interned at Microsoft Research New England.