◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yefim Dinitz

4 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 author3
  • middle author1

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

fields
  • cs.DS3
  • cs.DC1
same name
  • Yefim Dinitz — 1 paper

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
20202025
most citedLocal Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs

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

collaborators
Showing 2025Show all

1 paper · 1 filter

cs.DS2025

The Steiner Shortest Path Tree Problem

Omer Asher, Yefim Dinitz, Shlomi Dolev +2

We introduce and study a novel problem of computing a shortest path tree with a minimum number of non-terminals. It can be viewed as an (unweighted) Steiner Shortest Path Tree (SSP…

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