{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:33Z","timestamp":1783576953987,"version":"3.55.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"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":[[1995,7]]},"DOI":"10.1016\/0304-3975(95)80032-5","type":"journal-article","created":{"date-parts":[[2002,11,12]],"date-time":"2002-11-12T17:32:32Z","timestamp":1037122352000},"page":"167-174","source":"Crossref","is-referenced-by-count":7,"title":["On the cell probe complexity of polynomial evaluation"],"prefix":"10.1016","volume":"143","author":[{"given":"Peter","family":"Bro Miltersen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)80032-5_BIB1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02126797","article-title":"A lower bound for finding predecessors in Yao's cell probe model","volume":"8","author":"Ajtai","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(95)80032-5_BIB2","series-title":"Hash functions for priority queues","first-page":"299","author":"Ajtai","year":"1983"},{"key":"10.1016\/0304-3975(95)80032-5_BIB3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)80032-5_BIB4","first-page":"7","article-title":"Evaluation of polynomials of one variable with preliminary processing of the coefficients","volume":"5","author":"Belaga","year":"1961","journal-title":"Problemy Kibernet."},{"key":"10.1016\/0304-3975(95)80032-5_BIB5","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","article-title":"Storing a sparse table with O(l) worst case access time","volume":"31","author":"Fredman","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(95)80032-5_BIB6","series-title":"The cell probe complexity of dynamic data structures","first-page":"345","author":"Fredman","year":"1989"},{"key":"10.1016\/0304-3975(95)80032-5_BIB7","author":"Knuth","year":"1980"},{"key":"10.1016\/0304-3975(95)80032-5_BIB8","series-title":"Proc. 10th Symp. on Theoretical Aspects of Computer Science","first-page":"662","article-title":"The bit probe complexity measure revisited","volume":"Vol. 665","author":"Miltersen","year":"1993"},{"key":"10.1016\/0304-3975(95)80032-5_BIB9","series-title":"Lower bounds for Union-Split-Find related problems on random access machines","first-page":"625","author":"Miltersen","year":"1994"},{"key":"10.1016\/0304-3975(95)80032-5_BIB10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(94)90159-7","article-title":"Complexity models for incremental computation","volume":"130","author":"Miltersen","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)80032-5_BIB11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1070\/RM1966v021n01ABEH004147","article-title":"Methods of computing values of polynomials","volume":"21","author":"Pan","year":"1966","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/0304-3975(95)80032-5_BIB12","series-title":"Some complexity questions related to distributive computing","first-page":"209","author":"Yao","year":"1979"},{"key":"10.1016\/0304-3975(95)80032-5_BIB13","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/322261.322274","article-title":"Should tables be illegible???","volume":"28","author":"Yao","year":"1981","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800325?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800325?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T16:56:48Z","timestamp":1554224208000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595800325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0304397595800325"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)80032-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}