Succinct data structures

DSpace/Manakin Repository

Succinct data structures

Show simple item record

dc.contributor.author Srinivasa Rao, S.
dc.date.accessioned 2009-09-01T11:54:24Z
dc.date.available 2009-09-01T11:54:24Z
dc.date.issued 2009-09-01T11:54:24Z
dc.date.submitted 2001
dc.identifier.uri http://hdl.handle.net/123456789/99
dc.description.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. en_US
dc.subject Suffix Tree en_US
dc.subject Suffix Array en_US
dc.subject Data Structures en_US
dc.title Succinct data structures en_US
dc.type.degree Ph.D en_US
dc.type.institution University of Madras en_US
dc.description.advisor Venkatesh, Raman
dc.description.pages v; 100p. en_US
dc.type.mainsub Computer Science en_US

Files in this item

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

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account