Concepedia

I/o Complexity

I/O Complexity is a computational complexity measure that quantifies the number of input/output operations required by an algorithm to solve a problem, distinguishing it from other complexity measures by focusing specifically on data transfer costs between hierarchical memory levels rather than CPU operations.

66

Publications

3K

Citations

156

Authors

84

Institutions

Publications per year

2017–2026

9

Parents

Publications

66

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness

Tri Dao, Daniel Y. Fu, Stefano Ermon et al. · arXiv (Cornell University) · 2022 · 459 citations · Full text

, , +17

Repair Locality With Multiple Erasure Tolerance

Wang An-yu, Zhifang Zhang · IEEE Transactions on Information Theory · 2014 · 198 citations · Full text

, , +17

Complexity results for HTN planning

Kutluhan Erol, James Hendler, Dana Nau · Annals of Mathematics and Artificial Intelligence · 1996 · 195 citations

, , +7

CLOUDS: a decision tree classifier for large datasets

Khaled Alsabti, Sanjay Ranka, Vineet Kumar Singh · Syracuse University Libraries (Syracuse University) · 1998 · 148 citations · Full text

, , +17

Cognitive style and complexity: Implications for I/O psychology.

Siegfried Streufert, Glenda Y. Nogami · 1989 · 132 citations

, , +13

1–5 of 66

Authors

156

  1. YT
    Yufei Tao

    Chinese University of Hong Kong, Hong Kong SAR China

    6 publications · 203 citations

    6

    h-index

  2. DF
    Doru Florin Chiper

    Gheorghe Asachi Technical University of Iași, Romania

    4 publications · 115 citations

    4

    h-index

  3. YC
    Yanchuan Chang

    The University of Melbourne, Australia

    3 publications · 80 citations

    3

    h-index

  4. JQ
    Jianzhong Qi

    The University of Melbourne, Australia

    3 publications · 80 citations

    3

    h-index

  5. RZ
    Rui Zhang

    The University of Melbourne, Australia

    3 publications · 80 citations

    3

    h-index

1–5 of 156

Institutions

84

  1. Chinese University of Hong Kong

    Hong Kong, Hong Kong

    6 h-index

    7 publications

    236 citations

  2. AT&T (United States)

    Bedminster, United States

    4 h-index

    4 publications

    179 citations

  3. University of Illinois Urbana-Champaign

    Urbana, United States

    4 h-index

    6 publications

    458 citations

  4. The University of Melbourne

    Melbourne, Australia

    3 h-index

    9 publications

    240 citations

  5. Gheorghe Asachi Technical University of Iași

    Iasi, Romania

    3 h-index

    4 publications

    79 citations

  6. IBM (United States)

    Armonk, United States

    2 h-index

    4 publications

    119 citations

  7. École Normale Supérieure de Lyon

    Lyon, France

    2 h-index

    4 publications

    78 citations

  8. Korea Advanced Institute of Science and Technology

    Daejeon, South Korea

    2 h-index

    5 publications

    206 citations

1–8 of 84

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 3 publications · 121 citations

    3

    h-index

  2. Journal of the ACM

    JACM · 3 publications · 128 citations

    3

    h-index

  3. 2

    h-index

  4. ACM Transactions on Database Systems

    TODS · 2 publications · 54 citations

    2

    h-index

  5. Symposium on Discrete Algorithms

    Conference · 2 publications · 55 citations

    2

    h-index

1–5