◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Avinatan Hassidim

96 papers hereh-index 4614.1k citations211 works total

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

author position
  • first author10
  • middle author73
  • last author9

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

fields
  • cs.GT18
  • cs.LG16
  • cs.CL13
  • quant-ph12
  • cs.AI10
  • cs.DS8

identity via Semantic Scholar / OpenAlex

activity
20072026
most citedQuantum algorithm for solving linear systems of equations

3.4k citations · 5k across the 80 of their papers we have counts for

collaborators
Showing 2011 · cs.DSShow all

1 paper · 2 filters

cs.DS2011

An Efficient Partitioning Oracle for Bounded-Treewidth Graphs

Alan Edelman, Avinatan Hassidim, Huy N. Nguyen +1

Partitioning oracles were introduced by Hassidim et al. (FOCS 2009) as a generic tool for constant-time algorithms. For any epsilon > 0, a partitioning oracle provides query access…

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