Gilad Baruch

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In previous work we have suggested a data structure based on pruning a Huffman shaped Wavelet tree according to the underlying skeleton Huffman tree. This pruned Wavelet tree was especially designed to support faster random access and save memory storage, at the price of less effective rank and select operations, as compared to the original Huffman shaped(More)
  • 1