◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Nikolenko

38 papers hereh-index 2929.3k citations191 works total

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

author position
  • sole author2
  • first author4
  • middle author15
  • last author16

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

fields
  • cs.CL13
  • cs.IR5
  • cs.CV4
  • cs.LG4
  • cs.NI4
  • cs.CC2
same name
  • S. Nikolenko — 3 papers, h 2
  • S. Nikolenko — 2 papers, h 2
  • S. Nikolenko — 1 paper, h 1

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
20032026
most citedBayesHammer: Bayesian clustering for error correction in single-cell sequencing

501 citations · 1k across the 33 of their papers we have counts for

collaborators
Showing cs.NIShow all

4 papers · 1 filter

cs.NI2019★ 1 cited

New Competitiveness Bounds for the Shared Memory Switch

Ivan Bochkov, Alex Davydow, Nikita Gaevoy +1

We consider one of the simplest and best known buffer management architectures: the shared memory switch with multiple output queues and uniform packets. It was one of the first mo…

cs.NI2015

BASEL (Buffering Architecture SpEcification Language)

Kirill Kogan, Danushka Menikkumbura, Gustavo Petri +3

Buffering architectures and policies for their efficient management constitute one of the core ingredients of a network architecture. In this work we introduce a new specification…

cs.NI2012★ 2 cited

FIFO Queueing Policies for Packets with Heterogeneous Processing

Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko +2

We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can…

cs.NI2012★ 1 cited

Balancing Work and Size with Bounded Buffers

Kirill Kogan, Alejandro Lopez-Ortiz, Sergey I. Nikolenko +2

We consider the fundamental problem of managing a bounded size queue buffer where traffic consists of packets of varying size, where each packet requires several rounds of processi…

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