Arboricity Matters in Triangle Counting with Random Edges

Arijit Bishnu, Debarshi Chanda, and Gopinath Mishra. 

RANDOM 2026 (ArXiv)

From Decision to Random Certificates: Exponential Separation for Edge Estimation with Independent Set Queries

Debarshi Chanda, Buddha Dev Das, Arijit Ghosh, and Gopinath Mishra. 

RANDOM 2026 (ArXiv)

Sublinear Algorithms for Estimating Wasserstein and TV Distances: Applications to Fairness and Privacy Auditing

Debabrota Basu, Debarshi Chanda.

TMLR 2026 (ArXiv)

Counting Triangles in Graph Streams with Repeatable and Forgettable Edges

Sourav Chakraborty, Debarshi Chanda, Arijit Ghosh, A. Pavan, Chhaya Trehan, N. V. Vinodchandran.  (ArXiv )

Computing over Data Streams using Catalytic Space

Ripley Becker, Sourav Chakraborty, Debarshi Chanda, A. Pavan, N. V. Vinodchandran.  (ArXiv )

Optimal non-adaptive algorithm for edge estimation

Arijit Bishnu, Debarshi Chanda, Buddha Dev Das, Arijit Ghosh, and Gopinath Mishra.  (ArXiv )

Improved Bounds with a Simple Algorithm for Edge Estimation for Graphs of Unknown Size

Debarshi Chanda (ArXiv )

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models

Arijit Bishnu, Debarshi Chanda, and Gopinath Mishra.  (ArXiv )

Dimension Agnostic Testing of Survey Data Credibility through the Lens of Regression

Debabrota Basu, Sourav Chakraborty, Debarshi Chanda, Buddha Dev Das, Arijit Ghosh, Arnab Ray  (ArXiv )

A preliminary version of this work was presented at (PPAI-25)