◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Benjamin Rossman

15 papers hereh-index 191.4k citations66 works total

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

author position
  • sole author5
  • first author2
  • middle author1
  • last author7

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

fields
  • cs.CC10
  • cs.LO2
  • math.CO2
  • cs.DS1
same name
  • Benjamin Rossman — 2 papers, 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

activity
20062026
most citedAn O(n^3)-Time Algorithm for Tree Edit Distance

206 citations · 246 across the 10 of their papers we have counts for

collaborators
Showing 2013Show all

1 paper · 1 filter

cs.CC2013

Formulas vs. Circuits for Small Distance Connectivity

Benjamin Rossman

We give the first super-polynomial separation in the power of bounded-depth boolean formulas vs. circuits. Specifically, we consider the problem Distance k(n) Connectivity, which…

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