1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DB2020★ 1 cited
Compressed Key Sort and Fast Index Reconstruction
Yongsik Kwon, Cheol Ryu, Sang Kyun Cha +3
In this paper we propose an index key compression scheme based on the notion of distinction bits by proving that the distinction bits of index keys are sufficient information to de…
cs.DS2019
Fast Cartesian Tree Matching
Siwoo Song, Cheol Ryu, Simone Faro +2
Cartesian tree matching is the problem of finding all substrings of a given text which have the same Cartesian trees as that of a given pattern. So far there is one linear-time sol…