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
Parents
147
A Limited Memory Algorithm for Bound Constrained Optimization
Richard H. Byrd, Peihuang Lu, Jorge Nocedal et al. · SIAM Journal on Scientific Computing · 1995 · 6.2K citations
BOAT—optimistic decision tree construction
Johannes Gehrke, Raghu Ramakrishnan, Wei‐Yin Loh · ACM SIGMOD Record · 1999 · 288 citations · Full text
1–5 of 147
356
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 356
196
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
7 publications
175 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
4 h-index
7 publications
351 citations
Purdue University West Lafayette
West Lafayette, United States
4 h-index
9 publications
898 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
3 publications
33 citations
University of Maryland, College Park
College Park, United States
3 h-index
4 publications
192 citations
École Normale Supérieure - PSL
Paris, France
3 h-index
3 publications
45 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
4 publications
74 citations

National Institute of Informatics
Tokyo, Japan
3 h-index
3 publications
47 citations
1–8 of 196
Repository · 11 publications · 364 citations
10
h-index
Repository · 5 publications · 72 citations
5
h-index
TSE · 3 publications · 72 citations
3
h-index
3 publications · 8.6K citations
3
h-index
2 publications · 27 citations
2
h-index
1–5