{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T14:52:43Z","timestamp":1649170363962},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0304-3975(93)00079-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"377-385","source":"Crossref","is-referenced-by-count":0,"title":["Unit-cost pointers versus logarithmic-cost addresses"],"prefix":"10.1016","volume":"132","author":[{"given":"Amir M.","family":"Ben-Amram","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)00079-K_bib1","first-page":"305","article-title":"A model for hierarchical memory","author":"Aggarwal","year":"1987","journal-title":"Proceedings of the 19th Annual ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(93)00079-K_bib2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"3","key":"10.1016\/0304-3975(93)00079-K_bib3","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/146637.146666","article-title":"On pointers versus adresses","volume":"39","author":"Ben-Amram","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)00079-K_bib4","doi-asserted-by":"crossref","unstructured":"A.M. Ben-Amram and Z. Galil, On the power of the shift instruction, Inform. and Comput., to appear.","DOI":"10.1006\/inco.1995.1026"},{"issue":"11","key":"10.1016\/0304-3975(93)00079-K_bib5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1145\/362790.362798","article-title":"A non-recursive list compacting algorithm","volume":"13","author":"Cheney","year":"1970","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/0304-3975(93)00079-K_bib6","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","article-title":"Time bounded random access machines","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)00079-K_bib7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(89)90117-8","article-title":"Space measures for storage modification machines","volume":"30","author":"van Emde Boas","year":"1989","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0304-3975(93)00079-K_bib8","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)00079-K_bib9","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"key":"10.1016\/0304-3975(93)00079-K_bib10","article-title":"Real-time simulation of a set machine on a RAM","volume":"2","author":"Paige","year":"1989"},{"key":"10.1016\/0304-3975(93)00079-K_bib11","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"issue":"3","key":"10.1016\/0304-3975(93)00079-K_bib12","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/0209036","article-title":"Storage modification machines","volume":"9","author":"Sch\u00f6nhage","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)00079-K_bib13","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","article-title":"A class of algorithms which require nonlinear time to maintain disjoint sets","volume":"18","author":"Tarjan","year":"1979","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759300079K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759300079K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:39Z","timestamp":1555129719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759300079K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["030439759300079K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)00079-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}