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
Parents
86
Online clustering of parallel data streams
Jürgen Beringer, Eyke Hüllermeier · Data & Knowledge Engineering · 2005 · 241 citations
Optimal Sorting Algorithms for Parallel Computers
Baudet, Stevenson · IEEE Transactions on Computers · 1978 · 157 citations
A Streaming Parallel Decision Tree Algorithm
Yael Ben‐Haim, Elad Tom-Tov · 2010 · 139 citations
1–5 of 86
246
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 246
110
Georgia Institute of Technology
Atlanta, United States
4 h-index
14 publications
649 citations
IBM (United States)
Armonk, United States
3 h-index
7 publications
161 citations

Lawrence Berkeley National Laboratory
Berkeley, United States
3 h-index
4 publications
62 citations

University of Turin
Turin, Italy
3 h-index
3 publications
85 citations

Concordia University
Montreal, Canada
3 h-index
6 publications
124 citations
Princeton University
Princeton, United States
3 h-index
9 publications
409 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
6 publications
467 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
2 publications
86 citations
1–8 of 110
Repository · 3 publications · 49 citations
3
h-index
2 publications · 259 citations
2
h-index
TPDS · 2 publications · 66 citations
2
h-index
2 publications · 30 citations
2
h-index
PVLDB · 2 publications · 279 citations
2
h-index
1–5