◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yefim Dinitz

6 papers hereh-index 151k citations56 works total

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

author position
  • first author5
  • middle author1

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

fields
  • cs.DS3
  • cs.CG1
  • cs.DC1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20082025
most citedLocal Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing cs.CGShow all

1 paper · 1 filter

cs.CG2008

Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners

Yefim Dinitz, Michael Elkin, Shay Solomon

We show that for every n-point metric space M there exists a spanning tree T with unweighted diameter O(logn) and weight ω(T)=O(logn)⋅ω(MST(M)). Moreover, the…

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