scientific article; zbMATH DE number 2038723
From MaRDI portal
Publication:4449188
zbMath1039.68043MaRDI QIDQ4449188
Rajeev Raman, S. Srinivasa Rao
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190357.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
Optimal In-place Algorithms for Basic Graph Problems ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Unnamed Item ⋮ Fast and simple compact hashing via bucketing ⋮ Representation of ordered trees with a given degree distribution ⋮ Space-efficient B trees via load-balancing ⋮ A compact data structure for representing a dynamic multiset ⋮ Succinct data structure for dynamic trees with faster queries ⋮ m-Bonsai: A Practical Compact Dynamic Trie ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet ⋮ Succinct representation of dynamic trees ⋮ Spaces, Trees, and Colors ⋮ Dynamic extended suffix arrays ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ On regularity lemma and barriers in streaming and dynamic matching ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Rank/select on dynamic compressed sequences and applications ⋮ Succinct Representations of Ordinal Trees ⋮ Linked dynamic tries with applications to LZ-compression in sublinear time and space ⋮ Succinct dynamic cardinal trees
This page was built for publication:
