1.8k citations
- Tel Aviv UniversityIL49 papers
- Ariel UniversityIL35 papers
- Technion – Israel Institute of TechnologyIL32 papers
- University of Maryland, College ParkUS32 papers
- Boston UniversityUS31 papers
- Ben-Gurion University of the NegevIL29 papers
- Centre National de la Recherche ScientifiqueFR28 papers
- Hebrew University of JerusalemIL27 papers
- Weizmann Institute of ScienceIL23 papers
- University of ChicagoUS22 papers
- Leibniz University HannoverDE21 papers
- Massachusetts Institute of TechnologyUS21 papers
Showing 2020 · cs.DSShow all
3 papers · 2 filters
cs.DS2020★ 1 cited
Update Query Time Trade-off for dynamic Suffix Arrays
Amihood Amir, Itai Boneh
The Suffix Array SA(S) of a string S[1 ... n] is an array containing all the suffixes of S sorted by lexicographic order. The suffix array is one of the most well known indexing da…
cs.DS2020★ 1 cited
Weighted Adaptive Coding
Aharon Fruchtman, Yoav Gross, Shmuel T. Klein +1
Huffman coding is known to be optimal, yet its dynamic version may be even more efficient in practice. A new variant of Huffman encoding has been proposed recently, that provably a…
cs.DS2020
Time-Space Tradeoffs for Finding a Long Common Substring
Stav Ben-Nun, Shay Golan, Tomasz Kociumaka +1
We consider the problem of finding, given two documents of total length , a longest string occurring as a substring of both documents. This problem, known as the Longest Common…