◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Javad B. Ebrahimi

2 papers hereh-index 11 citations3 works total

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

author position
  • first author1
  • last author1

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

fields
  • cs.DS1
  • cs.IT1
same name
  • Javad B. Ebrahimi — 2 papers
  • Javad B. Ebrahimi — 2 papers, h 2
  • Javad B. Ebrahimi — 2 papers, h 2
  • Javad B. Ebrahimi — 1 paper, h 7
  • Javad B. Ebrahimi — 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

most citedDifferentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs

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

collaborators

2 papers

cs.DS2023★ 1 cited

Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs

Javad B. Ebrahimi, Alireza Tofighi Mohammadi, Fatemeh Kermani

In this paper, we present a polynomial time algorithm for the problem of differentially private all pair shortest distances over the class of low tree-width graphs. Our result gene…

cs.IT2022

Entropic Weighted Rank Function

Mohammad Rashid, Elahe Ghasemi, Javad B. Ebrahimi

It is known that the entropy function over a set of jointly distributed random variables is a submodular set function. However, not any submodular function is of this form. In this…

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