60 citations · 151 across the 27 of their papers we have counts for
38 papers
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…
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…
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…
Codes Correcting a Single Long Duplication Error
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
We consider the problem of constructing a code capable of correcting a single long tandem duplication error of variable length. As the main contribution of this paper, we present a…
Signature Codes for a Noisy Adder Multiple Access Channel
Gökberk Erdoğan, Georg Maringer, Nikita Polyanskii
In this work, we consider -ary signature codes of length and size for a noisy adder multiple access channel. A signature code in this model has the property that any sub…
Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG
Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii +3
We introduce the theoretical foundations of the Tangle 2.0, a probabilistic leaderless consensus protocol based on a directed acyclic graph (DAG) called the Tangle. The Tangle natu…