<meta http-equiv="Content-Type" content="text/html; charset=utf-8"><div dir="ltr"><div>Journal: Algorithms</div><div>Special Issue: Algorithms and Data-Structures for Compressed Computation</div><div>Submission Deadline: 30 January 2021</div><div><br></div><div>Dear Colleagues,</div><div><br></div><div>As the production of massive data has outpaced Moore’s law in many scientific areas, the very notion of algorithm is shaping up to keep the pace. Today’s algorithms must not only be able to deal with large amounts of data, they also must be capable to use resources close to their theoretical limits. Against this landscape, compression has become a fundamental tool to make the storage of this kind of data possible in the first place.</div><div><br></div><div>While motivated by the fact that massive data are often very compressible, this approach poses interesting algorithmic challenges: Can we compute directly on compressed data without first decompressing it? Can we propose measures and frameworks to compare different approaches? Can different techniques for compressed computation be unified?</div><div><br></div><div>Thanks to more than two decades of successful research on the subject, today we know that many algorithmic marvels are indeed possible. As a matter of fact, compression and computation are now recognised to be two sides of the same coin, as they exploit the same underlying structure both for storing and operating on data.</div><div><br></div><div>Despite numerous successes in the field, however, several challenges remain open, including (but not limited to) extending techniques to more/less structured and massive data. The goal of this Special Issue is precisely to advance research in the field of compressed computation. We welcome submission of high-quality papers dealing with compressed data structures, data compression, string/tree/graph processing, and combinatorics.</div><div><br></div><div>The following topics will be the central (but not exclusive) themes of the volume:</div><div><br></div><div>- Compressed data structures</div><div>- Data compression</div><div>- String and graph processing</div><div>- Combinatorics on strings and graphs</div><div>- Text indexing</div><div>- Pattern matching</div><div><br></div><div>More details for the special issue can be found at:</div><div><a href="https://www.mdpi.com/journal/algorithms/special_issues/Compressed_Computation" target="_blank">https://www.mdpi.com/journal/algorithms/special_issues/Compressed_Computation</a></div><div><br></div><div>Dr. Alberto Policriti</div><div>Dr. Nicola Prezza</div><div>Guest Editors</div><br clear="all"><div><br></div>-- <br><div dir="ltr" class="gmail_signature" data-smartmail="gmail_signature"><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div style="color:rgb(0,0,0);margin:0px;padding:0px;border:0px;font-stretch:inherit;font-size:12px;line-height:inherit;font-family:"Segoe UI","Segoe UI Web",Arial,Verdana,sans-serif;vertical-align:baseline;clear:both"><p lang="IT-IT" style="margin:0px;color:windowtext"><span lang="IT-IT" style="margin:0px;padding:0px;border:0px;font-style:inherit;font-weight:bold;font-stretch:inherit;font-size:11pt;line-height:18px;font-family:Arial,Arial_EmbeddedFont,Arial_MSFontService,sans-serif;vertical-align:baseline;color:rgb(0,36,81)"><span style="margin:0px;padding:0px;border:0px;font:inherit;vertical-align:baseline;color:inherit">Nicola Prezza</span></span><span style="margin:0px;padding:0px;border:0px;font-style:inherit;font-variant:inherit;font-weight:inherit;font-stretch:inherit;font-size:11pt;line-height:18px;font-family:Arial,Arial_EmbeddedFont,Arial_MSFontService,sans-serif;vertical-align:baseline;color:inherit"> </span></p></div><div style="color:rgb(0,0,0);margin:0px;padding:0px;border:0px;font-stretch:inherit;font-size:12px;line-height:inherit;font-family:"Segoe UI","Segoe UI Web",Arial,Verdana,sans-serif;vertical-align:baseline;clear:both"><p lang="IT-IT" style="margin:0px;color:windowtext"><span lang="IT-IT" style="margin:0px;padding:0px;border:0px;font-style:inherit;font-weight:inherit;font-stretch:inherit;font-size:9pt;line-height:14px;font-family:Arial,Arial_EmbeddedFont,Arial_MSFontService,sans-serif;vertical-align:baseline;color:rgb(0,36,81)"><span style="margin:0px;padding:0px;border:0px;font:inherit;vertical-align:baseline;color:inherit">Assistant Professor (</span></span><span lang="IT-IT" style="margin:0px;padding:0px;border:0px;font-style:inherit;font-weight:inherit;font-stretch:inherit;font-size:9pt;line-height:14px;font-family:Arial,Arial_EmbeddedFont,Arial_MSFontService,sans-serif;vertical-align:baseline;color:rgb(0,36,81)"><span style="margin:0px;padding:0px;border-width:0px 0px 1px;border-top-style:initial;border-right-style:initial;border-bottom-style:solid;border-left-style:initial;border-top-color:initial;border-right-color:initial;border-bottom-color:transparent;border-left-color:initial;font:inherit;vertical-align:baseline;color:inherit;background-repeat:repeat-x;background-position:0% 100%">research</span></span><span lang="IT-IT" style="margin:0px;padding:0px;border:0px;font-style:inherit;font-weight:inherit;font-stretch:inherit;font-size:9pt;line-height:14px;font-family:Arial,Arial_EmbeddedFont,Arial_MSFontService,sans-serif;vertical-align:baseline;color:rgb(0,36,81)"><span style="margin:0px;padding:0px;border:0px;font:inherit;vertical-align:baseline;color:inherit">)</span></span><span style="margin:0px;padding:0px;border:0px;font-style:inherit;font-variant:inherit;font-weight:inherit;font-stretch:inherit;font-size:9pt;line-height:14px;font-family:Arial,Arial_EmbeddedFont,Arial_MSFontService,sans-serif;vertical-align:baseline;color:inherit"> </span></p></div><div style="color:rgb(0,0,0);margin:0px;padding:0px;border:0px;font-stretch:inherit;font-size:12px;line-height:inherit;font-family:"Segoe UI","Segoe UI Web",Arial,Verdana,sans-serif;vertical-align:baseline;clear:both"><p lang="IT-IT" style="margin:0px;color:windowtext"><span lang="IT-IT" style="margin:0px;padding:0px;border:0px;font-style:inherit;font-weight:inherit;font-stretch:inherit;font-size:9pt;line-height:14px;font-family:Arial,Arial_EmbeddedFont,Arial_MSFontService,sans-serif;vertical-align:baseline;color:rgb(0,36,81)"><span style="margin:0px;padding:0px;border:0px;font:inherit;vertical-align:baseline;color:inherit">Dipartimento di Impresa e Management, Luiss Guido Carli, Roma</span></span></p><p lang="IT-IT" style="margin:0px;color:windowtext"><span lang="IT-IT" style="margin:0px;padding:0px;border:0px;font-style:inherit;font-weight:inherit;font-stretch:inherit;font-size:9pt;line-height:14px;font-family:Arial,Arial_EmbeddedFont,Arial_MSFontService,sans-serif;vertical-align:baseline;color:rgb(0,36,81)"><span style="margin:0px;padding:0px;border:0px;font:inherit;vertical-align:baseline;color:inherit">+39 0685225386</span></span></p></div></div></div></div></div></div></div></div>