◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Maxim Yagafarov

3 papers hereh-index 119 citations4 works total

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

author position
  • last author3

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

fields
  • cs.DS3

identity via Semantic Scholar / OpenAlex

most citedFast Classical and Quantum Algorithms for Online k-server Problem on Trees

7 citations · 7 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DS2024

Time Efficient Implementation for Online k-server Problem on Trees

Kamil Khadiev, Maxim Yagafarov

We consider online algorithms for the k-server problem on trees of size n. Chrobak and Larmore proposed a k-competitive algorithm for this problem that has the optimal compet…

cs.DS2020★ 7 cited

Fast Classical and Quantum Algorithms for Online k-server Problem on Trees

Ruslan Kapralov, Kamil Khadiev, Joshua Mokut +2

We consider online algorithms for the k-server problem on trees. Chrobak and Larmore proposed a k-competitive algorithm for this problem that has the optimal competitive ratio.…

cs.DS2020

A Fast Algorithm for Online k-servers Problem on Trees

Kamil Khadiev, Maxim Yagafarov

We consider online algorithms for the k-server problem on trees. There is a k-competitive algorithm for this problem, and it is the best competitive ratio. M. Chrobak and L. La…

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