Publication:4778577
From MaRDI portal
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
68P05: Data structures
Related Items
m-Bonsai: A Practical Compact Dynamic Trie, Succinct dynamic cardinal trees, Compressed property suffix trees, Space efficient data structures for dynamic orthogonal range counting, Succinct representations of permutations and functions, Succinct data structures for searchable partial sums with optimal worst-case performance, Dynamic rank/select structures with applications to run-length encoded texts, Dynamic relative compression, dynamic partial sums, and substring concatenation, Determining membership with 2 simultaneous queries, Space efficient linear time algorithms for BFS, DFS and applications, The cell probe complexity of succinct data structures, Rank and select revisited and extended, Opportunistic data structures for range queries, Fully Functional Static and Dynamic Succinct Trees, Succinct and Implicit Data Structures for Computational Geometry, A Survey of Data Structures in the Bitprobe Model, Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet