24 citations · 145 across the 45 of their papers we have counts for
Showing 2018 · cs.DSShow all
3 papers · 2 filters
cs.DS2018★ 16 cited
Locally Consistent Parsing for Text Indexing in Small Space
Or Birenzwige, Shay Golan, Ely Porat
We consider two closely related problems of text indexing in a sub-linear working space. The first problem is the Sparse Suffix Tree (SST) construction of a set of suffixes usi…
cs.DS2018
Improved Space-Time Tradeoffs for kSUM
Isaac Goldstein, Moshe Lewenstein, Ely Porat
In the kSUM problem we are given an array of numbers and we are required to determine if there are different elements in this array such that their sum is 0.…
cs.DS2018
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest
Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter
This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph…