Barna Saha

Q: What Schools Are Affiliated With Barna Saha

Barna Saha is affiliated with the following schools: University of Maryland, College Park, University of California, Berkeley, University of Massachusetts Amherst, University of California, San Diego, IIT Kanpur, Stanford University, Jadavpur University, University of Massachusetts

Barna Saha's AcademicInfluence.com Rankings

Barna Saha

Computer Science

#6611

World Rank

#6969

Historical Rank

Database

#9258

World Rank

#9745

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Barna Saha's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Barna Saha Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Barna Saha is an Indian-American theoretical computer scientist whose research interests include algorithmic applications of the probabilistic method, probabilistic databases, fine-grained complexity, and the analysis of big data. She is an associate professor and Jacobs Faculty Scholar in the Department of Computer Science & Engineering at the University of California, San Diego.

(See a Problem?)

Barna Saha's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On Finding Dense Subgraphs (2009) (264)
Data quality: The other face of Big Data (2014) (204)
A unified approach to ranking in probabilistic databases (2009) (197)
Less is More: Selecting Sources Wisely for Integration (2012) (165)
New Constructive Aspects of the Lovasz Local Lemma (2010) (157)
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs (2010) (105)
On Maximum Coverage in the Streaming Model & Application to Multi-topic Blog-Watch (2009) (103)
Online Entity Resolution Using an Oracle (2016) (101)
Clustering with Noisy Queries (2017) (72)
The matroid median problem (2011) (62)
Energy efficient scheduling via partial shutdown (2009) (61)
Link Prediction for Annotation Graphs Using Graph Summarization (2011) (50)
Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product (2016) (49)
Distributed data placement to minimize communication costs via graph partitioning (2014) (49)
Paper Matching with Local Fairness Constraints (2019) (46)
A new approximation technique for resource‐allocation problems (2010) (41)
Query Complexity of Clustering with Side Information (2017) (36)
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree (2006) (33)
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median (2013) (30)
Dynamic set cover: improved algorithms and lower bounds (2019) (28)
The Dyck Language Edit Distance Problem in Near-Linear Time (2014) (27)
Schema covering: a step towards enabling reuse in information integration (2010) (27)
Language Edit Distance and Maximum Likelihood Parsing of Stochastic Grammars: Faster Algorithms and Connection to Fundamental Graph Problems (2014) (25)
Sublinear Algorithms for Gap Edit Distance (2019) (23)
On Repairing Structural Problems In Semi-structured Data (2013) (23)
Size-Constrained Weighted Set Cover (2015) (23)
Set Cover Revisited: Hypergraph Cover with Hard Capacities (2012) (22)
A Theoretical Analysis of First Heuristics of Crowdsourced Entity Resolution (2017) (21)
Renting a Cloud (2013) (21)
Clustering Via Crowdsourcing (2016) (20)
The Geometric Block Model (2017) (19)
Does preprocessing help in fast sequence comparisons? (2020) (19)
Robust Entity Resolution using Random Graphs (2018) (18)
Min-Max Correlation Clustering via MultiCut (2019) (17)
On Capacitated Set Cover Problems (2011) (16)
Fast & Space-Efficient Approximations of Language Edit Distance and RNA Folding: An Amnesic Dynamic Programming Approach (2017) (15)
Simplifying Information Integration: Object-Based Flow-of-Mappings Framework for Integration (2008) (14)
Robust Entity Resolution Using a CrowdOracle (2018) (14)
On Estimating Path Aggregates over Streaming Graphs (2006) (13)
Efficient and effective ER with progressive blocking (2020) (13)
Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost (2019) (13)
Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance (2020) (12)
AdCell: Ad Allocation in Cellular Networks (2011) (12)
Connectivity in Random Annulus Graphs and the Geometric Block Model (2018) (10)
Discovering Conservation Rules (2012) (9)
Facility Location with Matroid or Knapsack Constraints (2015) (9)
On Chebyshev radius of a set in Hamming space and the closest string problem (2013) (8)
Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard! (2017) (8)
The Complexity of Average-Case Dynamic Subgraph Counting (2022) (7)
How to Design Robust Algorithms using Noisy Comparison Oracle (2021) (7)
Hierarchical graph partitioning (2014) (6)
Firewall placement in cloud data centers (2013) (6)
Distributed Data Placement via Graph Partitioning (2013) (6)
Approximation Algorithms for Resource Allocation (2011) (5)
An Upper Bound and Linear-Space Queries on the LZ-End Parsing (2022) (5)
TreeScope: Finding Structural Anomalies In Semi-Structured Data (2015) (4)
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal (2021) (4)
Fast Incremental Minimum-Cut Based Algorithm for Graph Clustering (2006) (4)
BEER: Blocking for Effective Entity Resolution (2021) (4)
Proximity Measure for Recommending Groups in Online Social Networks (2008) (4)
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding (2021) (4)
New Approximation Results for Resource Replication Problems (2012) (4)
Faster Language Edit Distance, Connection to All-pairs Shortest Paths and Related Problems (2014) (3)
How Compression and Approximation Affect Efficiency in String Distance Measures (2021) (3)
Fully Dynamic Set Cover - Improved and Simple (2018) (2)
Approximating LCS and Alignment Distance over Multiple Sequences (2021) (1)
Ju n 20 19 Min-Max Correlation Clustering via MultiCut ⋆ (2019) (1)
The Geometric Block Model and Applications (2018) (1)
Discovering Conservation Rules (2014) (1)
Efficiently Computing Edit Distance to Dyck Language (2013) (1)
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance (2022) (1)
Dynamic Set Cover: Improved Algorithms & Lower Bounds (2018) (1)
Fair Correlation Clustering (2020) (1)
Clustering with an oracle (2016) (1)
Approximation Algorithms for Large Scale Data Analysis (2021) (0)
Algorithms for Data Science : Lecture on Interactive Clustering (2018) (0)
Notes on MapReduce Algorithms (2016) (0)
New Approximation Results for Resource Replication Problems (2015) (0)
C C ] 2 O ct 2 01 9 Sublinear Algorithms for Gap Edit Distance ∗ (2019) (0)
Community Recovery in the Geometric Block Model (2022) (0)
Ranking and Clustering in Probabilistic Databases (2008) (0)
A pr 2 01 8 Fully Dynamic Set Cover – Improved & Simple (0)
$\tilde{O}(n+\mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance (2022) (0)
Project 2 : Pattern Matching in Compressed DNA Sequence (2008) (0)
BEER (2021) (0)
Language Edit Distance, (min,+)-Matrix Multiplication and Beyond (2017) (0)
Language Edit Distance Approximation via Amnesic Dynamic Programming (2016) (0)
Algorithms for Data Science : Lecture on Clustering (2016) (0)
Algorithms for Data Science : Lecture on Finding Similar Items (2016) (0)
Stochastic Matching CMSC 858 F : Algorithmic Game Theory Fall 2010 (2010) (0)
Algorithms for Data Science: Lecture on Dynamic Programming (2016) (0)
Crowd-Sourced Entity Resolution with Control Queries (2019) (0)
Weighted Edit Distance Computation: Strings, Trees and Dyck (2023) (0)
D ec 2 00 9 Energy Efficient Scheduling via Partial Shutdown (2021) (0)
81 : 2 Same-Cluster Queries Bounded by Optimal Cost Funding (2019) (0)
Sublinear Algorithms for Edit Distance (Invited Talk) (2021) (0)
Hierarchical Entity Resolution using an Oracle (2022) (0)
Matching with Local Fairness Constraints (2019) (0)
Competitive Algorithms for Ad Allocation in Cellular Networks ( AdCell ) ? (2014) (0)
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue (2018) (0)
Algorithms for Data Science: Lecture 5 (2016) (0)
An Algorithmic Bridge Between Hamming and Levenshtein Distances (2022) (0)

This paper list is powered by the following services:

Other Resources About Barna Saha

What Schools Are Affiliated With Barna Saha?

Barna Saha is affiliated with the following schools:

Barna Saha's Academic­Influence.com Rankings