Pages that link to "Item:Q441860"
From MaRDI portal
The following pages link to Succinct representations of permutations and functions (Q441860):
Displaying 27 items.
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Succinct representation of labeled trees (Q476876) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← links)
- Distance-based index structures for fast similarity search (Q1709472) (← links)
- Path queries on functions (Q1740690) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- GraCT: a grammar-based compressed index for trajectory data (Q2212550) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Succinct data structure for dynamic trees with faster queries (Q2420610) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Representation of ordered trees with a given degree distribution (Q2656174) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
- (Q5092430) (← links)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- A Self-index on Block Trees (Q5150940) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- Compact representations of spatial hierarchical structures with support for topological queries (Q6040665) (← links)
