5 citations · 8 across the 4 of their papers we have counts for
4 papers
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis +2
We consider the numerical taxonomy problem of fitting a positive distance function by a tree metric. We want a tree with positive e…
No Repetition: Fast Streaming with Highly Concentrated Hashing
Anders Aamand, Debarati Das, Evangelos Kipouridis +3
To get estimators that work within a certain error bound with high probability, a common strategy is to design one that works with constant probability, and then boost the probabil…
Approximate Online Pattern Matching in Sub-linear Time
Diptarka Chakraborty, Debarati Das, Michal Koucky
We consider the approximate pattern matching problem under edit distance. In this problem we are given a pattern of length and a text of length over some alphabet $…
Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path
Diptarka Chakraborty, Debarati Das
In this paper we address the problem of computing a sparse subgraph of a weighted directed graph such that the exact distances from a designated source vertex to all other vertices…