Researcher

Barna Saha

Barna Saha is a theoretical computer scientist whose algorithm work now reaches AI, including a 2024 study of the I/O complexity of attention and a 2026 proof initially discovered by ChatGPT 5.5 Pro. A University of Maryland doctorate in 2011 led to posts at UMass Amherst from 2014 and at UC Berkeley, before UC San Diego in 2022. The Presidential Early Career Award for Scientists and Engineers came in 2019, and the National Academy of Sciences made Saha a Kavli Fellow in 2020. In 2024 an endowed chair in the CSE department honored Saha, and Saha directs EnCORE, an NSF TRIPODS institute. Saha is currently a professor at UC San Diego.

Timeline

  1. 2011

    A Maryland doctorate

    The doctorate at the University of Maryland, College Park, is completed in 2011 under Samir Khuller.

  2. 2014–2019

    Faculty at UMass Amherst

    In 2014 the College of Information and Computer Science at UMass Amherst adds Saha to its faculty. The UMass post runs for five years, first as an assistant professor and then as an associate professor.

  3. 2019–2020

    PECASE and a Kavli Fellow

    The Presidential Early Career Award for Scientists and Engineers (PECASE) goes to Saha in 2019. In 2020 the National Academy of Sciences names Saha a Kavli Fellow.

  4. 2022

    Joining UC San Diego

    Saha joins the computer science faculty at UC San Diego in January 2022 as a theoretical computer scientist and mathematician. Before that, Saha held a tenured associate professorship at UC Berkeley.

  5. 2024

    The Gruber chair and EnCORE

    In 2024 the CSE department celebrates Saha as the Harry E. Gruber Endowed Chair. Saha also directs EnCORE, the NSF TRIPODS institute for emerging CORE methods in data science.

  6. 2024

    I/O complexity of attention

    In 2024 Saha and Christopher Ye give an ICML oral presentation on the I/O complexity of attention, a format with a 1.5% acceptance rate. Self-attention is at the heart of the Transformer architecture, and the paper examines its I/O complexity.

  7. June 2026

    A proof discovered by ChatGPT

    In June 2026 Saha, Yinzhan Xu, and Christopher Ye submit a preprint titled "Furthest Pair Requires Quadratic Time in Superconstant Dimension under SETH." Its proof was initially discovered by ChatGPT 5.5 Pro, and the authors validated and substantially edited it.

  8. As of October 2026

    Professor at UC San Diego

    Saha is the Harry E. Gruber Endowed Chair Professor of Computer Science and Information Technologies at UC San Diego, and directs EnCORE.

Sources and credits

Photo: We have no published photo of Barna Saha yet. Send us a free-licensed photo.

  1. Barna Saha - Wikipedia en.wikipedia.org. Checked 14 October 2026.
  2. Barna Saha and the Golden Road to UC San Diego | Computer Science cse.ucsd.edu. Checked 14 October 2026.
  3. Barna Saha barnasaha.net. Checked 14 October 2026.
  4. Barna Saha | Jacobs School of Engineering jacobsschool.ucsd.edu. Checked 14 October 2026.
  5. Barna Saha Celebrated as Harry E. Gruber Endowed Chair at UC San Diego | Computer Science cse.ucsd.edu. Checked 14 October 2026.
  6. [2402.07443] The I/O Complexity of Attention, or How Optimal is Flash Attention? arxiv.org. Checked 14 October 2026.
  7. [2606.25887] Furthest Pair Requires Quadratic Time in Superconstant Dimension under SETH arxiv.org. Checked 14 October 2026.
  8. Furthest Pair Requires Quadratic Time in Superconstant Dimension under SETH arxiv.org. Checked 14 October 2026.
  9. [2606.25887v1] Furthest Pair Requires Quadratic Time in Superconstant Dimension under SETH arxiv.org. Checked 14 October 2026.