乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T19:53:37Z","timestamp":1723406017355},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"vor","delay-in-days":1480,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002848","name":"CONICYT","doi-asserted-by":"publisher","award":["FB0001"],"id":[{"id":"10.13039\/501100002848","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1016\/j.tcs.2016.04.031","type":"journal-article","created":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T10:03:15Z","timestamp":1462096995000},"page":"135-145","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"PB","title":["Simple and efficient fully-functional succinct trees"],"prefix":"10.1016","volume":"656","author":[{"given":"Joshimar","family":"Cordova","sequence":"first","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2016.04.031_br0010","series-title":"Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"549","article-title":"Space-efficient static trees and graphs","author":"Jacobson","year":"1989"},{"issue":"3","key":"10.1016\/j.tcs.2016.04.031_br0020","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0097539799364092","article-title":"Succinct representation of balanced parentheses and static trees","volume":"31","author":"Munro","year":"2001","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2016.04.031_br0030","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.tcs.2006.09.014","article-title":"A simple optimal representation for balanced parentheses","volume":"368","author":"Geary","year":"2006","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2016.04.031_br0040","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1137\/S0097539702411381","article-title":"Orderly spanning trees with applications","volume":"34","author":"Chiang","year":"2005","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2016.04.031_br0050","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2012.03.005","article-title":"Succinct representations of permutations and functions","volume":"438","author":"Munro","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2016.04.031_br0060","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1367064.1367068","article-title":"Balanced parentheses strike back","volume":"4","author":"Lu","year":"2008","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"10.1016\/j.tcs.2016.04.031_br0070","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","article-title":"Representing trees of higher degree","volume":"43","author":"Benoit","year":"2005","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.tcs.2016.04.031_br0080","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/1198513.1198516","article-title":"Succinct ordinal trees with level-ancestor queries","volume":"2","author":"Geary","year":"2006","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"10.1016\/j.tcs.2016.04.031_br0090","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.jcss.2011.09.002","article-title":"Ultra-succinct representation of ordered trees with applications","volume":"78","author":"Jansson","year":"2012","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/j.tcs.2016.04.031_br0100","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/2601073","article-title":"Fully-functional static and dynamic succinct trees","volume":"10","author":"Navarro","year":"2014","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2016.04.031_br0110","series-title":"Proc. 12th Workshop on Algorithm Engineering and Experiments (ALENEX)","first-page":"84","article-title":"Succinct trees in practice","author":"Arroyuelo","year":"2010"},{"key":"10.1016\/j.tcs.2016.04.031_br0120","series-title":"Proc. 11th International Symposium on Experimental Algorithms (SEA)","first-page":"224","article-title":"Dynamizing succinct tree representations","volume":"vol. 7276","author":"Joannou","year":"2012"},{"issue":"3","key":"10.1016\/j.tcs.2016.04.031_br0130","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. Syst. Sci."},{"key":"10.1016\/j.tcs.2016.04.031_br0140","series-title":"Proc. 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"305","article-title":"Succincter","author":"P\u0103tra\u015fcu","year":"2008"},{"key":"10.1016\/j.tcs.2016.04.031_br0150","series-title":"Compact PAT trees","author":"Clark","year":"1996"},{"issue":"1","key":"10.1016\/j.tcs.2016.04.031_br0160","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","article-title":"The level ancestor problem simplified","volume":"321","author":"Bender","year":"2004","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2016.04.031_br0170","series-title":"Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX)","first-page":"60","article-title":"Practical entropy-compressed rank\/select dictionary","author":"Okanohara","year":"2007"},{"key":"10.1016\/j.tcs.2016.04.031_br0180","series-title":"Proc. 4th Latin American Theoretical Informatics Symposium (LATIN)","first-page":"88","article-title":"The LCA problem revisited","volume":"vol. 1776","author":"Bender","year":"2000"},{"key":"10.1016\/j.tcs.2016.04.031_br0190","series-title":"Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"150","article-title":"Data structures for range minimum queries in multidimensional arrays","author":"Yuan","year":"2010"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516300706?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516300706?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T03:04:36Z","timestamp":1608433476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516300706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":19,"alternative-id":["S0304397516300706"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.04.031","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2016,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Simple and efficient fully-functional succinct trees","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.04.031","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}