{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:06Z","timestamp":1725567066268},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_57","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"560-569","source":"Crossref","is-referenced-by-count":0,"title":["Opportunistic Data Structures for Range Queries"],"prefix":"10.1007","author":[{"given":"Chung Keung","family":"Poon","sequence":"first","affiliation":[]},{"given":"Wai Keung","family":"Yiu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Beame, P., Fich, F.: Optimal bounds for the predecessor problem. In: STOC 1999, pp. 295\u2013304 (1999)","DOI":"10.1145\/301250.301323"},{"key":"57_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/3-540-45995-2_44","volume-title":"LATIN 2002: Theoretical Informatics","author":"M. Bender","year":"2002","unstructured":"Bender, M., Farach-Colton, M.: The level ancestor problem simplified. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 508\u2013512. Springer, Heidelberg (2002)"},{"key":"57_CR3","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithms. Technical Report 124, Digital SRC Research Report (1994)"},{"key":"57_CR4","series-title":"Series in Telecommunications","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Series in Telecommunications. John Wiley & Sons, Chichester (1991)"},{"key":"57_CR5","unstructured":"Ferragina, P., Manzini, G.: On compressing and indexing data. Technical Report TR-02-01, Dipartimento di Informatica, Universita di Pisa (January 2002)"},{"key":"57_CR6","unstructured":"Geary, R., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: SODA 2004, pp. 1\u201310 (2004)"},{"key":"57_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","volume":"12","author":"S.W. Golomb","year":"1966","unstructured":"Golomb, S.W.: Run-length encodings. IEEE Transaction on Information Theory\u00a012, 399\u2013401 (1966)","journal-title":"IEEE Transaction on Information Theory"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: STOC 2000, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"key":"57_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-540-24587-2_52","volume-title":"Algorithms and Computation","author":"W.-K. Hon","year":"2003","unstructured":"Hon, W.-K., Sadakane, K., Sung, W.-K.: Succinct data structures for searchable partial sums. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 505\u2013516. Springer, Heidelberg (2003)"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. In: Proc. of the I.R.E. 40, pp. 1098\u20131101 (1952)","DOI":"10.1109\/JRPROC.1952.273898"},{"issue":"3","key":"57_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0304-3975(02)00741-7","volume":"296","author":"C.K. Poon","year":"2003","unstructured":"Poon, C.K.: Dynamic orthogonal range queries in OLAP. Theoretical Computer Science\u00a0296(3), 487\u2013510 (2003)","journal-title":"Theoretical Computer Science"},{"key":"57_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44634-6_39","volume-title":"Algorithms and Data Structures","author":"R. Raman","year":"2001","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct dynamic data structures. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 426\u2013437. Springer, Heidelberg (2001)"},{"key":"57_CR13","unstructured":"Sadakane, K.: Succinct representation of lcp information and improvements in the compressed suffix arrays. In: SODA 2002, pp. 225\u2013232 (2002)"},{"key":"57_CR14","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/S0196-6774(03)00087-7","volume":"48","author":"K. Sadakane","year":"2003","unstructured":"Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms\u00a048, 294\u2013313 (2003)","journal-title":"Journal of Algorithms"},{"issue":"5","key":"57_CR15","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences by variable rate coding. IEEE Transaction on Information Theory\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE Transaction on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T20:13:12Z","timestamp":1548447192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11533719_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}