SDSL - Succinct Data Structure Library. The Succinct Data Structure Library (SDSL) is a powerful and flexible C++11 library implementing succinct data structures. In total, the library contains the highlights of 40 research publications. Succinct data structures can represent an object (such as a bitvector or a tree) in space close to the information-theoretic lower bound of the object while supporting operations of the original object efficiently. The theoretical time complexity of an operation performed on the classical data structure and the equivalent succinct data structure are (most of the time) identical.
Keywords for this software
References in zbMATH (referenced in 9 articles )
Showing results 1 to 9 of 9.
- Durocher, Stephane; Singh, Robby: A simple linear-space data structure for constant-time range minimum query (2019)
- Baier, Uwe: On undetected redundancy in the Burrows-Wheeler transform (2018)
- Almodaresi, Fatemeh; Pandey, Prashant; Patro, Rob: Rainbowfish: a succinct colored de Bruijn graph representation (2017)
- Fuentes-Sepúlveda, José; Ferres, Leo; He, Meng; Zeh, Norbert: Parallel construction of succinct trees (2017)
- Navarro, Gonzalo; Ordóñez Pereira, Alberto: Faster compressed suffix trees for repetitive collections (2016)
- Gog, Simon; Karhu, Kalle; Kärkkäinen, Juha; Mäkinen, Veli; Välimäki, Niko: Multi-pattern matching with bidirectional indexes (2014)
- Grossi, Roberto; Ottaviano, Giuseppe: Fast compressed tries through path decompositions (2014)
- Venturini, Rossano: Compressed data structures for strings. On searching and extracting strings from compressed textual data (2014)
- Raman, Rajeev; Rao, S. Srinivasa: Succinct representations of ordinal trees (2013)