Succinct data structures

DSpace/Manakin Repository

Succinct data structures

Show full item record

Title: Succinct data structures
Author: Srinivasa Rao, S.
Advisor: Venkatesh, Raman
Degree: Ph.D
Main Subjects: Computer Science
Institution: University of Madras
Year: 2001
Pages: v; 100p.
Abstract: This thesis aims to develop space efficient structures for some of the most fundamental problems in the area of data structures. The design of data structures that use almost optimal space while supporting the operations efficiently, is the focus in particular. The representations of suffix trees, suffix arrays, static dictionaries supporting rank, cardinal trees, a list of numbers supporting partial sum queries, dynamic bit vectors and dynamic arrays are some of the problems considered for this study. These problems are studied in the extended RAM model which supports all arithmetic and bitwise boolean operations on words in constant time. The problem of static dictionary also is considered in the bitprobe model. Two index structures are developed with better space complexity, supporting a restricted set of indexing queries. A compressed suffix array implementation is given in constant time, as the extension of ideas of Grossi and Vitter.
URI: http://hdl.handle.net/123456789/99

Files in this item

Files Size Format View
UNMTH74.pdf 1.028Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Search DSpace


Advanced Search

Browse

My Account