{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:42:09Z","timestamp":1760240529148,"version":"build-2065373602"},"reference-count":6,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T00:00:00Z","timestamp":1562284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This Special Issue of Algorithms is focused on the design, formal analysis, implementation, and experimental evaluation of efficient data structures for various computational problems.<\/jats:p>","DOI":"10.3390\/a12070136","type":"journal-article","created":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T11:44:16Z","timestamp":1562327056000},"page":"136","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Editorial: Special Issue on Efficient Data Structures"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6859-8932","authenticated-orcid":false,"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[{"name":"Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon 810005, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,7,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Russo, L.M.S., Teixeira, A.S., and Francisco, A.P. (2018). Linking and Cutting Spanning Trees. Algorithms, 11.","DOI":"10.3390\/a11040053"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Damiand, G., Gonzalez-Lorenzo, A., Zara, F., and Dupont, F. (2018). Distributed Combinatorial Maps for Parallel Mesh Processing. Algorithms, 11.","DOI":"10.3390\/a11070105"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Brodnik, A., and Jekovec, M. (2018). Sliding Suffix Tree. Algorithms, 11.","DOI":"10.3390\/a11080118"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Denzumi, S., Kawahara, J., Tsuda, K., Arimura, H., Minato, S., and Sadakane, K. (2018). DenseZDD: A Compact and Fast Index for Families of Sets. Algorithms, 11.","DOI":"10.3390\/a11080128"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Nakamura, K., and Sadakane, K. (2019). Space-Efficient Fully Dynamic DFS in Undirected Graphs. Algorithms, 12.","DOI":"10.3390\/a12030052"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A. (2019). A Selectable Sloppy Heap. Algorithms, 12.","DOI":"10.3390\/a12030058"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/7\/136\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:02:49Z","timestamp":1760187769000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/7\/136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,5]]},"references-count":6,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2019,7]]}},"alternative-id":["a12070136"],"URL":"https:\/\/doi.org\/10.3390\/a12070136","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2019,7,5]]}}}