{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:06:25Z","timestamp":1743019585487,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_411","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:58Z","timestamp":1214505058000},"page":"915-919","source":"Crossref","is-referenced-by-count":4,"title":["Succinct Encoding of Permutations: Applications to Text Indexing"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"411_CR1_411","first-page":"24","volume-title":"Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science (LNCS), vol. 4009","author":"J. Barbay","year":"2006","unstructured":"Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree\u2010structured documents. In: Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science (LNCS), vol.\u00a04009, pp.\u00a024\u201335. Springer, Berlin (2006)"},{"key":"411_CR2_411","unstructured":"Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0680\u2013689. ACM, SIAM (2007)"},{"key":"411_CR3_411","unstructured":"Ferragina, P., Venturini, R.: A\u00a0simple storage scheme for strings achieving entropy bounds. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0690\u2013695. ACM, SIAM (2007)"},{"key":"411_CR4_411","doi-asserted-by":"crossref","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/select operations on large alphabets: a\u00a0tool for text indexing. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0368\u2013373. ACM, SIAM (2006)","DOI":"10.1145\/1109557.1109599"},{"key":"411_CR5_411","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space\u2010efficient static trees and graphs. In: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"411_CR6_411","unstructured":"Jansson, J., Sadakane, K., Sung, W.-K.: Ultra-succinct representation of ordered trees. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0575\u2013584. ACM, SIAM (2007)"},{"key":"411_CR7_411","first-page":"345","volume-title":"Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science (LNCS), vol. 2719","author":"J.I. Munro","year":"2003","unstructured":"Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science (LNCS), vol.\u00a02719, pp.\u00a0345\u2013356. Springer, Berlin (2003)"},{"key":"411_CR8_411","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J.\u00a0Comput. 31, 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"key":"411_CR9_411","first-page":"1006","volume-title":"Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science (LNCS), vol. 3142","author":"J.I. Munro","year":"2004","unstructured":"Munro, J.I., Rao, S.S.: Succinct representations of functions. In: Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science (LNCS), vol.\u00a03142, pp.\u00a01006\u20131015. Springer, Berlin (2004)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:32:13Z","timestamp":1662175933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_411"}},"subtitle":["2003; Munro, Raman, Raman, Rao"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_411","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}