◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Polyanskii

38 papers hereh-index 11440 citations63 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author4
  • middle author27
  • last author7

Across the 38 of 38 papers where every author was matched, so the position is known.

fields
  • cs.IT33
  • cs.DC2
  • math.CO2
  • cs.CR1

identity via Semantic Scholar / OpenAlex

activity
20142024
most citedTangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG

60 citations · 151 across the 27 of their papers we have counts for

collaborators
Showing 2024 · cs.ITShow all

1 paper · 2 filters

cs.IT2024★ 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 d defective elements among a given set of n eleme…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.