Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/81346
Title: | Editorial : special issue on efficient data structures | Authors: | Jansson, J | Issue Date: | 2019 | Source: | Algorithms, July 2019, v. 12, no. 7, 136, p. 1-2 | Abstract: | This Special Issue of Algorithms is focused on the design, formal analysis, implementation, and experimental evaluation of efficient data structures for various computational problems. | Keywords: | Link-cut tree Distributed combinatorial map Sliding suffix tree DenseZDD Dynamic DFS tree Selectable sloppy heap |
Publisher: | Molecular Diversity Preservation International (MDPI) | Journal: | Algorithms | EISSN: | 1999-4893 | DOI: | 10.3390/a12070136 | Rights: | © 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). The following publication Jansson, J. Editorial: Special Issue on Efficient Data Structures. Algorithms 2019, 12, 136, 1-2 is available at https://dx.doi.org/10.3390/a12070136 |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Jansson_Efficient_Data_Structures.pdf | 150.55 kB | Adobe PDF | View/Open |
Page views
128
Last Week
1
1
Last month
Citations as of Sep 22, 2024
Downloads
83
Citations as of Sep 22, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.