T. Kopelowitz

activity

20102026

most citedAn Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model

18 citations · 79 across the 27 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

cs.DS2019

${- 1, 0, 1}$ -APSP and (min,max)-Product Problems

Hodaya Barr, Tsvi Kopelowitz, Ely Porat +1

In the ${- 1, 0, 1}$ -APSP problem the goal is to compute all-pairs shortest paths (APSP) on a directed graph whose edge weights are all from ${- 1, 0, 1}$ . In the (min,max)-product p…

cs.DS2019★ 4 cited

The Strong 3SUM-INDEXING Conjecture is False

Tsvi Kopelowitz, Ely Porat

In the 3SUM-Indexing problem the goal is to preprocess two lists of elements from $U$ , $A = (a_{1}, a_{2}, \dots, a_{n})$ and $B = (b_{1}, b_{2}, ..., b_{n})$ , such that given an element $c \in U$ one c…

{−1,0,1}-APSP and (min,max)-Product Problems

The Strong 3SUM-INDEXING Conjecture is False

${- 1, 0, 1}$ -APSP and (min,max)-Product Problems