◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Niv Buchbinder

27 papers hereh-index 314.5k citations88 works total

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

author position
  • first author17
  • middle author6

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

fields
  • cs.DS26
  • cs.CR1

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedFair Coin Flipping: Tighter Analysis and the Many-Party Case

23 citations · 48 across the 24 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.DS2011★ 1 cited

A Polylogarithmic-Competitive Algorithm for the k-Server Problem

Nikhil Bansal, Niv Buchbinder, Aleksander Madry +2

We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a co…

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