One-pass Algorithms
One-Pass Algorithms is a class of streaming algorithms that processes each element of an input data stream exactly once in a sequential manner, without revisiting prior elements, thereby ensuring linear time complexity and sublinear space usage for efficient large-scale data processing.
264
Publications
18.8K
Citations
646
Authors
292
Institutions
Publications per year
2017–2026
49
Variants
Single-pass Algorithms
Parents
264
A general regression neural network
Donald F. Specht · IEEE Transactions on Neural Networks · 1991 · 4.5K citations
Density-Based Clustering over an Evolving Data Stream with Noise
Feng Cao, Martin Estert, Weining Qian et al. · 2006 · 1K citations
Streaming-data algorithms for high-quality clustering
Liadan O'Callaghan, Nita Mishra, Adam Meyerson et al. · 2003 · 579 citations
1–5 of 264
646
7
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 646
292
Tsinghua University
Beijing, China
9 h-index
18 publications
587 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
9 h-index
23 publications
975 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
19 publications
1.3K citations
University of Pennsylvania
Philadelphia, United States
7 h-index
12 publications
1.6K citations
AT&T (United States)
Bedminster, United States
7 h-index
10 publications
849 citations
IBM (United States)
Armonk, United States
6 h-index
7 publications
504 citations

University of Waterloo
Waterloo, Canada
5 h-index
8 publications
197 citations
Brown University
Providence, United States
5 h-index
7 publications
510 citations
1–8 of 292
Repository · 11 publications · 287 citations
11
h-index
6 publications · 323 citations
6
h-index
TPAMI · 6 publications · 348 citations
6
h-index
Repository · 5 publications · 104 citations
5
h-index
PVLDB · 4 publications · 158 citations
4
h-index
1–5