scientific article; zbMATH DE number 1830754

zbMath0997.68520MaRDI QIDQ4778577

Venkatesh Raman, Rajeev Raman, S. Srinivasa Rao

Publication date: 18 November 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2125/21250426

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

The cell probe complexity of succinct data structures ⋮ Fast algorithms for the rooted triplet distance between caterpillars ⋮ Compressed property suffix trees ⋮ Compressed dynamic range majority and minority data structures ⋮ Space efficient data structures for dynamic orthogonal range counting ⋮ Unnamed Item ⋮ Random access in persistent strings and segment selection ⋮ Succinct representations of permutations and functions ⋮ Unnamed Item ⋮ m-Bonsai: A Practical Compact Dynamic Trie ⋮ Succinct Partial Sums and Fenwick Trees ⋮ Approximate query processing over static sets and sliding windows ⋮ Rank and select revisited and extended ⋮ Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet ⋮ Determining membership with 2 simultaneous queries ⋮ Dynamic relative compression, dynamic partial sums, and substring concatenation ⋮ Opportunistic data structures for range queries ⋮ Succinct data structures for searchable partial sums with optimal worst-case performance ⋮ Unnamed Item ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Dynamic rank/select structures with applications to run-length encoded texts ⋮ Partial sums on the ultra-wide word RAM ⋮ Unnamed Item ⋮ Space efficient linear time algorithms for BFS, DFS and applications ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ A Survey of Data Structures in the Bitprobe Model ⋮ Succinct dynamic cardinal trees