Back to Results
First PageMeta Content
Arrays / Suffix array / Suffix tree / Compressed suffix array / String searching algorithm / Bit array / Trie / String / Permutation / Computing / Theoretical computer science / Mathematics


Document Date: 2005-05-02 11:32:09

Open Document

File Size: 379,27 KB

Share Result on Facebook

City

Sophia Antipolis / /

Company

Compress SA / Let SA / T SA / /

Country

France / /

/

Facility

Computer Science Duke University / /

IndustryTerm

on-line queries / search bounds / on-line query / offline string matching algorithms / search pattern / text search / search keys / pattern search / binary search trees / search navigation / online text / string matching solution / search cost / typical search scenario / data mining / search queries / time search / search bound / search time / search time complexity / careful accounting / /

Organization

Department of Computer Science Duke University Durham / National Science Foundation / Italian Ministry of Research and Education / United Nations Educational / Scientific and Cultural Organization / /

Person

Raman / Rao / Jeffrey Scott Vitter / Demaine / /

/

Position

author / bit-probe model / /

ProvinceOrState

Manitoba / /

PublishedMedium

the Theory of Computing / /

Technology

RAM / offline string matching algorithms / ascii / data mining / time algorithms / /

SocialTag