Adaptive succinctness
type: Item
instance of: scholarly article
title: Adaptive succinctness
author: Diego Arroyuelo
author: Rajeev Raman
published in: Algorithmica
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7495492
zbMATH Keywords: succinct and compressed data structures
zbMATH Keywords: succinct bit vectors
zbMATH Keywords: succinct rank/select data structures
zbMATH Keywords: integer-set compression
describes a project that uses: WebGraph
MaRDI profile type: Publication
full work available at URL: s00453-021-00872-1
OpenAlex ID: W4249184094
cites work: Dynamic ordered sets with exponential search trees
cites work: From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
cites work: Dictionaries using variable-length keys and data, with applications
cites work: Compact dictionaries for variable-length keys and data with applications
cites work: Codes for the World Wide Web
cites work: A walk through combinatorics. An introduction to enumeration and graph theory. With a foreword by Richard Stanley
cites work: An efficient method to evaluate intersections on big data sets
cites work: Q4875211
cites work: Q3651735
cites work: Elements of Information Theory
cites work: Q5452284
cites work: Engineering the LOUDS Succinct Tree Representation
cites work: Q4952695
cites work: Efficient Storage and Retrieval by Content and Address of Static Files
cites work: When indexing equals compression
cites work: Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
cites work: Run-length encodings (Corresp.)
cites work: On the Redundancy of Succinct Data Structures
cites work: Optimal indexes for sparse bit vectors
cites work: Q4471381
cites work: Compressed data structures: Dictionaries and data-aware measures
cites work: A Data-Aware FM-index
cites work: Huffman coding in bit-vector compression
cites work: Ultra-succinct representation of ordered trees with applications
cites work: Q5708460
cites work: On the Size of Succinct Indices
cites work: Time-space trade-offs for predecessor search
cites work: Q5417611
cites work: Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
cites work: Squeezing succinct data structures into entropy bounds
DOI: 10.1007/S00453-021-00872-1
Recommended article: Q3729823
Recommended article: Adaptive Heuristics
Recommended article: Axioms of adaptivity
Recommended article: Q3043806
Recommended article: Adaptive Cascade
Recommended article: Q4250302
Recommended article: Q4834628
Recommended article: Sensitivity, robustness and efficiency of adaptation
Recommended article: The adaptive logic of compatibility
description: scientific article; zbMATH DE number 7495492