1 citations · 1 across the 1 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2026★ 1 cited
Improved Probabilistic Lower Bounds for Separable Matrices
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
This work focuses on non-adaptive combinatorial group testing, with a primary goal of efficiently identifying a set of at most defective elements among a given set of eleme…
cs.IT2025
Combinatorial Group Testing in Presence of Deletions
Venkata Gandikota, Nikita Polyanskii, Haodong Yang
The study in group testing aims to develop strategies to identify a small set of defective items among a large population using a few pooled tests. The established techniques have…