Parallel Streaming Algorithms

Parallel Streaming Algorithms is a class of algorithmic methods designed to process massive data streams by simultaneously executing multiple computational tasks in parallel, distinguished from sequential streaming algorithms by their ability to leverage concurrent processing architectures for improved throughput and scalability.

86

Publications

3.8K

Citations

246

Authors

110

Institutions

Publications per year

2017–2026

22

Authors

246

  1. DA
    David A. Bader

    Georgia Institute of Technology, United States

    3 publications · 126 citations

    3

    h-index

  2. SK
    Scott Klasky

    Oak Ridge National Laboratory, United States

    2 publications · 91 citations

    2

    h-index

  3. MT
    Massimo Torquati

    University of Pisa, Italy

    2 publications · 62 citations

    2

    h-index

  4. HC
    Hank Childs

    Lawrence Berkeley National Laboratory, United States

    2 publications · 31 citations

    2

    h-index

  5. DF
    Dan Feldman

    University of Haifa, Israel

    2 publications · 71 citations

    2

    h-index

1–5 of 246

Venues

  1. arXiv (Cornell University)

    Repository · 3 publications · 49 citations

    3

    h-index

  2. IEEE Transactions on Computers

    2 publications · 259 citations

    2

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 66 citations

    2

    h-index

  4. The Journal of Supercomputing

    2 publications · 30 citations

    2

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 2 publications · 279 citations

    2

    h-index

1–5