<div dir="ltr"><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">Dear Colleagues,</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">The streaming model of computation forms the backbone of modern data processing algorithms. The setting provides a framework for analyzing massive datasets in a setting with limited space, where data are no longer stored forever, but instead processed, summarized, and discarded accordingly by the computing unit. The practicality of streaming algorithms greatly depends not only on the space but also on the time complexity—we expect solutions where data can be processed in real-time, avoiding backlogs and congestion.</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">The aim of this Special Issue is to present state-of-the-art algorithms used in real-time stream processing. The possible topics of interest include but are not limited to the following areas:</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Streaming graph algorithms;</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Streaming computational geometry algorithms;</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Streaming text processing algorithms;</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Streaming approximation algorithms;</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Sketching and data summarization;</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Dynamic graph algorithms;</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Continuous monitoring streaming algorithms;</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Sublinear algorithms;</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Hardness and lowerbounds in streaming computation;</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">- Deamortization in computation.</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px"><br></p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">More details for the special isue can be found at:<br><a href="https://www.mdpi.com/journal/algorithms/special_issues/real_time_streams">https://www.mdpi.com/journal/algorithms/special_issues/real_time_streams</a><br></p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px"><br></p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">Guest Editor,</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">Przemek Uznański,</p><p style="box-sizing:border-box;margin:0px 0px 10px;padding:0px;font-family:Arial;font-size:12px;line-height:1.6;max-height:1e +06px">Assistant Professor, Institute of Computer Science, University of Wrocław, Poland</p></div>