Pages that link to "Item:Q2875186"
From MaRDI portal
The following pages link to Changing base without losing space (Q2875186):
Displaying 16 items.
- Succinct representations of permutations and functions (Q441860) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster (Q2300733) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- How to Share a Secret, Infinitely (Q3181038) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
- (Q5092427) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)