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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2013

The biggest cost of computing with large matrices in any modern computer is related to memory latency and bandwidth. The average…

2012

We describe recent breakthroughs in the field of compressed data structures, in which the data structure is stored in a…

2012

Recent advancements in the field of compressed data structures create interesting opportunities for interdisciplinary research…

2010

We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They…

Highly Cited

2008

Highly Cited

2008

Bloom filters are efficient randomized data structures for membership queries on a set with a certain known false positive…

2007

The paper introduces a new type of compression for decision diagram data structures, such as BDDs, MDDs and AOMDDs. The…

2006

Graphs are increasingly becoming a vital source of information within which a great deal of semantics is embedded. As the size of…

2003

High-speed packet classification is crucial to the implementation of several advanced network services and protocols; many QoS…

1985

One of the standard methods of simplifying the task of obtaining a shaded image of a solid object is to represent it by a…