Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Compressed data structure

Known as: Compressed data structures 
The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Shannon’s entropy is a clear lower bound for statistical compression. The situation is not so well understood for dictionary… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2017
2017
The Tucker decomposition is a higher-order analogue of the singular value decomposition and is a popular method of performing… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2016
2016
The need to store and query a set of strings - a string dictionary - arises in many kinds of applications. While classically… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2013
2013
Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
In a variety of applications, ranging from highspeed networks to massive databases, there is a need to maintain histograms and… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2007
2007
We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Consider a sequence <i>S</i> of <i>n</i> symbols drawn from an alphabet <i>A</i> = {1, 2,. . .,σ}, stored as a binary string of… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
AbstractMany algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Following your need to always fulfil the inspiration to obtain everybody is now simple. Connecting to the internet is one of the… Expand
Is this relevant?