乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:57:45Z","timestamp":1649138265626},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":2696,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1016\/j.jda.2005.01.006","type":"journal-article","created":{"date-parts":[[2005,1,29]],"date-time":"2005-01-29T12:22:24Z","timestamp":1107001344000},"page":"106-141","source":"Crossref","is-referenced-by-count":0,"title":["Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem"],"prefix":"10.1016","volume":"4","author":[{"given":"George","family":"Lagogiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Makris","sequence":"additional","affiliation":[]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jda.2005.01.006_bib001","series-title":"Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"655","article-title":"Sublogarithmic searching without multiplications","author":"Andersson","year":"1995"},{"key":"10.1016\/j.jda.2005.01.006_bib002","series-title":"Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"135","article-title":"Faster deterministic sorting and searching in linear space","author":"Andersson","year":"1996"},{"key":"10.1016\/j.jda.2005.01.006_bib003","series-title":"Proc. 27th Annual Symposium on Theory of Computing (STOC)","first-page":"427","article-title":"Sorting in linear time?","author":"Andersson","year":"1995"},{"key":"10.1016\/j.jda.2005.01.006_bib004","series-title":"Proc. of the 32th Annual Symposium on Theory of Computing (STOC)","first-page":"335","article-title":"Tight(er) worst-case bounds on dynamic searching and priority queues","author":"Andersson","year":"2000"},{"issue":"1","key":"10.1016\/j.jda.2005.01.006_bib005","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1006\/jcss.2002.1822","article-title":"Optimal bounds for the predecessor problem and related problems","volume":"65","author":"Beame","year":"2002","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jda.2005.01.006_bib006","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1137\/0215072","article-title":"On the single-operation worst-case time complexity of the disjoint set union problem","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jda.2005.01.006_bib007","series-title":"Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"540","article-title":"Finger search trees with constant insertion time","author":"Brodal","year":"1998"},{"key":"10.1016\/j.jda.2005.01.006_bib008","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1137\/S0097539791194094","article-title":"Dynamic perfect hashing: upper and lower bounds","volume":"23","author":"Dietzfeldbinger","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jda.2005.01.006_bib009","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","article-title":"Surpassing the information theoretic bound with fusion trees","volume":"47","author":"Fredman","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jda.2005.01.006_bib010","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","article-title":"Trans-dichotomous algorithms for minimum spanning trees and shortest paths","volume":"48","author":"Fredman","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jda.2005.01.006_bib011","series-title":"Data Structures and Efficient Algorithms, vol. 1: Sorting and Searching","author":"Mehlhorn","year":"1984"},{"issue":"6","key":"10.1016\/j.jda.2005.01.006_bib012","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1137\/0217070","article-title":"A lower bound on the complexity of the union-split-find problem","volume":"17","author":"Mehlhorn","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jda.2005.01.006_bib013","first-page":"167","article-title":"Computational geometry on a grid: an overview","volume":"vol. F40","author":"Overmars","year":"1988"},{"key":"10.1016\/j.jda.2005.01.006_bib014","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"van Emde Boas","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.jda.2005.01.006_bib015","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"van Emde Boas","year":"1977","journal-title":"Math. Systems Theory"},{"issue":"3","key":"10.1016\/j.jda.2005.01.006_bib016","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1137\/S0097539797322425","article-title":"Examining computational geometry, van Emde Boas trees and hashing from the perspective of the fusion tree","volume":"29","author":"Willard","year":"2000","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866705000067?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866705000067?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T01:26:56Z","timestamp":1548811616000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866705000067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["S1570866705000067"],"URL":"https:\/\/doi.org\/10.1016\/j.jda.2005.01.006","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}