20 citations · 31 across the 15 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
Hyperedge Estimation using Polylogarithmic Subset Queries
Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh +1
In this work, we estimate the number of hyperedges in a hypergraph , where denotes the set of vertices and ${\cal F}({\cal…
cs.CC2019
Efficiently Sampling and Estimating from Substructures using Linear Algebraic Queries
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra +1
Given an unknown matrix having non-negative entries, the \emph{inner product} (IP) oracle takes as inputs a specified row (or a column) of and a vector $v \in…
cs.CC2019
Structural Parameterization for Graph Deletion Problems over Data Streams
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay +2
The study of parameterized streaming complexity on graph problems was initiated by Fafianie et al. (MFCS'14) and Chitnis et al. (SODA'15 and SODA'16). Simply put, the main goal is…