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.

• K. Gajulapalli, S. Ghentiyala, Z. Li, S. Saraogi. Downward Self-Reducibility in the Total-Function Polynomial Hierarchy (SODA 2026)


• K. Gajulapalli, A. Golovnev, S. King, S. Saraogi. Online Orthogonal Vectors Revisited (SODA 2026)


• H. Bennett, K. Gajulapalli, A. Golovnev, E. Wharton. Output-Sparse Matrix Multiplication Using Compressed Sensing (RANDOM 2026)


• K. Gajulapalli, Z. Li, I. Volkovich. Oblivious Classes Revisited: Lower Bounds and Hierarchies (FSTTCS 2024)


• K. Gajulapalli, A. Golovnev, S. Nagargoje, S. Saraogi. Range Avoidance for Constant Depth Circuits: Hardness and Algorithms (RANDOM 2023)