N. V. Vinodchandran

works on

dnf model counting 1 klee's measure problem 1 set coverage 1 streaming algorithms 1 union size estimation 1

From the 1 of 3 linked papers with an AI index.

most citedEstimating Size of the Union of Sets in Streaming Model

6 citations · 6 across the 1 of their papers we have counts for

collaborators

3 papers

cs.DS2026★ 6 cited

Estimating Size of the Union of Sets in Streaming Model

Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty

The paper presents a simple sampling-based streaming algorithm that approximates the size of the union of implicitly given sets, achieving provable space and update‑time bounds and…

cs.DS2025

Fast Rational Search via Stern-Brocot Tree

Connor Weyers, N. V. Vinodchandran

We revisit the problem of rational search: given an unknown rational number $I^\pm = \frac{a}{b} \in (0, 1)$ with $b \leq n$ , the goal is to identify $I^\pm$ using comparison queries of th…

cs.LG2025

Distribution Learning Meets Graph Structure Sampling

Arnab Bhattacharyya, Sutanu Gayen, Philips George John +2

This work establishes a novel link between the problem of PAC-learning high-dimensional graphical models and the task of (efficient) counting and sampling of graph structures, usin…