◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Oren Weimann

45 papers hereh-index 262.2k citations93 works total

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

author position
  • first author1
  • middle author2
  • last author41

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

fields
  • cs.DS39
  • cs.DC3
  • cs.GT2
  • cs.CC1
same name
  • Oren Weimann — 1 paper

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 · 303 across the 29 of their papers we have counts for

collaborators
Showing 2010Show all

2 papers · 1 filter

cs.DS2010

Unified Compression-Based Acceleration of Edit-Distance Computation

Danny Hermelin, Gad M. Landau, Shir Landau +1

The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s…

cs.DS2010

Random Access to Grammar Compressed Strings

Philip Bille, Gad M. Landau, Rajeev Raman +3

Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular…

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