3 papers
cs.IT2026
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.CR2025
Fairness Notions in DAG-based DLTs
Mayank Raikwar, Nikita Polyanskii, Sebastian Müller
This paper investigates the issue of fairness in Distributed Ledger Technology (DLT), specifically focusing on the shortcomings observed in current blockchain systems due to Miner…
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…