Karthik Gajulapalli is an assistant professor in the Department of Computer Science at the University of Central Florida. He earned his Ph.D. in computer science from Georgetown University in 2026 and completed his undergraduate studies at the University of California, Irvine.

His research focuses on understanding the power and limitations of efficient computation. Broadly, he develops algorithmic techniques for proving computational lower bounds while also designing efficient algorithms and data structures. His work includes identifying the smallest complexity class that admits large polynomial circuit lower bounds, developing efficient data structures for orthogonal range searching, and designing the fastest deterministic algorithms for output-sparse matrix multiplication.