◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Backurs

33 papers hereh-index 222.8k citations54 works total

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

author position
  • first author13
  • middle author20

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

fields
  • cs.CC10
  • cs.LG8
  • cs.DS7
  • cs.CL3
  • quant-ph3
  • cs.CG1

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedScalable Fair Clustering

58 citations · 203 across the 28 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

cs.CC2014★ 7 cited

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)

Arturs Backurs, Piotr Indyk

The edit distance (a.k.a. the Levenshtein distance) between two strings is defined as the minimum number of insertions, deletions or substitutions of symbols needed to transform on…

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