Pages that link to "Item:Q2784457"

The following pages link to Low redundancy in static dictionaries with constant query time (Q2784457):

Displaying 31 items.

• Entropy-bounded representation of point grids (Q390358) (← links)
• Succinct encoding of arbitrary graphs (Q391972) (← links)
• Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
• Low-contention data structures (Q433458) (← links)
• A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
• Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits (Q545998) (← links)
• Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
• Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
• Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
• On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
• Average-case analysis for a simple compression algorithm (Q1277385) (← links)
• Fast and simple compact hashing via bucketing (Q2165038) (← links)
• Determining membership with 2 simultaneous queries (Q2250448) (← links)
• The cell probe complexity of succinct data structures (Q2373728) (← links)
• Dynamic construction of an antidictionary with linear complexity (Q2437769) (← links)
• A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
• GLOUDS: representing tree-like graphs (Q2634715) (← links)
• Fully functional static and dynamic succinct trees (Q2799480) (← links)
• A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
• Dispersing hash functions (Q3055765) (← links)
• A Distribution-Sensitive Dictionary with Low Space Overhead (Q3183445) (← links)
• Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
• Constructing Efficient Dictionaries in Close to Sorting Time (Q3521910) (← links)
• Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time (Q3766870) (← links)
• Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
• Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
• Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes (Q5089193) (← links)
• m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)
• (Q5417721) (← links)
• Optimal Las Vegas reduction from one-way set reconciliation to error correction (Q5964019) (← links)
• Dynamic dictionaries for multisets and counting filters with constant time operations (Q6103528) (← links)