◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Vereshchagin

7 papers hereh-index 215 citations18 works total

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

author position
  • sole author4
  • middle author1
  • last author2

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

fields
  • math.LO3
  • cs.CC1
  • cs.IT1
  • math.CO1
  • math.DS1
same name
  • N. Vereshchagin — 15 papers, h 25
  • N. Vereshchagin — 3 papers, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20132026
most citedShort lists with short programs for functions

3 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing cs.ITShow all

1 paper · 1 filter

cs.IT2026

Maximal Kolmogorov Complexity in a Hamming Ball

Alexander Kozachinskiy, Nikolay Vereshchagin

The minimal Kolmogorov complexity of a string within Hamming distance r of a given string x is the algorithmic rate-distortion function of x, and Vereshchagin and Vitanyi character…

◍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.