From the 1 of 4 linked papers with an AI index.
6 citations · 6 across the 1 of their papers we have counts for
4 papers
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…
Colorful two-piercing theorem for boxes
Sourav Chakraborty, Arijit Ghosh, Soumi Nandi
We prove a colorful extension of a Helly-type theorem by Danzer and Grünbaum (Combinatorica, 1982) concerning two-piercing families of axis-parallel boxes in . We al…
Instance Dependent Testing of Samplers using Interval Conditioning
Rishiraj Bhattacharyya, Sourav Chakraborty, Yash Pote +2
Sampling algorithms play a pivotal role in probabilistic AI. However, verifying if a sampler program indeed samples from the claimed distribution is a notoriously hard problem. Pro…
Certificate Games and Consequences for the Classical Adversary Bound
Sourav Chakraborty, Anna Gál, Mika Göös +3
We introduce and study Certificate Game complexity, a measure of complexity based on the probability of winning a game where two players are given inputs with different function va…