Gopinath Mishra

activity

20162026

most citedOn the streaming complexity of fundamental geometric problems

3 citations · 8 across the 15 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.DS2025

Optimal non-adaptive algorithm for edge estimation

Arijit Bishnu, Debarshi Chanda, Buddha Dev Das +2

We present a simple nonadaptive randomized algorithm that estimates the number of edges in a simple, unweighted, undirected graph, possibly containing isolated vertices, using only…

cs.DS2025

On Estimating Degree Distribution in Streaming and Query Models

Arijit Bishnu, Debarshi Chanda, Gopinath Mishra

Given a graph $G = (V, E)$ with $n$ vertices and $m$ edges, let $C (d) = ∣ {v \in V : ° (v) \geq d} ∣$ denote its complementary cumulative degree histogram (CCDH), and let $h$ be the $h$ -index…