{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T09:28:41Z","timestamp":1652520521912},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,2]],"date-time":"2008-12-02T00:00:00Z","timestamp":1228176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00453-008-9247-2","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T16:40:35Z","timestamp":1228149635000},"page":"105-127","source":"Crossref","is-referenced-by-count":6,"title":["Integer Representation and Counting in the Bit Probe Model"],"prefix":"10.1007","volume":"56","author":[{"given":"M. Ziaur","family":"Rahman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,2]]},"reference":[{"issue":"12","key":"9247_CR1","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.355589","volume":"7","author":"J. Boothroyd","year":"1964","unstructured":"Boothroyd, J.: Algorithm 246 Graycode. Commun. ACM 7(12), 701 (1964)","journal-title":"Commun. ACM"},{"issue":"6","key":"9247_CR2","doi-asserted-by":"crossref","first-page":"1723","DOI":"10.1137\/S0097539702405292","volume":"31","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., Miltersen, P.B., Radhakrishnan, J., Venkatesh, S.: Are bitvectors optimal? SIAM J. Comput. 31(6), 1723\u20131744 (2002)","journal-title":"SIAM J. Comput."},{"key":"9247_CR3","doi-asserted-by":"crossref","unstructured":"Carlsson, S., Munro, J.I., Poblete, P.V.: An implicit priority queue with constant insertion time. In: Proceedings of 1st Scandinavian Workshop on Algorithm Theory, pp. 1\u201313 (1988)","DOI":"10.1007\/3-540-19487-8_1"},{"key":"9247_CR4","unstructured":"Clancy, M.J., Knuth, D.E.: A programming and problem-solving seminar. Tech Report, Computer Science Dept., School of Humanities and Science, Stanford University, STAN-CS-77-606 (1977)"},{"key":"9247_CR5","doi-asserted-by":"crossref","unstructured":"Cohn, M., Even, S.: A Gray code counter. IEEE Trans. Comput. 662\u2013664 (1969)","DOI":"10.1109\/T-C.1969.222736"},{"issue":"2","key":"9247_CR6","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P. Elias","year":"1974","unstructured":"Elias, P.: Efficient storage retrieval by content and address of static files. J. ACM 21(2), 246\u2013260 (1974)","journal-title":"J. ACM"},{"key":"9247_CR7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/321892.321899","volume":"22","author":"P. Elias","year":"1975","unstructured":"Elias, P., Flower, R.A.: The complexity of some simple retrieval problems. J. ACM 22, 367\u2013379 (1975)","journal-title":"J. ACM"},{"issue":"4","key":"9247_CR8","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1145\/6187.356154","volume":"11","author":"M.C. Er","year":"1985","unstructured":"Er, M.C.: Remark on algorithm 246 (Gray code). ACM Trans. Math. Softw. 11(4), 441\u2013443 (1985)","journal-title":"ACM Trans. Math. Softw."},{"key":"9247_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TEC.1957.5221582","volume":"EC-6","author":"A.F. Fischman","year":"1957","unstructured":"Fischman, A.F.: A gray code counter. IRE Trans. Electron. Comput. EC-6, 120 (1957)","journal-title":"IRE Trans. Electron. Comput."},{"key":"9247_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1145\/256303.256309","volume":"44","author":"G.S. Frandsen","year":"1997","unstructured":"Frandsen, G.S., Miltersen, P.B., Skyum, S.: Dynamic word problems. J. ACM 44, 257\u2013271 (1997)","journal-title":"J. ACM"},{"key":"9247_CR11","doi-asserted-by":"crossref","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 J. Comput. 7, 134\u2013146 (1978)","journal-title":"SIAM J. Comput."},{"key":"9247_CR12","unstructured":"Gray, F.: Pulse code communications. In: U.S. Patent 2632058 (1953)"},{"key":"9247_CR13","doi-asserted-by":"crossref","unstructured":"Lucal, H.: Arithmetic operations for digital computers using a modified reflected binary code. IEEE Trans. Comput. 449\u2013458 (1959)","DOI":"10.1109\/TEC.1959.5222057"},{"issue":"22","key":"9247_CR14","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1049\/el:19710449","volume":"7","author":"J.C. Majithia","year":"1971","unstructured":"Majithia, J.C.: Simple design for up\/down gray-code counters. Electron. Lett. 7(22), 658\u2013659 (1971)","journal-title":"Electron. Lett."},{"key":"9247_CR15","doi-asserted-by":"crossref","unstructured":"Miltersen, P.B.: The bit probe complexity measure revisited. In: Proceedings of the Symposium on Theoretical Aspects of Computer Science, pp. 662\u2013671 (1993)","DOI":"10.1007\/3-540-56503-5_65"},{"key":"9247_CR16","unstructured":"Miltersen, P.B.: Lower bounds on the size of selection and rank indexes. In: Proceedings of the 16th Annual ACM\/SIAM Symposium on Discrete Algorithms, pp. 11\u201312 (2005)"},{"key":"9247_CR17","volume-title":"Perceptrons","author":"M. Minsky","year":"1969","unstructured":"Minsky, M., Papert, S.: Perceptrons. MIT Press, Cambridge (1969)"},{"issue":"3","key":"9247_CR18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/355644.356449","volume":"1","author":"J. Misra","year":"1975","unstructured":"Misra, J.: Remark on algorithm 246: Graycode[Z]. ACM Trans. Math. Softw. 1(3), 285 (1975)","journal-title":"ACM Trans. Math. Softw."},{"key":"9247_CR19","doi-asserted-by":"crossref","unstructured":"P\u00e4tra\u015fcu, C.E., P\u00e4tra\u015fcu, M.: On dynamic bit-probe complexity. In: ICALP 2005, pp. 969\u2013981 (2005)","DOI":"10.1007\/11523468_78"},{"key":"9247_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-44676-1_24","volume-title":"ESA 2001","author":"J. Radhakrishnan","year":"2001","unstructured":"Radhakrishnan, J., Raman, V., Rao, S.S.: Explicit deterministic constructions for membership in the bitprobe model. In: ESA 2001. Lecture Notes in Computer Science, vol. 2161, pp. 290\u2013299. Springer, Berlin (2001)"},{"key":"9247_CR21","unstructured":"Rahman, M.Z., Munro, J.I.: Colored predecessor problem in the bit probe model. In: Proceedings of 8th International Conference on Computer and Information Technology (ICCIT 05), pp. 19\u201322 (2005)"},{"key":"9247_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/978-3-540-77120-3_3","volume-title":"ISAAC 2007","author":"M.Z. Rahman","year":"2007","unstructured":"Rahman, M.Z., Munro, J.I.: Integer representation and counting in the bit probe model. In: ISAAC 2007. Lecture Notes in Computer Science, vol. 4835, pp. 5\u201316. Springer, Berlin (2007)"},{"key":"9247_CR23","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/322261.322274","volume":"28","author":"A.C.C. Yao","year":"1981","unstructured":"Yao, A.C.C.: Should tables be sorted? J. ACM 28, 615\u2013628 (1981)","journal-title":"J. ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9247-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9247-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9247-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:03Z","timestamp":1559137503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9247-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["9247"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9247-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,2]]}}}