3 citations · 8 across the 15 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2020
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond
Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh +2
The disjointness problem - where Alice and Bob are given two subsets of and they have to check if their sets intersect - is a central problem in the world of comm…
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…