{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:50:25Z","timestamp":1725983425322},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946665"},{"type":"electronic","value":"9783319946672"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94667-2_30","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T07:56:24Z","timestamp":1530604584000},"page":"361-373","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Representation of Partitions of Integers"],"prefix":"10.1007","author":[{"given":"Kentaro","family":"Sumigawa","sequence":"first","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P Elias","year":"1974","unstructured":"Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21(2), 246\u2013260 (1974)","journal-title":"J. ACM"},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1007\/s00453-016-0192-1","volume":"78","author":"H El-Zein","year":"2017","unstructured":"El-Zein, H., Lewenstein, M., Munro, J.I., Raman, V., Chan, T.M.: On the succinct representation of equivalence classes. Algorithmica 78(3), 1020\u20131040 (2017)","journal-title":"Algorithmica"},{"key":"30_CR3","unstructured":"Fano, R.M.: On the number of bits required to implement an associative memory. Project MAC, Massachusetts Institute of Technology (1971)"},{"key":"30_CR4","volume-title":"Young Tableaux","author":"W Fulton","year":"2012","unstructured":"Fulton, W.: Young Tableaux. Cambridge University Press, Cambridge (2012)"},{"issue":"4","key":"30_CR5","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1007\/s00453-013-9767-2","volume":"69","author":"A Golynski","year":"2014","unstructured":"Golynski, A., Orlandi, A., Raman, R., Rao, S.S.: Optimal indexes for sparse bit vectors. Algorithmica 69(4), 906\u2013924 (2014)","journal-title":"Algorithmica"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1112\/plms\/s2-17.1.75","volume":"2","author":"GH Hardy","year":"1918","unstructured":"Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. Lond. Math. Soc. 2(1), 75\u2013115 (1918)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"22","key":"30_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2012.03.005","volume":"438","author":"JI Munro","year":"2012","unstructured":"Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representation of permutation and functions. Theor. Comput. Sci. 438(22), 74\u201388 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR8","unstructured":"Pibiri, G.E., Venturini, R.: Dynamic Elias-Fano representation. In: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), vol. 78, issue 30, pp. 1\u201314 (2017)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding $$k$$-ary trees and multisets. ACM Trans. Algorithms 3(4) (2007). Article No. 43","DOI":"10.1145\/1290672.1290680"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T08:16:04Z","timestamp":1530605764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}