Search Sciweavers | Sciweavers

1396 search results - page 2 / 280

» Succinct Dynamic Data Structures

click to vote

DCC
2010
IEEE

187views Computer Graphics» more DCC 2010»

Advantages of Shared Data Structures for Sequences of Balanced Parentheses

14 years 12 days ago

Download www-ab.informatik.uni-tuebingen.de

We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...

Simon Gog, Johannes Fischer

claim paper

Read More »

click to vote

ICALP
2003
Springer

129views Programming Languages» more ICALP 2003»

The Cell Probe Complexity of Succinct Data Structures

13 years 10 months ago

Download www.daimi.au.dk

Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoﬀ of solutions to static data structure problems.

Anna Gál, Peter Bro Miltersen

claim paper

Read More »

click to vote

STOC
2009
ACM

120views Algorithms» more STOC 2009»

Bit-probe lower bounds for succinct data structures

14 years 6 months ago

Download www.cs.umd.edu

We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...

Emanuele Viola

claim paper

Read More »

click to vote

CPM
2006
Springer

115views Combinatorics» more CPM 2006»

Statistical Encoding of Succinct Data Structures

13 years 9 months ago