Barna Saha

Barna Saha

University of California, Berkeley

H-index: 30

North America-United States

About Barna Saha

Barna Saha, With an exceptional h-index of 30 and a recent h-index of 22 (since 2020), a distinguished researcher at University of California, Berkeley, specializes in the field of Algorithms, Probabilistic Methods, Data Management.

His recent articles reflect a diverse array of research interests and contributions to the field:

The I/O Complexity of Attention, or How Optimal is Flash Attention?

Faster Approximate All Pairs Shortest Paths

Approximating edit distance in the fully dynamic model

On the complexity of algorithms with predictions for dynamic graph problems

Weighted edit distance computation: Strings, trees, and Dyck

Leibniz International Proceedings in Informatics (LIPIcs): 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)

Community recovery in the geometric block model

An upper bound and linear-space queries on the LZ-End parsing

Barna Saha Information

University

Position

___

Citations(all)

3301

Citations(since 2020)

1697

Cited By

2339

hIndex(all)

30

hIndex(since 2020)

22

i10Index(all)

62

i10Index(since 2020)

48

Email

University Profile Page

University of California, Berkeley

Google Scholar

View Google Scholar Profile

Barna Saha Skills & Research Interests

Algorithms

Probabilistic Methods

Data Management

Top articles of Barna Saha

Title

Journal

Author(s)

Publication Date

The I/O Complexity of Attention, or How Optimal is Flash Attention?

arXiv preprint arXiv:2402.07443

Barna Saha

Christopher Ye

2024/2/12

Faster Approximate All Pairs Shortest Paths

Barna Saha

Christopher Ye

2024

Approximating edit distance in the fully dynamic model

Tomasz Kociumaka

Anish Mukherjee

Barna Saha

2023/11/6

On the complexity of algorithms with predictions for dynamic graph problems

arXiv preprint arXiv:2307.16771

Monika Henzinger

Andrea Lincoln

Barna Saha

Martin P Seybold

Christopher Ye

2023/7/31

Weighted edit distance computation: Strings, trees, and Dyck

Debarati Das

Jacob Gilbert

MohammadTaghi Hajiaghayi

Tomasz Kociumaka

Barna Saha

2023/6/2

Leibniz International Proceedings in Informatics (LIPIcs): 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)

European Conference on Object-Oriented Programming

Feiyang Jin

Lechen Yu

Tiago Cogumbreiro

Jun Shirako

Vivek Sarkar

2023/1

Community recovery in the geometric block model

Journal of Machine Learning Research

Sainyam Galhotra

Arya Mazumdar

Soumyabrata Pal

Barna Saha

2023

An upper bound and linear-space queries on the LZ-End parsing

Dominik Kempa

Barna Saha

2022

An algorithmic bridge between Hamming and Levenshtein distances

arXiv preprint arXiv:2211.12496

Elazar Goldenberg

Tomasz Kociumaka

Robert Krauthgamer

Barna Saha

2022/11/22

How compression and approximation affect efficiency in string distance measures

Arun Ganesh

Tomasz Kociumaka

Andrea Lincoln

Barna Saha

2022

O (n+ poly (k))-time algorithm for bounded tree edit distance

Debarati Das

Jacob Gilbert

MohammadTaghi Hajiaghayi

Tomasz Kociumaka

Barna Saha

...

2022/10/31

The complexity of average-case dynamic subgraph counting

Monika Henzinger

Andrea Lincoln

Barna Saha

2022

Gap edit distance via non-adaptive queries: Simple and optimal

Elazar Goldenberg

Tomasz Kociumaka

Robert Krauthgamer

Barna Saha

2022/10/31

-time Algorithm for Bounded Tree Edit Distance

arXiv preprint arXiv:2209.07524

Debarati Das

Jacob Gilbert

MohammadTaghi Hajiaghayi

Tomasz Kociumaka

Barna Saha

...

2022/9/15

Hierarchical entity resolution using an oracle

Sainyam Galhotra

Donatella Firmani

Barna Saha

Divesh Srivastava

2022/6/10

Efficient and effective ER with progressive blocking

The VLDB Journal

Sainyam Galhotra

Donatella Firmani

Barna Saha

Divesh Srivastava

2021/7

Approximation Algorithms for Large Scale Data Analysis

Barna Saha

2021/6/20

BEER: Blocking for effective entity resolution

Sainyam Galhotra

Donatella Firmani

Barna Saha

Divesh Srivastava

2021/6/9

Improved approximation algorithms for Dyck edit distance and RNA folding

arXiv preprint arXiv:2112.05866

Debarati Das

Tomasz Kociumaka

Barna Saha

2021/12/10

How to design robust algorithms using noisy comparison oracle

Raghavendra Addanki

Sainyam Galhotra

Barna Saha

2021

See List of Professors in Barna Saha University(University of California, Berkeley)

Co-Authors

H-index: 73
Lise Getoor

Lise Getoor

University of California, Santa Cruz

H-index: 73
MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi

University of Maryland

H-index: 66
Aravind Srinivasan

Aravind Srinivasan

University of Maryland, Baltimore

H-index: 56
samir khuller

samir khuller

North Western University

academic-engine