{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:38:15Z","timestamp":1740105495251,"version":"3.37.3"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T00:00:00Z","timestamp":1538784000000},"content-version":"am","delay-in-days":309,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1440638"],"award-info":[{"award-number":["1440638"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Physics"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1016\/j.jcp.2017.09.056","type":"journal-article","created":{"date-parts":[[2017,9,30]],"date-time":"2017-09-30T05:18:20Z","timestamp":1506748700000},"page":"473-477","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["A short note on the use of the red\u2013black tree in Cartesian adaptive mesh refinement algorithms"],"prefix":"10.1016","volume":"351","author":[{"given":"Jaber J.","family":"Hasbestan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1967-7583","authenticated-orcid":false,"given":"Inanc","family":"Senocak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcp.2017.09.056_br0010","first-page":"1661","article-title":"Fast Generation of Pointerless Octree Duals","volume":"vol. 29","author":"Lewiner","year":"2010"},{"year":"1966","series-title":"A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing","author":"Morton","key":"10.1016\/j.jcp.2017.09.056_br0020"},{"key":"10.1016\/j.jcp.2017.09.056_br0030","first-page":"220","article-title":"Out-of-Core Construction of Sparse Voxel Octrees","volume":"vol. 33","author":"Baert","year":"2014"},{"author":"Karras","key":"10.1016\/j.jcp.2017.09.056_br0040"},{"issue":"3","key":"10.1016\/j.jcp.2017.09.056_br0050","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.1137\/100791634","article-title":"p4est: Scalable algorithms for parallel adaptive mesh refinement on forests of octrees","volume":"33","author":"Burstedde","year":"2011","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"10.1016\/j.jcp.2017.09.056_br0060","first-page":"42","article-title":"Red\u2013black trees","volume":"17","author":"Schneier","year":"1992","journal-title":"Dr. Dobb's J."},{"key":"10.1016\/j.jcp.2017.09.056_br0070","series-title":"19th Annual Symposium on Foundations of Computer Science","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"key":"10.1016\/j.jcp.2017.09.056_br0080","series-title":"Proceedings of the 3rd International Conference on Virtual Execution Environments","first-page":"65","article-title":"How to shadow every byte of memory used by a program","author":"Nethercote","year":"2007"},{"key":"10.1016\/j.jcp.2017.09.056_br0090","series-title":"2012 IEEE 26th International Parallel & Distributed Processing Symposium","first-page":"426","article-title":"Low-cost parallel algorithms for 2:1 octree balance","author":"Isaac","year":"2012"},{"issue":"2","key":"10.1016\/j.jcp.2017.09.056_br0100","first-page":"129","article-title":"The Zoltan and Isorropia parallel toolkits for combinatorial scientific computing: partitioning, ordering, and coloring","volume":"20","author":"Boman","year":"2012","journal-title":"Sci. Program."},{"author":"Hasbestan","key":"10.1016\/j.jcp.2017.09.056_br0110"}],"container-title":["Journal of Computational Physics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0021999117307295?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0021999117307295?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T05:45:35Z","timestamp":1618119935000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0021999117307295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":11,"alternative-id":["S0021999117307295"],"URL":"https:\/\/doi.org\/10.1016\/j.jcp.2017.09.056","relation":{},"ISSN":["0021-9991"],"issn-type":[{"type":"print","value":"0021-9991"}],"subject":[],"published":{"date-parts":[[2017,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A short note on the use of the red\u2013black tree in Cartesian adaptive mesh refinement algorithms","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational Physics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcp.2017.09.056","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}