Editorial: Special Issue on Efficient Data Structures

Data structures provide ways of compactly organizing and efficiently retrieving various kinds of information, and are consequently fundamental to computer science. Over the years, data structures have been used effectively in countless practical and conceptual applications. For example, a nineteenth-century data structure known as the phylogenetic tree, nowadays routinely used for representing the evolutionary history of a set of biological species, has helped scientists to understand the mechanisms of evolution. As another example, a twenty-first-century data structure known as the blockchain, which aims at achieving decentralized consensus, has many potentially important applications involving the creation of permanent ledgers for sharing information over the Internet and automated contracts.

To encourage further original research on efficient data structures, we set up a Special Issue of the MDPI journal Algorithms devoted to this topic. The call-for-papers invited articles dealing with the design, formal analysis, implementation, and experimental evaluation of efficient data structures for all kinds of computational problems. Of particular interest were algorithms for constructing data structures and extracting information from them efficiently. Articles focusing on complexity aspects of data structures related to time-space tradeoffs, information-theoretic entropy, and lower bounds in various models of computation were also welcomed.

All of the articles submitted to the Special Issue were evaluated by invited experts. In many cases, their detailed comments improved the technical strength and the quality of presentation. After several rounds of revisions and reviewing, six of the submitted articles were accepted for inclusion in the Special Issue. These six articles present new results for a wide variety of data structures with unexpectedly diverse applications: the link-cut tree (Russo et al. [1]), the distributed combinatorial map (Damiand et al. [2]), the sliding suffix tree (Brodnik and Jekovec [3]), the DenseZDD (Denzumi et al. [4]), the dynamic DFS tree (Nakamura and Sadakane [5]), and the selectable sloppy heap (Dumitrescu [6]). As a whole, they represent some of the current trends in the field. We hope that you will enjoy reading them and that you will find them useful in one way or another.