Succinct data structures for Searchable Partial Sums
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Saved in:
Main Authors: | Hon, W.-K., Sadakane, K., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39852 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Succinct data structures for searchable partial sums with optimal worst-case performance
by: Hon, W.-K., et al.
Published: (2013) -
Ultra-succinct representation of ordered trees with applications
by: Jansson, J., et al.
Published: (2013) -
Anomalous learning helps succinctness
by: Case, J., et al.
Published: (2014) -
Mining succinct predicated bug signatures
by: Sun, C., et al.
Published: (2014) -
Searchable data vault: Encrypted queries in secure distributed cloud storage
by: Poh, G.S, et al.
Published: (2020)