20 citations · 31 across the 15 of their papers we have counts for
4 papers · 1 filter
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…
On Estimating Degree Distribution in Streaming and Query Models
Arijit Bishnu, Debarshi Chanda, Gopinath Mishra
Given a graph with vertices and edges, let denote its complementary cumulative degree histogram (CCDH), and let be the -index…
Curves, points, incidences and covering
Arijit Bishnu, Mathew Francis, Pritam Majumder
Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the cu…
Arboricity Matters in Triangle Counting with Random Edges
Arijit Bishnu, Debarshi Chanda, Gopinath Mishra
Given a simple, unweighted, undirected graph with and , and parameters , along with Degree, Neighbour, Pair and RandomEdge query acce…