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

Authors

646

  1. DP
    David P. Woodruff

    IBM Research - Almaden, United States

    7 publications · 299 citations

    7

    h-index

  2. SL
    Suh-Yin Lee

    National Yang Ming Chiao Tung University, Taiwan

    5 publications · 213 citations

    5

    h-index

  3. HL
    Hua-Fu Li

    National Yang Ming Chiao Tung University, Taiwan

    5 publications · 213 citations

    5

    h-index

  4. CC
    Charų C. Aggarwal

    IBM (United States), United States

    4 publications · 502 citations

    4

    h-index

  5. PS
    Philip S. Yu

    University of Illinois Chicago, United States

    4 publications · 527 citations

    4

    h-index

1–5 of 646

Venues

  1. arXiv (Cornell University)

    Repository · 11 publications · 287 citations

    11

    h-index

  2. 6

    h-index

  3. 6

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 5 publications · 104 citations

    5

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 4 publications · 158 citations

    4

    h-index

1–5