Next Article in Journal
Money Neutrality, Monetary Aggregates and Machine Learning
Previous Article in Journal
Breast Microcalcification Detection Algorithm Based on Contourlet and ASVM
Previous Article in Special Issue
A Selectable Sloppy Heap
Article Menu

Export Article

Open AccessEditorial

Editorial: Special Issue on Efficient Data Structures

Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon 810005, Hong Kong, China
Algorithms 2019, 12(7), 136; https://doi.org/10.3390/a12070136
Received: 2 July 2019 / Accepted: 3 July 2019 / Published: 5 July 2019
(This article belongs to the Special Issue Efficient Data Structures)
  |  
PDF [154 KB, uploaded 5 July 2019]

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. View Full-Text
Keywords: link-cut tree; distributed combinatorial map; sliding suffix tree; DenseZDD; dynamic DFS tree; selectable sloppy heap link-cut tree; distributed combinatorial map; sliding suffix tree; DenseZDD; dynamic DFS tree; selectable sloppy heap
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Jansson, J. Editorial: Special Issue on Efficient Data Structures. Algorithms 2019, 12, 136.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top