Opportunistic Data Structures with Applications

@inproceedings{citeulike:556200, abstract = {There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponential increase of electronic data nowadays available which is even surpassing the significant increase in memory and disk storage capacities of current computers. Space reduction is an attractive issue because it is also intimately related to performance improvements as noted by several authors (e.g. Knuth [15],...}, author = {Ferragina, Paolo and Manzini, Giovanni }, booktitle = {IEEE Symposium on Foundations of Computer Science}, citeulike-article-id = {556200}, pages = {390--398}, posted-at = {2006-03-17 18:38:52}, priority = {2}, title = {Opportunistic Data Structures with Applications}, url = {http://citeseer.ist.psu.edu/ferragina00opportunistic.html}, year = {2000} }

TY - CONF ID - citeulike:556200 L3 - citeulike-article-id:556200 TI - Opportunistic Data Structures with Applications T2 - IEEE Symposium on Foundations of Computer Science SP - 390 EP - 398 N2 - There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponential increase of electronic data nowadays available which is even surpassing the significant increase in memory and disk storage capacities of current computers. Space reduction is an attractive issue because it is also intimately related to performance improvements as noted by several authors (e.g. Knuth [15],... AU - Ferragina, Paolo AU - Manzini, Giovanni PY - 2000/// UR - http://citeseer.ist.psu.edu/ferragina00opportunistic.html ER -