Searching for "Lower Bounds for Succinct Data Structures." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Ultra-succinct representation of ordered trees
by Jesper Jansson, Kunihiko Sadakane, Wing-kin Sung — 2007 — In Proc. SODA
… the information-theoretic lower bound of succinct data structures is 2n − Θ(log n) bits. Many data structures…
Cited by 15 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB