[CPM-SPIRE-L] "Efficient Data Structures" special issue of Algorithms

[Tomas Ramsi]

The open access journal Algorithms has now published a special issue on
"Efficient Data Structures".
It is free for readers and available at:
  https://www.mdpi.com/journal/algorithms/special_issues/Efficient_Data_Structures

The six accepted articles present new results for a wide variety of data
structures with unexpectedly diverse applications:
the link-cut tree (Russo et al.), the distributed combinatorial map (Damiand et
al.), the sliding suffix tree (Brodnik and Jekovec), the DenseZDD (Denzumi et
al.), the dynamic DFS tree (Nakamura and Sadakane), and the selectable sloppy
heap (Dumitrescu).
As a whole, they represent some of the current trends in the field.

Jesper Jansson, the guest editor of this special issue, would like to thank all
researchers who submitted their work, the invited expert reviewers, MPDI, and
the editorial office for their assistance.


About the journal:
Algorithms (ISSN 1999-4893; CODEN: ALGOCH) is a peer-reviewed open access
journal which provides an advanced forum for studies related to algorithms and
their applications.
Algorithms is published monthly online by MDPI. 

Journal webpage:
http://www.mdpi.com/journal/algorithms