{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:24:25Z","timestamp":1725582265885},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208768"},{"type":"electronic","value":"9783642208775"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20877-5_22","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T02:35:17Z","timestamp":1303871717000},"page":"206-217","source":"Crossref","is-referenced-by-count":3,"title":["Integer Representations towards Efficient Counting in the Bit Probe Model"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Greve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vineet","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satti Srinivasa","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-13731-0_22","volume-title":"Algorithm Theory - SWAT 2010","author":"P. Bose","year":"2010","unstructured":"Bose, P., Carmi, P., Jansens, D., Maheshwari, A., Morin, P., Smid, M.H.M.: Improved methods for generating quasi-gray codes. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol.\u00a06139, pp. 224\u2013235. Springer, Heidelberg (2010)"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0207012","volume":"7","author":"M.L. Fredman","year":"1978","unstructured":"Fredman, M.L.: Observations on the complexity of generating quasi-gray codes. SIAM Journal on Computing\u00a07(2), 134\u2013146 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR3","unstructured":"Gray, F.: Pulse code communications. U.S. Patent (2632058) (1953)"},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s00453-008-9247-2","volume":"56","author":"M. Ziaur Rahman","year":"2010","unstructured":"Ziaur Rahman, M., Ian Munro, J.: Integer representation and counting in the bit probe model. Algorithmica\u00a056(1), 105\u2013127 (2010)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20877-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:23:25Z","timestamp":1558574605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20877-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208768","9783642208775"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20877-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}