◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Azer Bestavros

Computer Science Department, Boston University

10 papers hereh-index 4614.3k citations318 works total

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

author position
  • first author1
  • middle author4
  • last author5

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

fields
  • cs.RO2
  • cs.AI1
  • cs.CR1
  • cs.DB1
  • cs.DC1
  • cs.DS1
affiliations
  • Computer Science Department, Boston University
Homepage

identity via Semantic Scholar / OpenAlex

activity
20112020
most citedConclave: secure multi-party computation on big data (extended TR)

108 citations · 149 across the 8 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

cs.DS2014

A Divide-and-Conquer Algorithm for Betweenness Centrality

Dora Erdos, Vatche Ishakian, Azer Bestavros +1

The problem of efficiently computing the betweenness centrality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is a…

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