Memory-bounded Algorithms

Memory-Bounded Algorithms is a computational method designed to operate within a predetermined limit of available memory space, distinguishing it from general algorithms by explicitly constraining resource usage to ensure scalability and feasibility in memory-limited environments.

147

Publications

21.7K

Citations

356

Authors

196

Institutions

Publications per year

2017–2026

21

Authors

356

  1. CH
    Chien‐Chung Huang

    National Cheng Kung University, Taiwan

    3 publications · 45 citations

    3

    h-index

  2. MK
    Matias Korman

    Universitat Politècnica de Catalunya, Spain

    3 publications · 62 citations

    3

    h-index

  3. TA
    Tetsuo Asano

    Japan Advanced Institute of Science and Technology, Japan

    3 publications · 66 citations

    3

    h-index

  4. JG
    Johannes Gehrke

    Cornell University, United States

    2 publications · 435 citations

    2

    h-index

  5. CF
    Chee Fen Yu

    University of Illinois Urbana-Champaign, United States

    2 publications · 61 citations

    2

    h-index

1–5 of 356

Venues

  1. arXiv (Cornell University)

    Repository · 11 publications · 364 citations

    10

    h-index

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

    Repository · 5 publications · 72 citations

    5

    h-index

  3. IEEE Transactions on Software Engineering

    TSE · 3 publications · 72 citations

    3

    h-index

  4. Mathematical Programming

    3 publications · 8.6K citations

    3

    h-index

  5. European Journal of Operational Research

    2 publications · 27 citations

    2

    h-index

1–5