default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikita Polyanskii
Nikita Polianskii – N. A. Polyanskii
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j22]Daniil Goshkoder
, Nikita Polyanskii, Ilya Vorobyev:
Codes Correcting Long Duplication Errors. IEEE Trans. Mol. Biol. Multi Scale Commun. 10(2): 272-288 (2024)- [j21]Yonatan Yehezkeally, Nikita Polyanskii:
On Codes for the Noisy Substring Channel. IEEE Trans. Mol. Biol. Multi Scale Commun. 10(2): 368-381 (2024) - [c33]Mayank Raikwar, Nikita Polyanskii, Sebastian Müller:
SoK: DAG-based Consensus Protocols. ICBC 2024: 1-18 - [c32]Nikita Polyanskii:
Dynamically available consensus on a DAG with fast confirmation for UTXO transactions. ICBC 2024: 684-686 - [i41]Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev:
Efficient Combinatorial Group Testing: Bridging the Gap between Union-Free and Disjunctive Codes. CoRR abs/2401.16540 (2024) - [i40]Grigorii Melnikov, Sebastian Müller, Nikita Polyanskii, Yury Yanovich:
Deterministic Bounds in Committee Selection: Enhancing Decentralization and Scalability in Distributed Ledgers. CoRR abs/2409.10727 (2024) - [i39]Nikita Polyanskii, Sebastian Müller, Mayank Raikwar:
Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions. CoRR abs/2410.14876 (2024) - 2023
- [j20]Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog:
Reality-based UTXO Ledger. Distributed Ledger Technol. Res. Pract. 2(3): 1-33 (2023) - [j19]Nikita Polyanskii, Yihan Zhang:
Codes for the Z-Channel. IEEE Trans. Inf. Theory 69(10): 6340-6357 (2023) - [c31]Can Umut Ileri, Nikita Polyanskii:
Dynamic Availability and Definite Finality in IOTA 2.0. BlockSys 2023: 1 - [c30]Mayank Raikwar, Nikita Polyanskii, Sebastian Müller:
Fairness Notions in DAG-Based DLTs. BRAINS 2023: 1-8 - [c29]Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev:
Codes Correcting a Single Long Duplication Error. ISIT 2023: 2708-2713 - [i38]Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev:
Codes Correcting a Single Long Duplication Error. CoRR abs/2304.12399 (2023) - [i37]Mayank Raikwar, Nikita Polyanskii, Sebastian Müller:
Fairness Notions in DAG-based DLTs. CoRR abs/2308.04831 (2023) - [i36]Venkata Gandikota, Nikita Polyanskii, Haodong Yang:
Combinatorial Group Testing in Presence of Deletions. CoRR abs/2310.09613 (2023) - 2022
- [j18]Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog:
Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG. IEEE Access 10: 105807-105842 (2022) - [j17]Alexey V. Lebedev, Vladimir S. Lebedev, Nikita Polyanskii:
Two-Stage Coding Over the Z-Channel. IEEE Trans. Inf. Theory 68(4): 2290-2299 (2022) - [j16]Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii:
Coding With Noiseless Feedback Over the Z-Channel. IEEE Trans. Inf. Theory 68(6): 3731-3739 (2022) - [j15]Wentu Song, Nikita Polyanskii, Kui Cai, Xuan He:
Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors. IEEE Trans. Inf. Theory 68(10): 6402-6416 (2022) - [c28]Nikita Polyanskii, Yihan Zhang:
List-Decodable Zero-Rate Codes for the Z-Channel. ISIT 2022: 2553-2558 - [c27]Gökberk Erdogan, Georg Maringer, Nikita Polyanskii:
Signature Codes for a Noisy Adder Multiple Access Channel. ITW 2022: 476-481 - [i35]Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog:
Reality-based UTXO Ledger. CoRR abs/2205.01345 (2022) - [i34]Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog:
Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG. CoRR abs/2205.02177 (2022) - [i33]Gökberk Erdogan, Georg Maringer, Nikita Polyanskii:
Signature Codes for a Noisy Adder Multiple Access Channel. CoRR abs/2206.10735 (2022) - 2021
- [j14]Hedongliang Liu, Nikita Polianskii, Ilya Vorobyev, Antonia Wachter-Zeh:
Almost affinely disjoint subspaces. Finite Fields Their Appl. 75: 101879 (2021) - [j13]Vladimir S. Lebedev, N. A. Polyanskii:
Coding in a Z-Channel in Case of Many Errors. Probl. Inf. Transm. 57(2): 129-135 (2021) - [j12]Georg Maringer, N. A. Polyanskii, Ilya V. Vorobyev, Lorenz Welter:
Feedback Insertion-Deletion Codes. Probl. Inf. Transm. 57(3): 212-240 (2021) - [j11]N. A. Polyanskii:
On List Decoding of Certain 픽q-Linear Codes. Probl. Inf. Transm. 57(4): 341-356 (2021) - [j10]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi:
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes. IEEE Trans. Inf. Theory 67(12): 8051-8069 (2021) - [c26]Nikita Polyanskii:
Two-Stage Coding over the Z-Channel. ISIT 2021: 934-939 - [c25]Yonatan Yehezkeally, Nikita Polyanskii:
On Codes for the Noisy Substring Channel. ISIT 2021: 1700-1705 - [c24]Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev:
Optimal Codes Correcting Localized Deletions. ISIT 2021: 1991-1996 - [c23]Wentu Song, Nikita Polyanskii, Kui Cai, Xuan He:
On Multiple-Deletion Multiple-Substitution Correcting Codes. ISIT 2021: 2655-2660 - [c22]Nikita Polyanskii:
On learning sparse vectors from mixture of responses. NeurIPS 2021: 19876-19887 - [i32]Yonatan Yehezkeally, Nikita Polyanskii:
On Codes for the Noisy Substring Channel. CoRR abs/2102.01412 (2021) - [i31]Nikita Polyanskii, Yihan Zhang:
Codes for the Z-channel. CoRR abs/2105.01427 (2021) - [i30]Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev:
Optimal Codes Correcting Localized Deletions. CoRR abs/2105.02298 (2021) - [i29]Hedongliang Liu, Lukas Holzbaur, Nikita Polyanskii, Sven Puchinger, Antonia Wachter-Zeh:
Quadratic-Curve-Lifted Reed-Solomon Codes. CoRR abs/2109.14478 (2021) - [i28]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi:
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes. CoRR abs/2110.02008 (2021) - 2020
- [j9]Rina Polyanskaya, Mars Davletshin, Nikita Polyanskii:
Weight Distributions for Successive Cancellation Decoding of Polar Codes. IEEE Trans. Commun. 68(12): 7328-7336 (2020) - [j8]Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev:
Binary Batch Codes With Improved Redundancy. IEEE Trans. Inf. Theory 66(12): 7360-7370 (2020) - [c21]Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii:
Coding with Noiseless Feedback over the Z-Channel. COCOON 2020: 98-109 - [c20]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev:
Lifted Reed-Solomon Codes with Application to Batch Codes. ISIT 2020: 634-639 - [c19]Andreas Lenz, Nikita Polyanskii:
Optimal Codes Correcting a Burst of Deletions of Variable Length. ISIT 2020: 757-762 - [c18]Nikita Polyanskii, Ilya Vorobyev:
Duplication with transposition distance to the root for q-ary strings. ISIT 2020: 2903-2908 - [c17]Lukas Holzbaur, Nikita Polyanskii:
Decoding of Lifted Affine-Invariant Codes. ITW 2020: 1-5 - [c16]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi:
On Lifted Multiplicity Codes. ITW 2020: 1-5 - [c15]Georg Maringer, Nikita Polyanskii, Ilya Vorobyev, Lorenz Welter:
Feedback Insertion-Deletion Codes. ITW 2020: 1-5 - [i27]Nikita Polyanskii, Ilya Vorobyev:
Duplication with transposition distance to the root for $q$-ary strings. CoRR abs/2001.06242 (2020) - [i26]Andreas Lenz, Nikita Polyanskii:
Optimal Codes Correcting a Burst of Deletions of Variable Length. CoRR abs/2001.06641 (2020) - [i25]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev:
Lifted Reed-Solomon Codes with Application to Batch Codes. CoRR abs/2001.11981 (2020) - [i24]Hedongliang Liu, Nikita Polyanskii, Ilya Vorobyev, Antonia Wachter-Zeh:
Almost Affinely Disjoint Subspaces. CoRR abs/2007.01792 (2020) - [i23]Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii:
Coding with Noiseless Feedback over the Z-channel. CoRR abs/2007.04026 (2020) - [i22]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi:
Lifted Multiplicity Codes. CoRR abs/2008.04717 (2020) - [i21]Lukas Holzbaur, Nikita Polyanskii:
Decoding of Lifted Affine-Invariant Codes. CoRR abs/2010.10433 (2020) - [i20]Georg Maringer, Nikita Polyanskii, Ilya Vorobyev, Lorenz Welter:
Feedback Insertion-Deletion Codes. CoRR abs/2010.15928 (2020) - [i19]Alexey V. Lebedev, Vladimir S. Lebedev, Nikita Polyanskii:
Two-stage coding over the Z-channel. CoRR abs/2010.16362 (2020)
2010 – 2019
- 2019
- [j7]Zilin Jiang, Nikita Polyanskii:
On the metric dimension of Cartesian powers of a graph. J. Comb. Theory A 165: 1-14 (2019) - [j6]Zilin Jiang, Nikita Polyanskii, Ilya Vorobyev:
On Capacities of the Two-User Union Channel With Complete Feedback. IEEE Trans. Inf. Theory 65(5): 2774-2781 (2019) - [j5]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Separable Codes for the Symmetric Multiple-Access Channel. IEEE Trans. Inf. Theory 65(6): 3738-3750 (2019) - [j4]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Hypothesis Test for Bounds on the Size of Random Defective Set. IEEE Trans. Signal Process. 67(22): 5775-5784 (2019) - [c14]Nikita Polyanskii, Ilya Vorobyev:
Constructions of Batch Codes via Finite Geometry. ISIT 2019: 360-364 - [c13]Nikita Polyanskii, Ilya Vorobyev:
Trivariate Lifted Codes with Disjoint Repair Groups. REDUNDANCY 2019: 64-68 - [c12]Rina Polyanskaya, Nikita Polyanskii:
Batch codes based on lifted multiplicity codes. REDUNDANCY 2019: 69-74 - [c11]Zilin Jiang, Nikita Polyanskii:
How to guess an n-digit number. SODA 2019: 1215-1220 - [i18]Nikita Polyanskii, Ilya Vorobyev:
Constructions of Batch Codes via Finite Geometry. CoRR abs/1901.06741 (2019) - [i17]Rina Polyanskaya, Mars Davletshin, Nikita Polyanskii:
Weight Distributions for Successive Cancellation Decoding of Polar Codes. CoRR abs/1908.06652 (2019) - 2018
- [c10]Ilya Vorobyev, Nikita Polyanskii, German Svistunov, Sergey Egorov, Vasiliy Usatyuk:
Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications. EWDTS 2018: 1-6 - [c9]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Separable Codes for the Symmetric Multiple-Access Channel. ISIT 2018: 291-295 - [i16]Zilin Jiang, Nikita Polyanskii, Ilya Vorobyev:
On capacities of the two-user union channel with complete feedback. CoRR abs/1804.08599 (2018) - 2017
- [j3]Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Cover-free codes and separating system codes. Des. Codes Cryptogr. 82(1-2): 197-209 (2017) - [j2]Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Symmetric disjunctive list-decoding codes. Des. Codes Cryptogr. 82(1-2): 211-229 (2017) - [j1]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Almost cover-free codes and designs. Des. Codes Cryptogr. 82(1-2): 231-247 (2017) - [c8]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Hypothesis test for upper bound on the size of random defective set. ISIT 2017: 978-982 - [i15]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Bounds for Signature Codes. CoRR abs/1701.06085 (2017) - [i14]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Hypothesis Test for Upper Bound on the Size of Random Defective Set. CoRR abs/1701.06201 (2017) - [i13]Nikita Polyanskii, Vasiliy Usatyuk, Ilya Vorobyev:
Floor Scale Modulo Lifting for QC-LDPC codes. CoRR abs/1701.07521 (2017) - [i12]Zilin Jiang, Nikita Polyanskii:
On the metric dimension of Cartesian powers of a graph. CoRR abs/1712.02723 (2017) - 2016
- [c7]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On multistage learning a hidden hypergraph. ISIT 2016: 1178-1182 - [c6]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On a hypergraph approach to multistage group testing problems. ISIT 2016: 1183-1191 - [i11]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On a Hypergraph Approach to Multistage Group Testing Problems. CoRR abs/1601.06704 (2016) - [i10]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On Multistage Learning a Hidden Hypergraph. CoRR abs/1601.06705 (2016) - [i9]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Threshold Disjunctive Codes. CoRR abs/1601.06709 (2016) - [i8]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Bounds on the rate of disjunctive codes (in Russian). CoRR abs/1605.05363 (2016) - [i7]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
A simple construction of cover-free (s, ℓ)-code with certain constant weight. CoRR abs/1605.06847 (2016) - [i6]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Threshold Decoding for Disjunctive Group Testing. CoRR abs/1607.00502 (2016) - [i5]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Adaptive Learning a Hidden Hypergraph. CoRR abs/1607.00507 (2016) - [i4]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On a Hypergraph Approach to Multistage Group Testing Problems. CoRR abs/1607.00511 (2016) - 2015
- [c5]Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Symmetric disjunctive list-decoding codes. ISIT 2015: 2236-2240 - [c4]Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Cover-free codes and separating system codes. ISIT 2015: 2894-2898 - [c3]Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Almost cover-free codes and designs. ISIT 2015: 2899-2903 - 2014
- [c2]Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Bounds on the rate of superimposed codes. ISIT 2014: 2341-2345 - [i3]Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Almost Disjunctive List-Decoding Codes. CoRR abs/1407.2482 (2014) - [i2]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Symmetric Disjunctive List-Decoding Codes. CoRR abs/1410.8385 (2014) - [i1]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Almost Cover-Free Codes. CoRR abs/1410.8566 (2014) - 2011
- [c1]Arkadii G. D'yachkov, Julia Volkova, Nikita Polyanskii:
DNA codes for generalized stem similarity. ISIT 2011: 1564-1568
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 21:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
