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.
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:
- Streaming graph algorithms;
- Streaming computational geometry algorithms;
- Streaming text processing algorithms;
- Streaming approximation algorithms;
- Sketching and data summarization;
- Dynamic graph algorithms;
- Continuous monitoring streaming algorithms;
- Sublinear algorithms;
- Hardness and lowerbounds in streaming computation;
- Deamortization in computation.
More details for the special issue can be found at:
https://www.mdpi.com/journal/algorithms/special_issues/real_time_streams
Deadline for manuscript submissions: *31 October 2020*.
Guest Editor,
Przemek Uznański,
Assistant Professor, Institute of Computer Science, University of Wrocław,
Poland
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
