Resource-bounded Computation
Resource-Bounded Computation is a computational process constrained by specified limits on time, space, or other computational resources, distinguishing it from unbounded or idealized models of computation by explicitly accounting for the feasibility of computation under practical resource restrictions.
127
Publications
7.8K
Citations
287
Authors
149
Institutions
Publications per year
2017–2026
31
Parents
127
On data-limited and resource-limited processes
Donald A. Norman, Daniel G. Bobrow · Cognitive Psychology · 1975 · 2.4K citations
Moderately hard, memory-bound functions
Martı́n Abadi, Mike Burrows, Mark S. Manasse et al. · ACM Transactions on Internet Technology · 2005 · 216 citations
1–5 of 127
287
5
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 287
149
Tsinghua University
Beijing, China
5 h-index
14 publications
577 citations

University of Nottingham
Nottingham, United Kingdom
5 h-index
10 publications
262 citations

Cornell University
Ithaca, United States
4 h-index
6 publications
358 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
5 publications
234 citations
IBM (United States)
Armonk, United States
3 h-index
15 publications
1.1K citations

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
4 publications
171 citations

University of St Andrews
St Andrews, United Kingdom
3 h-index
5 publications
301 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
5 publications
289 citations
1–8 of 149
4 publications · 440 citations
4
h-index
3 publications · 49 citations
3
h-index
MSCS · 3 publications · 94 citations
3
h-index
Repository · 3 publications · 131 citations
3
h-index
3 publications · 63 citations
3
h-index
1–5