Skip to search formSkip to main contentSkip to account menu

Succinct data structure

Known as: Succinct (disambiguation) 
In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We introduce succinct representations of a d-dimensional point setsupporting orthogonal range searching under two circumstances… 
Review
2015
Review
2015
Cloud storage such as Dropbox and Bitcasa is one of the most popular cloud services. Currently, with the prevalence of mobile… 
2014
2014
As mobile devices and Web applications become popular, lightweight, client-side language analysis is more important than ever. We… 
2010
2010
Frequent set mining searches for sets of items that are frequently co-occurring together. Existing algorithms mainly find all the… 
2009
2009
Efficient processing of tera-scale text data is an important research topic. This paper proposes lossless compression of N-gram… 
2009
2009
The LZ-index is a theoretical proposal of a lightweight data structure for text indexing, based on the Ziv-Lempel trie. If a text… 
2008
2008
This thesis defines and designs succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data… 
2005
2005
In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of nk-bit… 
2000
2000
ion or partial ordering: Only use the part of the space required for a particular proof. Implementations exploiting this… 
1957
1957
SommaireAprès un historique succinct (paragraphe I), l’auteur expose les principes de l’amplification de l’énergie de haute fr…