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 2015Show all

2 papers · 1 filter

cs.DS2015★ 3 cited

Minimum Cut of Directed Planar Graphs in O(nloglogn) Time

Shay Mozes, Cyril Nikolaev, Yahav Nussbaum +1

We give an $O (n lo g lo g n)$ time algorithm for computing the minimum cut (or equivalently, the shortest cycle) of a weighted directed planar graph. This improves the previous fas…

cs.DS2015

Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search

Pawel Gawrychowski, Shay Mozes, Oren Weimann

We present an optimal data structure for submatrix maximum queries in n x n Monge matrices. Our result is a two-way reduction showing that the problem is equivalent to the classica…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.